Skip to main content
SpringerLink
Log in

The Traveling Salesman Problem

  • Chapter
  • First Online:
Combinatorial Optimization

Part of the book series: Algorithms and Combinatorics ((AC,volume 21))

  • 9657 Accesses

Abstract

In Chapter 15 we introduced the TRAVELING SALESMAN PROBLEM (TSP) and showed that it is NP-hard (Theorem 15.43). The TSP is perhaps the best-studied NP-hard combinatorial optimization problem, and there are many techniques which have been applied. We start by discussing approximation algorithms in Sections 21.1 and 21.2. In practice, so-called local search algorithms (discussed in Section 21.3) find better solutions for large instances although they do not have a finite performance ratio.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

General Literature

  • Applegate , D.L., Bixby , R., Chvátal , V., and Cook , W.J. [2006]: The Traveling Salesman Problem: A Computational Study. Princeton University Press 2006

    Google Scholar 

  • Cook , W.J., Cunningham , W.H., Pulleyblank , W.R., and Schrijver , A. [1998]: Combinatorial Optimization. Wiley, New York 1998, Chapter 7

    Google Scholar 

  • Gutin , G., and Punnen , A.P. [2002]: The Traveling Salesman Problem and Its Variations. Kluwer, Dordrecht 2002

    Google Scholar 

  • Jünger , M., Reinelt , G., and Rinaldi , G. [1995]: The traveling salesman problem. In: Handbooks in Operations Research and Management Science; Volume 7; Network Models (M.O. Ball , T.L. Magnanti , C.L. Monma , G.L. Nemhauser , eds.), Elsevier, Amsterdam 1995

    Google Scholar 

  • Jungnickel , D. [2013]: Graphs, Networks and Algorithms. Fourth Edition. Springer, Berlin 2013, Chapter 15

    Google Scholar 

  • Lawler , E.L., Lenstra J.K., Rinnooy Kan , A.H.G., and Shmoys , D.B. [1985]: The Traveling Salesman Problem. Wiley, Chichester 1985

    Google Scholar 

  • Papadimitriou , C.H., and Steiglitz , K. [1982]: Combinatorial Optimization; Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Section 17.2, Chapters 18 and 19

    Google Scholar 

  • Reinelt , G. [1994]: The Traveling Salesman; Computational Solutions for TSP Applications. Springer, Berlin 1994

    Google Scholar 

  • Vygen , J. [2012]: New approximation algorithms for the TSP. OPTIMA 90 (2012), 1–12

    Google Scholar 

