Traveling salesman problem heuristics: Leading methods, implementations and latest advances

European Journal of Operational Research

Volumn 211, Issue 3, 2011, Pages 427-441

  Rego, César ^a   Gamboa, Dorabela ^b   Glover, Fred ^c   Osterman, Colin ^a  

^a UNIVERSITY OF MISSISSIPPI   (United States)

^b Institute Polythecnic of Porto   (Portugal)

^c UNIVERSITY OF COLORADO   (United States)

Author keywords

Ejection chains; Heuristics; Local search; Traveling salesman problem

Indexed keywords

CHAINS; HEURISTIC METHODS;

BENCH-MARK PROBLEMS; COMPUTATIONAL TESTS; EJECTION CHAIN; EXPERIMENTAL ANALYSIS; HEURISTICS; LIN-KERNIGHAN; LOCAL SEARCH;

TRAVELING SALESMAN PROBLEM;

EID: 79952186881     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.09.010     Document Type: Article

References (35)

1. D. Applegate, R. Bixby, V. Chvátal, W. Cook, Concorde: a code for solving Traveling Salesman Problems, 1999. .
2. D. Applegate, R. Bixby, V. Chvátal, W. Cook, Finding tours in TSP, Research Institute for Discrete Mathematics, Universitat Bonn, Bonn, Germany, 99885, 1999.
3. D. Applegate, W. Cook, and A. Rohe Chained Lin-Kernighan for large travelin (Pubitemid 39042734)
4. J.L. Bentley Fast algorithms for geometric traveling salesman problems ORSA Journal on Computing 4 1992 347 411
5. P. Briggs, and L. Torczon An efficient implementation for sparse sets ACM Letters on Programming Languages and Systems 2 1993 59 69
6. N. Christofides, and S. Eilon Algorithms for large-scale traveling salesman problems Operations Research Quarterly 23 1972 511 518
7. M. Chrobak, T. Szymacha, and A. Krawczyk A data structure useful for finding Hamiltonian cycles Theoretical Computer Science 71 1990 419 424 (Pubitemid 20686127)
8. J. Cirasella, D.S. Johnson, L.A. McGeoch, W. Zhang, The asymmetric traveling salesman problem: algorithms, instance generators and tests, in: Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, 2001, pp. 32-59. (Pubitemid 33340063)
9. M.L. Fredman, D.S. Johnson, L.A. McGeoch, and G. Ostheimer Data structures for traveling salesman Journal of Algorithms 18 1995 432 479
10. B. Funke, T. Grünert, and S. Irnich A note on single alternating cycle neighborhoods for the TSP Journal of Heuristics 11 2005 135 146 (Pubitemid 40963385)
11. D. Gamboa, C. Rego, and F. Glover Data structures and ejection chains for solving large-scale traveling salesman problems European Journal of Operational Research 160 2005 154 171
12. D. Gamboa, C. Rego, and F. Glover Implementation analysis of efficient heuristic algorithms for the traveling salesman problem Computers and Operations Research 33 2006 1154 1172 (Pubitemid 41492069)
13. F. Glover New ejection chain and alternating path methods for traveling salesman problems Computer Science and Operations Research 1992 449 509
14. F. Glover Ejection chains, reference structures and alternating path methods for traveling salesman problems Discrete Applied Mathematics 65 1996 223 253 (Pubitemid 126386270)
15. F. Glover Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move Journal of Heuristics 2 1996 169 179 (Pubitemid 126714031)
16. D. Harel, and R.E. Tarjan Fast algorithms for finding nearest common ancestors SIAM Journal on Computing 13 1984 338 355 (Pubitemid 15493878)
17. K. Helsgaun An effective implementation of the Lin-Kernighan traveling salesman heuristic European Journal of Operational Research 126 2000 106 130
18. D.S. Johnson, G. Gutin, L.A. McGeoch, A. Yeo, W. Zhang, and A. Zverovitch Experimental analysis of heuristics for the ATSP G. Gutin, A. Punnen, The Traveling Salesman Problem and Its Variations 2002 Kluwer Academic Publishers Boston 445 487
19. D.S. Johnson, and L.A. McGeoch The traveling salesman problem: a case study in local optimization E.H.L. Aarts, J.K. Lenstra, Local Search in Combinatorial Optimization 1997 John Wiley and Sons, Ltd. 215 310
20. D.S. Johnson, and L.A. McGeoch Experimental analysis of heuristics for the STSP G. Gutin, A. Punnen, The Traveling Salesman Problem and Its Variations 2002 Kluwer Academic Publishers Boston 369 443
21. D.S. Johnson, L.A. McGeoch, F. Glover, C. Rego, 8th DIMACS Implementation Challenge: The Traveling Salesman Problem, 2000. .
22. P.C. Kanellakis, and C.H. Papadimitriou Local search for the asymmetric traveling salesman problem Operations Research 28 1980 1086 1099
23. S. Lin, and B. Kernighan An effective heuristic algorithm for the traveling salesman problem Operations Research 21 1973 498 516
24. O.C. Martin, S.W. Otto, and E.W. Felten Large-step Markov chains for the traveling salesman problem Complex Systems 5 1991 299 326
25. O.C. Martin, S.W. Otto, and E.W. Felten Large-step Markov chains for the TSP incorporating local search heuristics Operations Research Letters 11 1992 219 224
26. D.L. Miller, and J.F. Pekny A staged primal-dual algorithm for perfect B-matching with edge capacities ORSA Journal on Computing 7 1995 298 320
27. D. Neto Efficient Cluster Compensation for Lin-Kernighan Heuristics 1999 Department of Computer Science, University of Toronto
28. C. Osterman, C. Rego, The Satellite List and New Data Structures for Symmetric Traveling Salesman Problems, University of Mississippi, HCES-03-06, 2004.
29. C. Osterman, C. Rego, D. Gamboa, The satellite list: a reversible doubly-linked list, in: Proceedings of the 7th International Conference on Adaptive and Natural Computing Algorithms (ICANNGA 2005), Coimbra, Portugal, 2005, pp. 542-546.
30. E. Pesch Learning in Automated Manufacturing: A Local Search Approach (Production and Logistics) 1994 Physica-Verlag HD
31. E. Pesch, and F. Glover TSP ejection chains Discrete Applied Mathematics 76 1997 165 181 (Pubitemid 127414709)
32. C. Rego Relaxed tours and path ejections for the traveling salesman problem European Journal of Operational Research 106 1998 522 538 (Pubitemid 128399666)
33. C. Rego, and F. Glover Local search and metaheuristics G. Gutin, A. Punnen, The Traveling Salesman Problem and Its Variations 2002 Kluwer Academic Publishers Dordrecht 309 368
34. C. Rego, and F. Glover Ejection chain and filter-and-fan methods in combinatorial optimization Annals of Operations Research 175 2010 77 105
35. G. Reinelt TSPLIB - a traveling salesman problem library ORSA Journal on Computing 3 1991 376 384