Chained Lin-Kernighan for large traveling salesman problems

INFORMS Journal on Computing

Volumn 15, Issue 1, 2003, Pages 82-92

  Applegate, David ^a   Cook, William ^b   Rohe, André ^c  

^a AT AND T LABS RESEARCH   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c UNIVERSITY OF BONN   (Germany)

Author keywords

Heuristics; Networks Graphs; Traveling Salesman

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER WORKSTATIONS; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

COMPUTATION TIME; CPU; SILICON GRAPHICS;

TRAVELING SALESMAN PROBLEM;

EID: 2442515836     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.15.1.82.15157     Document Type: Review

References (41)

1. Applegate, D., R. Bixby, V. Chvátal, W. Cook. 1998. On the solution of traveling salesman problems. Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung, International Congress of Mathematicians, 645-656.
2. Applegate, D., R. Bixby, V. Chvátal, W. Cook. 1999. Finding tours in the TSP. Report Number 99885, Research Institute for Discrete Mathematics, Universität Bonn, Bonn, Germany.
3. Applegate, D., R. Bixby, V. Chvátal, W. Cook. 2001. TSP cuts which do not conform to the template paradigm. M. Jünger, D. Naddef, eds. Computational Combinatorial Optimization. Springer, Heidelberg, Germany, 261-304.
4. Applegate, D., V. Chvátal, W. Cook. 1990. Lower bounds for the travelling salesman problem. TSP '90. Technical report CRPC-TR90547, Center for Research in Parallel Computing, Rice University, Houston, TX.
5. Beardwood, J., J. H. Halton, J. M. Hammersley. 1959. The shortest path through many points. Proceedings of the Cambridge Philosophical Society 55 299-327.
6. Bentley, J. L. 1992. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing 4 387-411.
7. Bland, R. G., D. F. Shallcross. 1989. Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation. Operations Research Letters 8 125-128.
8. Borůvka, O. 1926. On a certain minimal problem (in Czech). Práce Moravské Přírodavědecké Společnosti 3 37-58.
9. Cerf, N. J., J. Boutet de Monvel, O. Bohigas, O. C. Martin, A. G. Percus. 1997. The random link approximation for the Euclidean traveling salesman problem. Journal de Physique I 7 117-136.
10. Christofides, N. 1976. Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
11. Chrobak, M., T. Szymacha, A. Krawczyk. 1990. A data structure useful for finding Hamiltonian cycles. Theoretical Computer Science 71 419-424.
12. Codenotti, B., G. Manzini, L. Margara, G. Resta. 1996. Perturbation: an efficient technique for the solution of very large instances of the Euclidean TSP. INFORMS Journal on Computing 8 125-133.
13. Cook, W., P. D. Seymour. 1993. An algorithm for the ring-routing problem. Technical Memorandum, Bellcore, Morristown, NJ.
14. Fortune, S. J. 1987. A sweepline algorithm for Voronoi diagrams. Algorithmica 2 153-174.
15. Fortune, S. J. 1994. sweep2. Computer code (in the C programming language), www.netlib.org/voronoi/sweep2.
16. Fredman, M. L., D. S. Johnson, L. A. McGeoch, G. Ostheimer. 1995. Data structures for traveling salesmen. Journal of Algorithms 18 432-479.
17. Held, M., R. M. Karp. 1971. The traveling-salesman problem and minimum spanning trees: part II. Mathematical Programming 1 6-25.
18. Helsgaun, K. 2000. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 126 106-130. The LKH code is available at http://www.dat.ruc.dk/~keld/research/LKH/.
19. Hong, I., A. B. Kahng, B. Moon. 1997. Improved large-step markov chain variants for the symmetric TSP. Journal of Heuristics 3 63-81.
20. Johnson, D. S. 1990. Local optimization and the traveling salesman problem. Proceedings 17th Colloquium of Automata, Languages, and Programming, Lecture Notes in Computer Science, No. 443. Springer-Verlag, Berlin, Germany, 446-461.
21. Johnson, D. S., L. A. McGeoch. 1997. The traveling salesman problem: a case study in local optimization. E. H. L. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. Wiley, New York, 215-310.
22. Johnson, D. S., L. A. McGeoch, E. E. Rothberg. 1996. Asymptotic experimental analysis for the Held-Karp traveling salesman bound. Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, New York, 341-350.
23. Johnson, D. S., C. H. Papadimitriou. 1985. Performance guarantees for heuristics. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds. The Traveling Salesman Problem. Wiley, Chichester, U.K., 145-180.
24. Jünger, M., G. Reinelt, G. Rinaldi. 1995. The traveling salesman problem. M. Ball, T. Magnanti, C. L. Monma, G. Nemhauser, eds. Handbook on Operations Research and Management Sciences: Networks. North-Holland, Amsterdam, The Netherlands, 225-330.
25. Karp, R. M., J. M. Steele. 1985. Probabilistic analysis of heuristics. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds. The Traveling Salesman Problem. Wiley, Chichester, U.K., 181-205.
26. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. 1985. The Traveling Salesman Problem. Wiley, Chichester, U.K.
27. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21 498-516.
28. Mak, K.-T., A. J. Morton. 1993. A modified Lin-Kernighan traveling-salesman heuristic. Operations Research Letters 13 127-132.
29. Martin, O. C., S. W. Otto. 1996. Combining simulated annealing with local search heuristics. Annals of Operations Research 63 57-75.
30. Martin, O., S. W. Otto, E. W. Felten. 1991. Large-step Markov chains for the traveling salesman problem. Complex Systems 5 299-326.
31. Martin, O., S. W. Otto, E. W. Felten. 1992. Large-step Markov chains for the TSP incorporating local search heuristics. Operations Research Letters 11 219-224.
32. Miller, D. L., J. F. Pekny. 1995. A staged primal-dual algorithm for perfect b-matching with edge capacities. ORSA Journal on Computing 7 298-320.
33. Neto, D. 1999. Efficient Cluster Compensation for Lin-Kernighan Heuristics. Ph.D. thesis, Department of Computer Science, University of Toronto, Toronto, Ontario, Canada.
34. Percus, A. G., O. C. Martin. 1996. Finite size and dimensional dependence in the Euclidean traveling salesman problem. Physical Review Letters 76 1188-1191.
35. Perttunen, J. 1994. On the significance of the initial solution in travelling salesman heuristics. Journal of the Operational Research Society 45 1131-1140.
36. Reinelt, G. 1991. TSPLIB - A traveling salesman library. ORSA Journal on Computing 3 376-384.
37. Reinelt, G. 1994. The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag, Berlin, Germany.
38. Reinelt, G. 1995. TSPLIB 95. Research Report, Institut für Angewandte Mathematik, Universität Heidelberg, Heidelberg, Germany. Updated results available at http://www.iwr. uni-heidelberg.de/groups/comopt/software/ TSPLIB95/.
39. Rohe, A. 1997. Parallele Heuristiken für sehr grosse Traveling Salesman Probleme. Diplomarbeit, Research Institute for Discrete Mathematics, Universität Bonn, Bonn, Germany.
40. Schäfer, M. 1994. Effiziente Algorithmen für sehr grosse Traveling Salesman Probleme. Diplomarbeit, Research Institute for Discrete Mathematics, Universität Bonn, Bonn, Germany.
41. Verhoeven, M. G. A., E. H. L. Aarts, E. van de Sluis, R. J. M. Vaessens. 1995. Parallel local search and the travelling salesman problem. R. Männer, B. Manderick, eds. Parallel Problem Solving from Nature 2. North-Holland, Amsterdam, The Netherlands, 543-552.