(Enter summary)
Abstract: This report describes an implementation of the Lin-Kernighan heuristic,
one of the most successful methods for generating optimal or nearoptimal
solutions for the symmetric traveling salesman problem. Computational
tests show that the implementation is highly effective. It has
found optimal solutions for all solved problem instances we have been
able to obtain, including a 7397-city problem (the largest nontrivial
problem instance solved to optimality today). Furthermore, the algorithm... (Update)
Context of citations to this paper: More
...reasonable time using the technique described in Section 2.1. Moreover, the publicly available implementation of Helsgaun s heuristic [17] should suffice for most practical situations when instances are this small. It gets within 0.3 of optimal within a (normalized) second...
...of the current heuristics are hard to beat. For instance, the N=10 iteration version of the publicly available LKH code of Keld Helsgaun [40] can get within 0.2 of optimum in no more than 20 seconds (normalized) for each of our 1,000 city random instances and for the six...
Cited by: More
A Multilevel Lin-Kernighan-Helsgaun Algorithm for the Travelling.. - Walshaw (2001)
(Correct)
Local Search for the Colouring Graph Problem. A.. - Chiarandini..
(Correct)
Experimental Analysis Of Heuristics For The STSP - Johnson (2001)
(Correct)
Active bibliography (related documents): More All
0.0: TSP Cuts Which Do Not Conform to the Template Paradigm - Applegate, Bixby.. (2001)
(Correct)
0.0: A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)
(Correct)
0.0: Parallel Algorithm Design for Workstation Clusters - Magee, Cheung (1991)
(Correct)
Similar documents based on text: More All
0.5: Discrete Event Simulation in Java - Helsgaun
(Correct)
0.5: A Portable C++ Library for Coroutine Sequencing - Helsgaun
(Correct)
0.5: jDisco - a Java package for combined discrete and continuous.. - Helsgaun
(Correct)
Related documents from co-citation: More All
4: The traveling salesman problem and minimum spanning trees: Part II (context) - Held, Karp - 1971
3: A multilevel approach to the travelling salesman problem
- Walshaw
3: Large-step markov chains for the traveling salesman problem
- Martin, Otto et al. - 1991
BibTeX entry: (Update)
K. Helsgaun. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operations Research, 12:106--130, 2000. Source code currently available from the author's http://www.dat.ruc.dk/keld/. http://citeseer.ist.psu.edu/helsgaun00effective.html More
@article{ helsgaun00effective,
author = "K. {HELSGAUN}",
title = "An effective implementation of the {L}in-{K}ernighan traveling salesman heuristic",
journal = "European J. Oper. Res.",
volume = "126",
number = "1",
pages = "106--130",
year = "2000",
url = "citeseer.ist.psu.edu/helsgaun00effective.html" }
Citations (may not include all citations):
773
Reducibility among Combinatorial Problems (context) - Karp
141
An Effective Heuristic Algorithm for the Traveling-Salesman .. (context) - Lin, Kernighan - 1973
106
The Traveling Salesman Problem: A Guided Tour of Combinatori.. (context) - Lawler, Lenstra et al. - 1985
48
Solution of a large-scale traveling-salesman problem (context) - Dantzig, Fulkerson et al. - 1954
25
An algorithm for the traveling salesman problem (context) - Little, Murty et al. - 1963
Documents on the same site (http://www.dat.ruc.dk/~keld/research/PUB.index.html):
A Portable C++ Library for Coroutine Sequencing - Helsgaun
(Correct)
Discrete Event Simulation in Java - Helsgaun
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC