Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Traveling salesman problem

  • Karla L. Hoffman
  • Manfred Padberg
Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_1068

INTRODUCTION

The traveling salesman problem (TSP) is one which has commanded much attention of mathematicians and computer scientists specifically because it is so easy to describe and so difficult to solve. The problem can simply be stated as: if a traveling salesman wishes to visit exactly once each of a list of m cities (where the cost of traveling from city i tocity j is cij) and then return to the home city what is the least costly route the traveling salesman can take? A complete historical development of this and related problems can be found in Hoffman and Wolfe (1985).

The importance of the TSP is that it is representative of a larger class of problems known as combinatorial optimization problems. The TSP problem belongs in the class of combinatorial optimization problems known as NP-complete. Specifically, if one can find an efficient (i.e., polynomial-time) algorithm for the traveling salesman problem, then efficient algorithms could be found for all other problems in the...

This is a preview of subscription content, log in to check access.

References

  1. [1]
    Aarts, E.H.L., Korst, J.H.M., and Laarhoven, P.J.M. (1988). “A Quantitative Analysis of the Simulated Annealing Algorithm: A Case Study for the Traveling Salesman Problem,” Jl. Stats. Phys. 50, 189–206Google Scholar
  2. [2]
    Applegate, D., Bixby, R.E., Chvatal, V., and Cook, W. (1998). “atOn the solution of traveling salesman problems,” Documenta Mathematica–Extra Volume ICM 1998– III, 645–658. Google Scholar
  3. [3]
    Applegate, D., Bixby, R.E., Chvatal, V., and Cook, W. (1994). “Finding cuts in the TSP,” preliminary report distributed at The Mathematical Programming Symposium, Ann Arbor, Michigan, August 1994. Google Scholar
  4. [4]
    Balas, E. (1989). “The Prize Collecting Traveling Salesman Problem,” Networks 19, 621–636.Google Scholar
  5. [5]
    Bland, R.E. and Shallcross, D.F. (1987). “Large Traveling Salesman Problem Arising from Experiments in X-ray Crystallography: a Preliminary Report on Computation,” Technical Report No. 730, School of OR/ IE, Cornell University, Ithaca, New York.Google Scholar
  6. [6]
    Burkard, R.E., Deineko, V.G., van Dal, R., van der Veen, J.A.A., and Woeginger, G.J. (1998). “Well-Solvable Cases of the Traveling Salesman Problem: A Survey,” SIAM Review 40, 496–546.Google Scholar
  7. [7]
    Christof, T. and Reinelt, G. (1995). “Parallel cutting plane generation for the TSP in Parallel Programming and Applications (P. Fritzson, L. Finmo, eds.) IOS Press, 163–169. Google Scholar
  8. [8]
    Christofides, N. (1985). “Vehicle Routing,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, eds., John Wiley, 431–448. Google Scholar
  9. [9]
    Dantzig, G.B., Fulkerson, D.R., and Johnson, S.M. (1954). “Solution of a Large-scale Traveling Salesman Problem,” Operations Research 2, 393–410.Google Scholar
  10. [10]
    Fiechter, C.N. (1990). “A Parallel Tabu Search Algorithm for Large Scale Traveling Salesman Problems,” Working Paper 90/1, Department of Mathematics, Ecole Polytechnique Federale de Lausanne, Switzerland.Google Scholar
  11. [11]
    Fisher, M.L. (1988). “Lagrangian Optimization Algorithms for Vehicle Routing Problems,” Operational Research '87, G.K. Rand, ed., 635–649. Google Scholar
  12. [12]
    Golden, B.L., Levy, L., and Vohra, R. (1987). “The Orienteering Problem,” Naval Research Logistics 34, 307–318.Google Scholar
  13. [13]
    Golden, B.L. and Stewart, W.R. (1985). “Empirical Analysis of Heuristics,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, eds., John Wiley, 207–250. Google Scholar
  14. [14]
    Grötschel, M. and Holland, O. (1991). “Solution of Large Scale Symmetric Traveling Salesman Problems,” Mathematical Programming 51, 141–202.Google Scholar
  15. [15]
    Grötschel, M., Monma, C., and Stoer, M. (1991). “Polyhedral Approaches to Network Survivability,” DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 5, Amer. Math. Soc., 121–141.Google Scholar
  16. [16]
    Grötschel, M. and Padberg, M.W. (1985). “Polyhedral Theory,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, eds., John Wiley, 251–306. Google Scholar
  17. [17]
    Grötschel, M. and Padberg, M. (1993). “Ulysses 2000: In Search of Optimal Solutions to Hard Combinatorial Problems,” Technical Report, New York University Stern School of Business. Google Scholar
  18. [18]
    Hoffman, A.J. and Wolfe, P. (1985). “History” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, eds., John Wiley, 1–16. Google Scholar
  19. [19]
    Johnson, D.S. and Papadimitriou, C.H. (1985). “Performance Guarantees for Heuristics,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, eds., John Wiley, 145–180. Google Scholar
  20. [20]
    Johnson, D.S. (1990). “Local Optimization and the Traveling Salesman Problem,” Proc. 17th Colloquium on Automata, Languages and Programming, Springer Verlag, 446–461. Google Scholar
  21. [21]
    Jünger, M., Reinelt, G., and Rinaldi, G. (1994). “The Traveling Salesman Problem,” in M. Ball, T. Magnanti, C. Monma and G. Nemhauser, eds., Handbook on Operations Research and the Management Sciences, North Holland, 225–330. Google Scholar
  22. [22]
    Karp, R. and Steele, J.M. (1985). “Probabilistic Analysis of Heuristics,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, eds., John Wiley, 181–205. Google Scholar
  23. [23]
    Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B., eds. (1985). The Traveling Salesman Problem, John Wiley, Chichester, UK.Google Scholar
  24. [24]
    Miller, D. and Pekny, J. (1991). “Exact Solution of Large Asymmetric Traveling Salesman Problems,” Science 251, 754–761.Google Scholar
  25. [25]
    Padberg, M.W. and Grötschel, M. (1985). “Polyhedral Computations,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan and D.B. Shmoys, eds., John Wiley, 307–360. Google Scholar
  26. [26]
    Padberg, M.W. and Rinaldi, G. (1991). “A Branch and Cut Algorithm for the Resolution of Large-scale Symmetric Traveling Salesmen Problems,” SIAM Review 33, 60–100.Google Scholar
  27. [27]
    Reinelt, G. (1994). The Traveling Salesman: Computational Solutions for TSP Applications Springer-Verlag, Berlin.Google Scholar
  28. [28]
    Potvin, J.V. (1993). “The Traveling Salesman Problem: A Neural Network Perspective,” INFORMS Jl. Computing 5, 328–348.Google Scholar
  29. [29]
    Potvin, J.V. (1996). “Genetic Algorithms for the Traveling Salesman Problem,” Annals of Operations Research 63, 339–370.Google Scholar
  30. [30]
    Ratliff, H.D. and Rosenthal, A.S. (1981). “Order-Picking in a Rectangular Warehouse: A Solvable Case for the Traveling Salesman Problem,” PDRC Report Series No. 81-10. Georgia Institute of Technology, Atlanta, Georgia.Google Scholar
  31. [31]
    Reinelt, G. (1991). “TSPLIB–A traveling salesman library,” ORSA Jl. Computing 3, 376–384.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Karla L. Hoffman
    • 1
  • Manfred Padberg
    • 2
  1. 1.George Mason UniversityFairfaxUSA
  2. 2.New York UniversityNew YorkUSA