An Analysis of the Hardness of TSP Instances for Two High-performance Algorithms

  title={An Analysis of the Hardness of TSP Instances for Two High-performance Algorithms},
  author={Thomas Fischer and Thomas St{\"u}tzle and Holger H. Hoos and Peter Merz},
The task in the Traveling Salesman Problem (TSP) is to find a minimum length closed tour through a given set of n cities with known inter-city distances such that each city is visited exactly once. The TSP has played a central role in the development of many Stochastic Local Search (SLS) algorithms, such as Ant Colony Optimization [5], or Simulated Annealing [9]. Currently, the best performing SLS algorithms for the TSP strongly rely on the exploitation of high-performing local search… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 14 references

Ant Colony Optimization

Handbook of Approximation Algorithms and Metaheuristics • 2007
View 1 Excerpt


G. Reinelt
Vienna, Austria, August • 2004
View 1 Excerpt

Tour Merging via Branch-Decomposition

INFORMS Journal on Computing • 2003
View 1 Excerpt

Experimental analysis of heuristics for the STSP

D. S. Johnson, L. A. McGeoch
View 2 Excerpts

An effective implementation of the Lin-Kernighan traveling salesman heuristic

European Journal of Operational Research • 2000
View 3 Excerpts

Finding tours in the TSP

D. Applegate, R. Bixby, V. Chvátal, W. Cook
Technical Report 99885, • 1999
View 1 Excerpt

Similar Papers

Loading similar papers…