A concise guide to the Traveling Salesman Problem

Journal of the Operational Research Society

Volumn 61, Issue 1, 2010, Pages 35-40

  Laporte, G ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

Exact algorithms; Heuristics; Software; Traveling Salesman Problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER SOFTWARE; HEURISTIC ALGORITHMS;

EXACT ALGORITHMS; HEURISTICS;

TRAVELING SALESMAN PROBLEM;

EID: 71749099424     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.76     Document Type: Article

References (54)

1. Applegate DL, Bixby RE, Chv́atal V and Cook WJ (2003). Implementing the Dantzig-Fulkerson-Johnson algorithm for large scale traveling salesman problems. Math Program Ser B 97: 91-153.
2. Applegate DL, Bixby RE, Chv́atal V and Cook WJ (2006). The Traveling Salesman Problem: A Computational Study. Pinceton Series in Applied Mathematics: Princeton.
3. Applegate DL, Bixby RE, Chv́atal V, Cook WJ, Espinoza DG, Goycoolea M and Helsgaun K (2009). Certification of an optimal TSP tour through 85900 cities. Opns Res Lett 37: 11-15.
4. Babin G, Deneault S and Laporte G (2007). Improvements to the Or-opt heuristic for the symmetric travelling salesman problem. J Opl Res Soc 58: 402-407.
5. Balas E and Toth P (1985). Branch and bound methods. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (eds). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley: Chichester, pp 361-401.
6. Burkard R, Dell'Amico M and Martello S (2009). Assignment Problems. SIAM: Philadelphia.
7. Carpaneto G and Toth P (1980). Some new branching and bounding criteria for the asymmetric traveling salesman problem. Mngt Sci 26: 736-743.
8. Carpaneto G and Toth P (1987). Primal-dual algorithms for the assignment problem. Discrete Appl Math 18: 137-153.
9. Carpaneto G, Dell'Amico M and Toth P (1995). Exact solution of large-scale, asymmetric travelling salesman problems. ACM Trans Math Software 21: 394-409.
10. Chv́atal V (1973). Edmonds polytopes and weakly Hamiltonian graphs. Math Program 5: 29-40.
11. Cornúejols G, Fonlupt J and Naddef D (1985). The travelling salesman problem on a graph and some related integer polyhedra. Math Program 33: 1-27.
12. Croes GA (1958). A method for solving large scale symmetric traveling salesman problems. Opns Res 6: 791-812.
13. Crowder H and Padberg MW (1980). Solving large-scale symmetric traveling salesman problems to optimality. Mngt Sci 26: 495-509.
14. Daganzo CF (1984). The length of tours in zones of different shapes. Transport Res B 18: 135-145.
15. Dantzig GB, Fulkerson DR and Johnson SM (1954). Solution of a large-scale traveling-salesman problem. Opns Res 2: 393-410.
16. Dell'Amico M and Toth P (2000). Algorithms and codes for dense assignment problems: The state of the art. Discrete Appl Math 100: 17-48.
17. Eastman WL (1958). Linear programming with pattern constraints. PhD thesis, Department of Economics, Harvard University, Cambridge, MA.
18. Edmonds J (1965). Maximum matching and a polyhedron with 0, 1-vertices. J Res Natl Bur Stan 69B: 125-130.
19. Fischetti M and Toth P (1992). An additive bounding procedure for the asymmetric traveling salesman problem. Math Program Ser A 53: 173-197.
20. Fischetti M, Lodi A and Toth P (2002). Exact methods for the asymmetric traveling salesman problem. In: Gutin G and Punnen AP (eds). The Traveling Salesman Problem and Its Variations. Kluwer: Boston. pp 169-205.
21. Flood MM (1956). The traveling-salesman problem. Opns Res 4: 61-75.
22. Gaboune B, Laporte G and Soumis F (1994). Optimal strip sequencing strategies for flexible manufacturing operations in two and three dimensions. Int J Flex Manuf Sys 6: 123-135.
23. Golden BL and Stewart WR (1985). Empirical analysis of heuristics. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (eds). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley: Chichester, pp 207-249.
24. Gomory RE (1963). An algorithm for integer solutions to linear programs. In: Graves RL and Wolfe P (eds). Recent Advances in Mathematical Programming. McGraw-Hill: New York, pp 269-302.
25. Grotschel M and Holland O (1991). Solution of large-scale symmetric traveling salesman problems. Math Program 51: 141-202.
26. Grotschel M and Padberg MW (1985). Polyhedral theory. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (eds). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley: Chichester, pp 251-305.
27. Grotschel M and Pulleyblank WR (1986). Clique tree inequalities and the symmetric Travelling Salesman Problem. Math Opns Res 11: 537-569.
28. Gutin G and Punnen AP (eds) (2002). The Traveling Salesman Problem and Its Variations. Kluwer: Boston.
29. Held M and Karp RM (1971). The traveling-salesman problem and minimum spanning trees: Part II. Math Program 1: 6-25.
30. Helsgaun K (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur J Opl Res 126: 106-130.
31. Johnson DS, Gutin G, McGeoch LA, Yeo A, Zhang W and Zverovitch A (2002). Experimental analysis of heuristics for the ATSP. In: Gutin G and Punnen AP (eds). The Traveling Salesman Problem and Its Variations. Kluwer: Boston, pp 445-487.
32. Johnson DS and McGeoch LA (1997). The traveling salesman problem: A case study. In: Aarts E and Lenstra JK (eds). Local Search in Combinatorial Optimization. Wiley: Chichester, pp 215-310.
33. Johnson DS and McGeoch LA (2002). Experimental analysis of heuristics for the STPS. In: Gutin G and Punnen AP (eds). The Traveling Salesman Problem and Its Variations. Kluwer: Boston. pp 369-443.
34. Junger M, Reinelt G and Rinaldi G (1995). The traveling salesman problem. In: Ball MO, Magnanti TL, Monma CL and Nemhauser GL (eds). Network Models Handbooks in Operations Research and Management Science, vol.7. North-Holland: Amsterdam, pp 225-330.
35. Karp RM (1979). A patching algorithm for the nonsymmetric traveling-salesman problem. SIAM J Comput 8: 561-573.
36. Karp RM and Steele JM (1985). Probabilistic analysis of heuristics. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (eds). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley: Chichester, pp 181-205.
37. Land AH (1979). The solution of some 100-city traveling salesman problems. Technical report, London School of Economics, London.
38. Land AH and Doig AG (1960). An automatic method of solving discrete programming problems. Econometrica 28: 497-520.
39. Laporte G (1992). The traveling salesman problem: An overview of exact and approximate algorithms. Eur J Opl Res 59: 231-247.
40. Lin S (1965). Computer solutions of the traveling salesman problem. Bell Syst Tech J 44: 2245-2269.
41. Lin S and Kernighan BW (1973). An effective heuristic algorithm for the traveling salesman problem. Opns Res 21: 498-516.
42. Little JDC, Murty KG, Sweeney DW and Karel C (1963). An algorithm for the traveling salesman problem. Opns Res 11: 972-989.
43. Martin GT (1966). Solving the traveling salesman problem by integer programming. Working Paper, CEIR, New York.
44. Miliotis P (1976). Integer programming approaches to the travelling salesman problem. Math Program 10: 376-378.
45. Miliotis P (1978). Using cutting planes to solve the symmetric travelling salesman problem. Math Program 15: 177-188.
46. Naddef D (2002). Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In: Gutin G and Punnen AP (eds). The Traveling Salesman Problem and Its Variations. Kluwer: Boston, pp 29-116.
47. Oncan T, Altnel IK and Laporte G (2009). A comparative analysis of several asymmetric traveling salesman problem formulations. Comput Opns Res 36: 637-654.
48. Or I (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Il.
49. Orman AJ and Williams HP (2006). A survey of different integer programming formulations of the travelling salesman problem. In: Kontoghiorghes E and Gatu C (eds). Optimisation, Econometric and Financial Analysis Advances in Computational Management Science. Springer: Berlin, Heidelberg, pp 91-104.
50. Padberg MW and Grotschel M (1985). Polyhedral computations. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (eds). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley: Chichester, pp 307-360.
51. Padberg MW and Hong S (1980). On the symmetric travelling salesman problem: A computational study. Math Program Study 12: 78-107.
52. Padberg MW and Rinaldi G (1987). Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Opns Res Lett 6: 1-7.
53. Padberg MW and Rinaldi G (1991). A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev 33: 60-100.
54. Toth P and Vigo D (eds) (2002). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.