Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP [chapter]

Boris Goldengorin, Gerold Jäger, Paul Molitor
2006 Lecture Notes in Computer Science  
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heuristic. Our improvement is based on replacing the selection of each path to be contracted after deleting a heaviest arc from each short cycle in an Optimal Assignment Problem Solution (OAPS) by contracting a single arc from a short cycle in an OAPS with the largest upper tolerance with respect to one of the relaxed
more » ... P. The improved algorithm produces higher-quality tours than all previous COP versions and is clearly outperforming all other construction heuristics on robustness.
doi:10.1007/11922377_8 fatcat:3pzqmzhgfzhopfm75syxekq7qi