Tolerance based contract-or-patch heuristic for the asymmetric TSP

Authors:
Boris Goldengorin;Gerold Jäger;Paul Molitor
Affiliations:
Faculty of Economic Sciences, University of Groningen, Groningen, The Netherlands;Computer Science Institute, University of Halle-Wittenberg, Halle (Saale), Germany;Computer Science Institute, University of Halle-Wittenberg, Halle (Saale), Germany
Venue:
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Year:
2006

Citing 6
Cited 6

A shortest augmenting path algorithm for dense and sparse linear assignment problems

Computing
Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems

ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
An annotated bibliography for post-solution analysis in mixed integer programming and combinatorial optimization

Advances in computational and stochastic optimization, logic programming, and heuristic search
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
Some basics on tolerances

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Tolerance based algorithms for the ATSP

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Improving the efficiency of Helsgaun's Lin-Kernighan Heuristic for the symmetric TSP

CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
An effective algorithm for and phase transitions of the directed hamiltonian cycle problem

Journal of Artificial Intelligence Research
The effect of the asymmetry of road transportation networks on the traveling salesman problem

Computers and Operations Research
A SAT based effective algorithm for the directed hamiltonian cycle problem

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 ATSP. The improved algorithm produces higher-quality tours than all previous COP versions and is clearly outperforming all other construction heuristics on robustness.