Implementation analysis of efficient heuristic algorithms for the traveling salesman problem

Computers and Operations Research

Volumn 33, Issue 4, 2006, Pages 1154-1172

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

^a INESC TEC and at International Research Institute for Economics and Management   (Portugal)

^b UNIVERSITY OF MISSISSIPPI   (United States)

^c UNIVERSITY OF COLORADO   (United States)

Author keywords

Data structures; Ejection chains; Local search; Traveling salesman

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; DATA STRUCTURES; HEURISTIC METHODS;

EJECTION CHAINS; LIN-KERNIGHAN (LK) PROCEDURE; LOCAL SEARCH; TRAVELING SALESMAN;

TRAVELING SALESMAN PROBLEM;

EID: 27144500170     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.06.014     Document Type: Article

References (19)

1. Johnson DS, McGeogh L, Glover F, Rego C. 8th DIMACS Implementation Challenge: The Traveling Salesman Problem. Technical report, AT&T Labs, 2000 〈 http://www.research.att.com/∼ dsj/chtsp/ 〉
2. S. Lin, and B. Kernighan An effective heuristic algorithm for the traveling salesman problem Operations Research 21 1973 498 516
3. Glover F. New ejection chain and alternating path methods for traveling salesman problems. Computer Science and Operations Research (1992) 449-509.
4. C. Rego Relaxed tours and path ejections for the traveling salesman problem European Journal of Operational Research 106 1998 522 538
5. Funke B, Grünert T, Irnich S. A note on single alternating cycle neighborhoods for the TSP, Lehr- und Forschungsgebiet Operations Research und Logistic Management, Rheinisch-Westfälische Hochschule (RWTH) Aachen, Germany, 2003.
6. M.L. Fredman, D.S. Johnson, L.A. McGeoch, and G. Ostheimer Data structures for traveling salesman Journal of Algorithms 18 1995 432 479
7. 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 Wiley New York 215 310
8. D. Applegate, W. Cook, and A. Rohe Chained Lin-Kernighan for large traveling salesman problems INFORMS Journal on Computing 15 2003 82 92
9. K. Helsgaun An effective implementation of the Lin-Kernighan traveling salesman heuristic European Journal of Operational Research 1 2000 106 130
10. M. Chrobak, T. Szymacha, and A. Krawczyk A data structure useful for finding Hamiltonian cycles Theoretical Computer Science 71 1990 419 424
11. Gamboa D, Rego C, Glover F. Data structures and ejection chains for solving large scale traveling salesman problems. European Journal of Operational Research, 2005;160(1):154-71.
12. G. Reinelt TSPLIB - a traveling salesman problem library ORSA Journal on Computing 3 1991 376 384
13. Chvatal V, Applegate D, Bixby R, Cook W. Concorde: a code for solving traveling salesman problems. 1999 〈 http://www.math.princeton.edu/tsp/ concorde.html 〉
14. H. Held, and R.M. Karp The traveling salesman problem and minimum spanning trees Operations Research 18 1970 1138 1162
15. H. Held, and R.M. Karp the traveling salesman problem and minimum spanning trees: Part II Mathematical Programming 1 1971 6 25
16. G. Reinelt Fast heuristics for large geometric traveling salesman problems ORSA Journal on Computing 4 1992 206 217
17. Neto D. Efficient cluster compensation for Lin-Kernighan heuristics, Department of Computer Science, University of Toronto, 1999.
18. Applegat D, Bixby R, Chvatal V, Cook W. Finding Tours in the TSP, Research Institute for Discrete Mathemetics, Universitat Bonn, 1999.
19. C. Walshaw A multilevel approach to the travelling salesman problem Operations Research 50 5 2002 862 877