Effective implementation of the Lin-Kernighan traveling salesman heuristic

European Journal of Operational Research

Volumn 126, Issue 1, 2000, Pages 106-130

  Helsgaun, Keld ^a  

^a ROSKILDE UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; SENSITIVITY ANALYSIS;

LIN KERNIGHAN TRAVELING SALESMAN HEURISTIC;

TRAVELING SALESMAN PROBLEM;

EID: 0034301999     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00284-2     Document Type: Article

References (48)

1. Lin S., Kernighan B.W. An effective heuristic algorithm for the traveling salesman problem. Operations Research. 21:1973;498-516.
2. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York, 1985.
3. Padberg M.W., Rinaldi G. A branch-and-cut algorithm for the resolution of large-scalesymmetric traveling salesman problems. SIAM Review. 33:1991;60-100.
4. Grötchel M., Holland O. Solution of large scale symmetric traveling salesman problems. Mathematical Programming. 51:1991;141-202.
5. D. Applegate, R. Bixby, V. Chvàtal, W. Cook, Finding cuts in the TSP (A preliminary report), DIMACS, Tech. Report 95-05, 1995.
6. D. Applegate, R. Bixby, V. Chvàtal, W. Cook, Microelectronics Technology Alert, July 1998. http://www.crpc.rice.edu/CRPC/newsArchive/mta_7_24_98.html.
7. Lin S. Computer solutions of the traveling salesman problem. Bell System Technical Journal. 44:1965;2245-2269.
8. Christofides N., Eilon S. Algorithms for large-scale traveling salesman problems. Operations Research Quarterly. 23:1972;511-518.
9. Johnson D.S. Local optimization and the traveling salesman problem. Lecture Notes in Computer Science. 442:1990;446-461.
10. Johnson D.S., McGeoch L.A. The traveling salesman problem: A case study in local optimization. Aarts E.H.L., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;Wiley, New York.
11. Padberg M.W., Rinaldi G. Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Operations Research Letters. 6:1987;1-7.
12. Held M., Karp R.M. The traveling salesman problem and minimum spanning trees. Operations Research. 18:1970;1138-1162.
13. Held M., Karp R.M. The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming. 1:1971;16-25.
14. Prim R.C. Shortest connection networks and some generalizations. Bell System Technical Journal. 36:1957;1389-1401.
15. Volgenant T., Jonker R. The symmetric traveling salesman problem and edge exchanges i minimal 1-trees. European Journal of Operational Research. 12:1983;394-403.
16. Carpaneto G., Fichetti M., Toth P. New lower bounds for the symmetric traveling salesman problem. Mathematical Programming. 45:1989;233-254.
17. Held M., Wolfe P., Crowder H.P. Validation of subgradient optimization. Mathematical Programming. 6:1974;62-88.
18. Crowder H.P. Computational improvements of subgradient optimization. IBM Research Report RC. 4907(21841):1974.
19. Camerini P.M., Fratta L., Maffioli F. On improving relaxation methods by modified gradient techniques. Mathematical Programming Study. 3:1976;26-34.
20. Bazaraa M.S., Sherali H.D. On the choice of step size in subgradient optimization. European Journal of Operational Research. 7:1981;380-388.
21. Volgenant T., Jonker R. A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation. European Journal of Operational Research. 9:1982;83-89.
22. Helbig-Hansen K.H., Krarup J. Improvements of the Held-Karp algorithm for the symmetric traveling salesman problem. Mathematical Programming. 7:1974;87-96.
23. Stewart W.R. Jr. Accelerated branch exchange heuristics for symmetric traveling salesman problems. Networks. 17:1987;423-437.
24. Reinelt G. Fast heuristics for large geometric traveling salesman problems. ORSA Journal on Computing. 2:1992;206-217.
25. Reinelt G. The traveling salesman: Computational solutions for TSP applications. Lecture Notes in Computer Science. 840:1994.
26. Adrabinski A., Syslo M.M. Computational experiments with some approximation algorithms for the traveling salesman problem. Zastosowania Matematyki. 18:1983;91-95.
27. Perttunen J. On the Significance of the initial solution in traveling salesman heuristics. Journal of the Operational Research Society. 45:1994;1131-1140.
28. Clarke G., Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research. 12:1964;568-581.
29. N. Christofides, Worst Case Analysis of a New Heuristic for the Traveling Salesman Problem, Report 388. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburg, 1976.
30. Mak K.-T., Morton A.J. Distances between traveling salesman tours. Discrete Applied Mathematics. 58:1995;281-291.
31. D. Applegate, R.E. Bixby, V. Chvàtal, W. Cook, Data Structures for the Lin-Kernighan Heuristic, Talk presented at the TSP-Workshop, CRCP, Rice University, 1990.
32. L. Hárs, Reversible-segment list, Report No 89596-OR, Forshunginstitut für Discrete Mathematik, Bonn, 1989.
33. Margot F. Quick updates for p-opt TSP heuristics. Operations Research Letters. 11:1992;45-46.
34. Fredman M.L., Johnson D.S., McGeoch L.A. Data structures for traveling salesmen. Journal of Algorithms. 16:1995;432-479.
35. J.L. Bentley, K-d trees for semidynamic point sets, Sixth Annual ACM Symposium on Computational Geometry, Berkely, CA, 1990, pp. 187-197.
36. Martin O., Otto S.W., Felten E.W. Large-step markov chains for the traveling salesman problem. Journal of Complex Systems. 5:1991;219-224.
37. Bentley J.L. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing. 4:1992;347-411.
38. Rosenkrantz D.E., Stearns R.E., Lewis II P.M. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing. 6:1977;563-581.
39. Sahni S., Gonzales T. P-complete approximation algorithms. Journal of the Association for Computing Machinery. 23:1976;555-565.
40. Reinelt G. TSPLIB - A traveling salesman problem library. ORSA Journal on Computing. 3(4):1991;376-385.
41. Arthur J.L., Frendewey J.O. Generating traveling salesman problems with known optimal tours. Journal of the Operational Research Society. 39:1988;153-159.
42. K. Helsgaun, An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic, DATALOGISKE SKRIFTER, Roskilde University, No. 81, 1998.
43. J. Beardswood, J.M. Hammersley, The shortest path through many points, in: Proceedings of the Cambridge Philosophical Society, 55, 1959, pp. 299-327.
44. D.S. Johnson, L.A. McGeoch, E.E. Rothenberg, Asymptotic experimental analysis for the Held-Karp traveling salesman problem, in: Proceedings of Seventh ACM SIAM Symposium on Discrete Algorithms Society of Industrial and Applied Mathematics, Philadelphia, York, 1996.
45. Jonker R., Volgenant T. Transforming asymmetric into symmetric traveling salesman problems. Operations Research Letters. 2:1983;161-163.
46. Knuth D.E. Leaper graphs. The Mathematical Gazette. 78:1994;274-297.
47. Papadimitriou C.H., Steiglitz K. Some examples of difficult traveling salesman problems. Operations Research. 26:1978;434-443.
48. Mak K.-T., Morton A.J. A modified Lin-Kernighan traveling salesman heuristic. Operations Research Letters. 13:1993;127-132.