Introduction
The traveling salesman problem (TSP) has commanded much attention from 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 to city j is c ij ) 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), Applegate et al. (2006), and Cook (2011).
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 such 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...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aarts, E. H. L., Korst, J. H. M., & Laarhoven, P. J. M. (1988). A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem. Journal of Statistical Physics, 50, 189–206.
Applegate, D., Bixby, R. E., Chvátal, V., & Cook, W. (1995). Finding cuts in the TSP(A preliminary report) DIMACS (Technical Report 95–05). New Brunswick, USA: Rutgers University.
Applegate, D., Bixby, R. E., Chvátal, V., & Cook, W. (2006). The traveling salesman problem: A computational study. Princeton: Princeton University Press.
Arora, S. (2002). Approximation algorithms for geometric TSP. In G. Gutin & A. P. Punnen (Eds.), The traveling salesman problem and its variations (pp. 207–222). Dordrecht, The Netherlands: Kluwer.
Balas, E. (2002). The prize collecting traveling salesman problem and its applications. In G. Gutin & A. P. Punnen (Eds.), The traveling salesman problem and its variations (pp. 663–696). Dordrecht, The Netherlands: Kluwer.
Balas, E., & Fischetti, M. (2002). Polyhedral theory for the asymmetric traveling salesman problem. In G. Gutin & A. P. Punnen (Eds.), The traveling salesman problem and its variations (pp. 117–168). Dordrecht, The Netherlands: Kluwer.
Ben-Dor, A., & Chor, B. (1997). On constructing radiation hybrid maps. Journal of Computational Biology, 4, 517–533.
Ben-Dor, A., Chor, B., & Pelleg, D. (2000). RHO-radiation hybrid ordering. Genome Research, 10, 365–378.
Bland, R. E., & Shallcross, D. F. (1987). Large traveling salesman problem arising from experiments in X-ray crystallography: A preliminary report on computation (Technical Report No. 730). Ithaca, New York: School of OR/ IE, Cornell University.
Burkard, R. E., Deineko, V. G., van Dal, R., van der Veen, J. A. A., & Woeginger, G. J. (1998). Well-solvable cases of the traveling salesman problem: A survey. SIAM Review, 40, 496–546.
Cook, W. (2011). In pursuit of the salesman: Mathematics at the limits of computation. Princeton: Princeton University Press.
Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (1954). Solution of a large-scale traveling salesman problem. Operations Research, 2, 393–410.
Fiechter, C. N. (1990). A parallel tabu search algorithm for large scale traveling salesman problems (Working Paper 90/1). Switzerland: Department of Mathematics, Ecole Polytechnique Federale de Lausanne.
Fisher, M. L. (1988). Lagrangian optimization algorithms for vehicle routing problems. In G. K. Rand (Ed.), Operational research ’87, pp. 635–649.
Golden, B. L., Levy, L., & Vohra, R. (1987). The orienteering problem. Naval Research Logistics, 34, 307–318.
Golden, B. L., & Stewart, W. R. (1985). Empirical analysis of heuristics. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinooy Kan, & D. B. Shmoys (Eds.), The traveling salesman problem (pp. 207–250). Chichester: John Wiley.
Grötschel, M., & Holland, O. (1991). Solution of large scale symmetric traveling salesman problems. Mathematical Programming, 51, 141–202.
Grötschel, M., & Padberg, M. W. (1985). Polyhedral theory. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinooy Kan, & D. B. Shmoys (Eds.), The traveling salesman problem (pp. 251–306). Chichester: John Wiley.
Gutin, G., & Punnen, A. P. (Eds.). (2002). The traveling salesman problem and its variations. Dordrecht, The Netherlands: Kluwer.
Helsgun, K. (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126, 106–130.
Hoffman, A. J., & Wolfe, P. (1985). History. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinooy Kan, & D. B. Shmoys (Eds.), The traveling salesman problem (pp. 1–16). Chichester: John Wiley.
Johnson, D. S., & McGeoch, L. A. (2002). Experimental analysis of heuristics for the STSP. In G. Gutin & A. P. Punnen (Eds.), The traveling salesman problem and its variations (pp. 369–444). Dordrecht: Kluwer.
Johnson, D. S., & Papadimitriou, C. H. (1985). Performance guarantees for heuristics. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinooy Kan, & D. B. Shmoys (Eds.), The traveling salesman problem (pp. 145–180). Chichester: John Wiley.
Johnson, D. S., Gutin, G., McGeoch, L. A., Yeo, A., Zhang, W., & Zverovitch, A. (2002). Experimental analysis of heuristics for the ATSP. In G. Gutin & A. P. Punnen (Eds.), The traveling salesman problem and its variations (pp. 485–488). Dordrecht, The Netherlands: Kluwer.
Jünger, M., Reinelt, G., & Rinaldi, G. (1994). The traveling salesman problem. In M. Ball, T. Magnanti, C. Monma, & G. Nemhauser (Eds.), Handbook on operations research and the management sciences (pp. 225–330). Amsterdam: North Holland.
Jünger, M., Reinelt, G., & Rinaldi, G. (1997). The traveling salesman problem. In M. Dell'Amico, F. Maffioli, & S. Martello (Eds.), Annotated bibliographies in combinatorial optimization (pp. 199–221). New York: Wiley.
Karp, R., & Steele, J. M. (1985). Probabilistic analysis of heuristics. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, & D. B. Shmoys (Eds.), The traveling salesman problem (pp. 181–205). Chichester: John Wiley.
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (Eds.). (1985). The traveling salesman problem. Chichester, UK: John Wiley.
Miller, D., & Pekny, J. (1991). Exact solution of large asymmetric traveling salesman problems. Science, 251, 754–761.
Naddef, D. (2002). Polyhedral theory and branch-and-cut algorithm for the symmetric TSP. In G. Gutin & A. P. Punnen (Eds.), The traveling salesman problem and its variations (pp. 21–116). Dordrecht, The Netherlands: Kluwer.
Nagata, Y. (2006). New EAX crossover for large TSP instances. Lecture Notes in Computer Science, 4193, 372–381.
Padberg, M. W., & Grötschel, M. (1985). Polyhedral computations. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinooy Kan, & D. B. Shmoys (Eds.), The traveling salesman problem (pp. 307–360). Chichester: John Wiley.
Padberg, M. W., & Rinaldi, G. (1991). A branch and cut algorithm for the resolution of large-scale symmetric traveling salesmen problems. SIAM Review, 33, 60–100.
Potvin, J. V. (1993). The traveling salesman problem: A neural network perspective. INFORMS Journal on Computing, 5, 328–348.
Potvin, J. V. (1996). Genetic algorithms for the traveling salesman problem. Annals of Operations Research, 63, 339–370.
Ratliff, H. D., & Rosenthal, A. S. (1981). Order-picking in a rectangular warehouse: A solvable case for the traveling salesman problem (PDRC Report Series No. 81–10). Atlanta: Georgia Institute of Technology.
Reinelt, G. (1991). TSPLIB–A traveling salesman library. ORSA Journal on Computing, 3, 376–384.
Reinelt, G. (1994). The traveling salesman: Computational solutions for TSP applications. Berlin: Springer-Verlag.
Toth, P., & Vigo, D. (2001). The vehicle routing problem. Philadelphia: SIAM.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this entry
Cite this entry
Hoffman, K.L., Padberg, M., Rinaldi, G. (2013). Traveling Salesman Problem. In: Gass, S.I., Fu, M.C. (eds) Encyclopedia of Operations Research and Management Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1153-7_1068
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1153-7_1068
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-1137-7
Online ISBN: 978-1-4419-1153-7
eBook Packages: Business and Economics