A data structure useful for finding Hamiltonian cycles
Theoretical Computer Science
Data structures for traveling salesmen
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
A Multilevel Approach to the Travelling Salesman Problem
Operations Research
Efficient cluster compensation for lin-kernighan heuristics
Efficient cluster compensation for lin-kernighan heuristics
Chained Lin-Kernighan for Large Traveling Salesman Problems
INFORMS Journal on Computing
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
Fast ejection chain algorithms for vehicle routing with time windows
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
International Journal of Bio-Inspired Computation
A backbone based TSP heuristic for large instances
Journal of Heuristics
Hi-index | 0.01 |
The state-of-the-art of local search heuristics for the traveling salesman problem (TSP) is chiefly based on algorithms using the classical Lin-Kernighan (LK) procedure and the stem-and-cycle (S&C) ejection chain method. Critical aspects of implementing these algorithms efficiently and effectively rely on taking advantage of special data structures and on maintaining appropriate candidate lists to store and update potentially available moves. We report the outcomes of an extensive series of tests on problems ranging from 1000 to 1,000,000 nodes, showing that by intelligently exploiting elements of data structures and candidate lists routinely included in state-of-the-art TSP solution software, the S&C algorithm clearly outperforms all implementations of the LK procedure. Moreover, these outcomes are achieved without the use of special tuning and implementation tricks that are incorporated into the leading versions of the LK procedure to enhance their computational efficiency. y.