Cited References

  • Aarts , E., and Lenstra , J.K. [1997]: Local Search in Combinatorial Optimization. Wiley, Chichester 1997

    Google Scholar 

  • Applegate , D., Bixby , R., Chvátal , V., and Cook , W. [2003]: Implementing the Dantzig -Fulkerson -Johnson algorithm for large traveling salesman problems. Mathematical Programming B 97 (2003), 91–153

    Google Scholar 

  • Applegate , D., Cook , W., and Rohe , A. [2003]: Chained Lin -Kernighan for large traveling salesman problems. INFORMS Journal on Computing 15 (2003), 82–92

    Google Scholar 

  • Arora , S. [1998]: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM 45 (1998), 753–782

    Google Scholar 

  • Bellman , R. [1962]: Dynamic programming treatment of the travelling salesman problem. Journal of the ACM 9 (1962), 61–63

    Google Scholar 

  • de Berg , M., Buchin , K., Jansen , B.M.P., and Woeginger , G. [2016]: Fine-grained complexity analysis of two classic TSP variants. Proceedings of ICALP 2016, Article 5

    Google Scholar 

  • Berman , P., and Karpinski , M. [2006]: 8/7-approximation algorithm for (1,2)-TSP. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (2006), 641–648

    Google Scholar 

  • Boyd , S.C., and Cunningham , W.H. [1991]: Small traveling salesman polytopes. Mathematics of Operations Research 16 (1991), 259–271

    Google Scholar 

  • Burkard , R.E., Deĭneko , V.G., and Woeginger , G.J. [1998]: The travelling salesman and the PQ-tree. Mathematics of Operations Research 23 (1998), 613–623

    Google Scholar 

  • Carr , R. [1997]: Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time. Mathematics of Operations Research 22 (1997), 257–265

    Google Scholar 

  • Chalasani , P., Motwani , R., and Rao , A. [1996]: Algorithms for robot grasp and delivery. Proceedings of the 2nd International Workshop on Algorithmic Foundations of Robotics (1996), 347–362

    Google Scholar 

  • Chandra , B., Karloff , H., and Tovey , C. [1999]: New results on the old k-opt algorithm for the traveling salesman problem. SIAM Journal on Computing 28 (1999), 1998–2029

    Google Scholar 

  • Christofides , N. [1976]: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh 1976

    Google Scholar 

  • Chvátal , V. [1973]: Edmonds ’ polytopes and weakly hamiltonian graphs. Mathematical Programming 5 (1973), 29–40

    Google Scholar 

  • Crowder , H., and Padberg , M.W. [1980]: Solving large-scale symmetric travelling salesman problems to optimality. Management Science 26 (1980), 495–509

    Google Scholar 

  • Dantzig , G., Fulkerson , R., and Johnson , S. [1954]: Solution of a large-scale traveling-salesman problem. Operations Research 2 (1954), 393–410

    Google Scholar 

  • Englert , M., Röglin , H., and Vöcking , B. [2014]: Worst case and probabilistic analysis of the 2-opt algorithm for the TSP. Algorithmica 68 (2014), 190–264

    Google Scholar 

  • Fiorini , S., Massar , S., Pokutta , S., Tiwary , H.R., and de Wolf , R. [2015]: Exponential lower bounds for polytopes in combinatorial optimization. Journal of the ACM 62 (2015), Article 17

    Google Scholar 

  • Frank , A., Triesch , E., Korte , B., and Vygen , J. [1998]: On the bipartite travelling salesman problem. Report No. 98866, Research Institute for Discrete Mathematics, University of Bonn, 1998

    Google Scholar 

  • Frieze , A.M., Galbiati , G., and Maffioli , F. [1982]: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12 (1982), 23–39

    Google Scholar 

  • Garey , M.R., Graham , R.L., and Johnson , D.S. [1976]: Some NP-complete geometric problems. Proceedings of the 8th Annual ACM Symposium on the Theory of Computing (1976), 10–22

    Google Scholar 

  • Grötschel , M., and Padberg , M.W. [1979]: On the symmetric travelling salesman problem. Mathematical Programming 16 (1979), 265–302

    Google Scholar 

  • Grötschel , M., and Pulleyblank , W.R. [1986]: Clique tree inequalities and the symmetric travelling salesman problem. Mathematics of Operations Research 11 (1986), 537–569

    Google Scholar 

  • Held , M., and Karp , R.M. [1962]: A dynamic programming approach to sequencing problems. Journal of SIAM 10 (1962), 196–210

    Google Scholar 

  • Held M., and Karp , R.M. [1970]: The traveling-salesman problem and minimum spanning trees. Operations Research 18 (1970), 1138–1162

    Google Scholar 

  • Held , M., and Karp , R.M. [1971]: The traveling-salesman problem and minimum spanning trees; part II. Mathematical Programming 1 (1971), 6–25

    Google Scholar 

  • Helsgaun , K. [2009]: General k-opt submoves for the Lin -Kernighan TSP heuristic. Mathematical Programming Computation 1 (2009), 119–163

    Google Scholar 

  • Hoogeveen , J.A. [1991]: Analysis of Christofides ’ heuristic: some paths are more difficult than cycles. Operations Research Letters 10 (1991), 291–295

    Google Scholar 

  • Hougardy , S. [2014]: On the integrality ratio of the subtour LP for Euclidean TSP. Operations Research Letters 42 (2014), 495–499

    Google Scholar 

  • Hurkens , C.A.J., and Woeginger , G.J. [2004]: On the nearest neighbour rule for the traveling salesman problem. Operations Research Letters 32 (2004), 1–4

    Google Scholar 

  • Hwang , R.Z., Chang , R.C., and Lee , R.C.T. [1993]: The searching over separators strategy to solve some NP-hard problems in subexponential time. Algorithmica 9 (1993), 398–423

    Google Scholar 

  • Johnson , D.S., McGeoch , L.A., and Rothberg , E.E. [1996]: Asymptotic experimental analysis for the Held -Karp traveling salesman bound. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (1996), 341–350

    Google Scholar 

  • Johnson , D.S., Papadimitriou , C.H., and Yannakakis , M. [1988]: How easy is local search? Journal of Computer and System Sciences 37 (1988), 79–100

    Google Scholar 

  • Jünger , M., and Naddef , D. [2001]: Computational Combinatorial Optimization. Springer, Berlin 2001

    Google Scholar 

  • Kaibel , V., and Weltge , S. [2015]: Lower bounds on the sizes of integer programs without additional variables. Mathematical Programming B 154 (2015), 407–425

    Google Scholar 

  • Karp , R.M. [1977]: Probabilistic analysis of partitioning algorithms for the TSP in the plane. Mathematics of Operations Research 2 (1977), 209–224

    Google Scholar 

  • Karp , R.M., and Papadimitriou , C.H. [1982]: On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing 11 (1982), 620–632

    Google Scholar 

  • Karpinski , M., Lampis , M., and Schmied , R. [2013]: New inapproximability bounds for TSP. Algorithms and Computation; Proceedings of ISAAC 2013; LNCS 8283 (L. Cai , S.-W. Chen , T.-W. Lam , eds.), Springer, Berlin 2013, pp. 568–578

    Google Scholar 

  • Klein , P.N. [2008]: A linear-time approximation scheme for TSP in undirected planar graphs with edge-weights. SIAM Journal on Computing 37 (2008), 1926–1952

    Google Scholar 

  • Krentel , M.W. [1989]: Structure in locally optimal solutions. Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (1989), 216–221

    Google Scholar 

  • Land , A.H., and Doig , A.G. [1960]: An automatic method of solving discrete programming problems. Econometrica 28 (1960), 497–520

    Google Scholar 

  • Lee , J.R., Raghavendra , P., and Steurer , D. [2015]: Lower bounds on the size of semidefinite programming relaxations. Proceedings of the 47th Annual ACM Symposium on Theory of Computing (2015), 567–576

    Google Scholar 

  • Lin , S., and Kernighan , B.W. [1973]: An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21 (1973), 498–516

    Google Scholar 

  • Little , J.D.C., Murty , K.G., Sweeny , D.W., and Karel , C. [1963]: An algorithm for the traveling salesman problem. Operations Research 11 (1963), 972–989

    Google Scholar 

  • Michiels , W., Aarts , E., and Korst , J. [2007]: Theoretical Aspects of Local Search. Springer, Berlin 2007

    Google Scholar 

  • Miller , C.E., Tucker , A.W., and Zemlin , R.A. [1960]: Integer programming formulations of traveling salesman problems. Journal of the ACM 7 (1960), 326–329

    Google Scholar 

  • Mitchell , J. [1999]: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing 28 (1999), 1298–1309

    Google Scholar 

  • Papadimitriou , C.H. [1977]: The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science 4 (1977), 237–244

    Google Scholar 

  • Papadimitriou , C.H. [1978]: The adjacency relation on the travelling salesman polytope is NP-complete. Mathematical Programming 14 (1978), 312–324

    Google Scholar 

  • Papadimitriou , C.H. [1992]: The complexity of the Lin -Kernighan heuristic for the traveling salesman problem. SIAM Journal on Computing 21 (1992), 450–465

    Google Scholar 

  • Papadimitriou , C.H., and Steiglitz , K. [1977]: On the complexity of local search for the traveling salesman problem. SIAM Journal on Computing 6 (1), 1977, 76–83

    Google Scholar 

  • Papadimitriou , C.H., and Steiglitz , K. [1978]: Some examples of difficult traveling salesman problems. Operations Research 26 (1978), 434–443

    Google Scholar 

  • Papadimitriou , C.H., and Yannakakis , M. [1993]: The traveling salesman problem with distances one and two. Mathematics of Operations Research 18 (1993), 1–12

    Google Scholar 

  • Rao , S.B., and Smith , W.D. [1998]: Approximating geometric graphs via “spanners” and “banyans”. Proceedings of the 30th Annual ACM Symposium on Theory of Computing (1998), 540–550

    Google Scholar 

  • Rosenkrantz , D.J. Stearns , R.E., and Lewis , P.M. [1977]: An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing 6 (1977), 563–581

    Google Scholar 

  • Rothvoß , T. [2017]: The matching polytope has exponential extension complexity. Journal of the ACM 64 (2017), Article 41

    Google Scholar 

  • Sahni , S., and Gonzalez , T. [1976]: P-complete approximation problems. Journal of the ACM 23 (1976), 555–565

    Google Scholar 

  • Shmoys , D.B., and Williamson , D.P. [1990]: Analyzing the Held -Karp TSP bound: a monotonicity property with application. Information Processing Letters 35 (1990), 281–285

    Google Scholar 

  • Svensson , O., Tarnawski , J., and Végh , L. [2017]: A constant-factor approximation algorithm for the asymmetric traveling salesman problem. arXiv:1708.04215

    Google Scholar 

  • Traub , V., and Vygen , J. [2017]: Approaching \(\frac{3} {2}\) for the s-t-path TSP. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (2018), 1854–1864

    Google Scholar 

  • Triesch , E., Nolles , W., and Vygen , J. [1994]: Die Einsatzplanung von Zementmischern und ein Traveling Salesman Problem In: Operations Research; Reflexionen aus Theorie und Praxis (B. Werners , R. Gabriel , eds.), Springer, Berlin 1994 [in German]

    Google Scholar 

  • Woeginger , G.J. [2002]: Exact algorithms for NP-hard problems. OPTIMA 68 (2002), 2–8

    Google Scholar 

  • Wolsey , L.A. [1980]: Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study 13 (1980), 121–134

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany

    Bernhard Korte & Jens Vygen

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer-Verlag GmbH Germany

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Korte, B., Vygen, J. (2018). The Traveling Salesman Problem. In: Combinatorial Optimization. Algorithms and Combinatorics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-56039-6_21

Download citation

Publish with us

Policies and ethics

Search

Navigation