Skip to main content
SpringerLink
Log in

Traveling Salesman Problem

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords and Phrases

Introduction

  Basic Definitions and Notation

  Computational Complexity

Formulations

Applications

Methods

  Exact Algorithms

See also

References

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.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

  1. Arora S (1998) Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. J ACM 45:753–782

    Article  MATH  MathSciNet  Google Scholar 

  2. Arora S (2002) Approximation algorithms for geometric TSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 207–221

    Google Scholar 

  3. Bang-Jensen J, Gutin G (2000) Digraphs: Theory, Algorithms and Applications. Springer, London

    Google Scholar 

  4. Blaeser M, Manthey B, Sgall J (2006) An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality. J Discret Algorithms 4:623–632

    Article  MATH  Google Scholar 

  5. Burkard RE, Deineko VG, van Dal R, van der Veen JAA, Woeginger GJ (1998) Well-solvable special cases of the traveling salesman problem: a survey. SIAM Rev 40:496–546

    Article  MATH  MathSciNet  Google Scholar 

  6. Baum EB (1986) Iterated descent: A better algorithm for local search in combinatorial optimization problems. unpublished manuscript

    Google Scholar 

  7. Chekuri C, Goldberg A, Karger D, Levine M, Stein C (1997) Experimental Study of Minimum Cut Algorithms. In: Proc. 8th ACM-SIAM Symp. Discrete Algorithms (SODA'97). ACM/SIAM, pp 324–333

    Google Scholar 

  8. Christofides N (1976) Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report CS-93–13, Carnegie Mellon University

    Google Scholar 

  9. Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581

    Google Scholar 

  10. Dantzig GB, Fulkerson DR, Johnson SM (1954) Solution of large scale traveling salesman problem. Oper Res 2:393–410

    MathSciNet  Google Scholar 

  11. Fischetti M, Lodi A, Toth P (2002) Exact Methods for the Asymmetric Traveling Salesman Problem. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 169–205

    Google Scholar 

  12. Garey MR, Graham RL, Johnson DS (1976) Some NP-complete geometric problems. In: Proc. 8th ACM Symp. Theory Comput. ACM, pp 10–22

    Google Scholar 

  13. Glover F, Gutin G, Yeo A, Zverovich A (2001) Construction heuristics for the asymmetric TSP. Eur J Oper Res 129:555–568

    Article  MATH  MathSciNet  Google Scholar 

  14. Golden BL, Stewart WR (1985) Empirical Analysis of Heuristics. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York, pp 207–249

    Google Scholar 

  15. Gutin G, Jakubowicz H, Ronen S, Zverovitch A (2005) Seismic vessel problem. Commun DQM 8:13–20

    Google Scholar 

  16. Gutin G, Koller A, Yeo A (2006) Note on Upper Bounds for TSP Domination Number. Algorithmic Oper Res 1:52–54

    MATH  MathSciNet  Google Scholar 

  17. Gutin G, Yeo A, Zverovich A (2002) Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discrete Appl Math 117:81–86

    Article  MATH  MathSciNet  Google Scholar 

  18. Hassin R, Khuller S (2001) z‑Approximations. J Algorithms 41:429–442

    Article  MATH  MathSciNet  Google Scholar 

  19. Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 10:196–210

    Article  MATH  MathSciNet  Google Scholar 

  20. Hoffman AJ, Wolfe P (1985) History. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York, pp 1–16

    Google Scholar 

  21. Johnson DS, Gutin G, McGeoch LA, Yeo A, Zhang W, Zverovitch A (2002) Experimental Analysis of Heuristics for ATSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht

    Google Scholar 

  22. Johnson DS, McGeoch LA (2002) Experimental Analysis of Heuristics for STSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 369–443

    Google Scholar 

  23. Johnson DS, Papadimitriou CH (1985) Performance guarantees for heuristics. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York, pp 145–180

    Google Scholar 

  24. Jonker R, Volgenant T (1983) Transforming asymmetric into symmetric traveling salesman problems. Oper Res Lett 2:161–163

    Article  MATH  Google Scholar 

  25. Jünger M, Rinaldi G, Thienel S (2000) Practical Performance of efficient minimum Cut Algorithms. Algorithmica 26:172–195

    Article  MATH  MathSciNet  Google Scholar 

  26. Kabadi SN (2002) Polynomially solvable cases of the TSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 489–583

    Google Scholar 

  27. Kaplan H, Lewenstein M, Shafrir N, Sviridenko M (2005) Approximation Algorithms for the Asymmetric TSP by Decomposing Regular Multigraphs. J ACM 52:602–626

    Article  MathSciNet  Google Scholar 

  28. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum Press, New York, pp 85–103

    Google Scholar 

  29. Karp RM, Steele JM (1985) Probabilistic analysis of heuristics. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York, pp 181–205

    Google Scholar 

  30. Lodi A, Punnen AP (2002) TSP Software. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 737–749

    Google Scholar 

  31. Menger K (1932) Das Botenproblem. Ergebnisse eines Mathematischen Kolloquiums 2:11–12

    Google Scholar 

  32. Miller CE, Tucker AW, Zemlin RA (1960) Integer Programming formulations and traveling salesman problems. J Assoc Comput Mach 7:326–329

    MATH  MathSciNet  Google Scholar 

  33. Mitchell JCB (1999) Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial time approximation scheme for geometric TSP, k-MST, and related problem. SIAM J Comput 28:1298–1309

    Article  MATH  MathSciNet  Google Scholar 

  34. Nagata Y (2006) New EAX crossover for large TSP instances. Lecture Notes Comp Sci 4193:372–381

    Article  Google Scholar 

  35. Nagata Y, Kobayashi S (1997) Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem. In: Proc. of the 7th Int. Conference on Genetic Algorithms, pp 450–457

    Google Scholar 

  36. Naddef D (2002) Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 29–116

    Google Scholar 

  37. Padberg MW, Sung TY (1991) An analytical comparison of different formulations of the traveling salesman problem. Math Program Ser A 52:315–357

    Article  MATH  MathSciNet  Google Scholar 

  38. Papadimitriou CH (1977) The Euclidean traveling salesman problem is NP-complete. Theoret Comput Sci 4:237–244

    Article  MATH  MathSciNet  Google Scholar 

  39. Papadimitriou CH, Steiglitz K (1982) Combinatorial Optimization. Prentice-Hall, New Jersey

    MATH  Google Scholar 

  40. Punnen AP (2002) The Traveling Salesman Problem: Aplications, Formulations and Variations. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 1–28

    Google Scholar 

  41. Punnen AP, Margot F, Kabadi S (2003) TSP heuristics: domination analysis and complexity. Algorithmica 35:111–127

    Article  MATH  MathSciNet  Google Scholar 

  42. Rao S, Smith W (1998) Approximating geometric graphs via “spanners” and “banyans”. Proc. 30th Ann. ACM Symp. Theory Comput. ACM, pp 540–550

    Google Scholar 

  43. Rego C, Glover F (2002) Local Search and Metaheuristics. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 309–368

    Google Scholar 

  44. Rego C, Glover F, Gamboa D, Osterman C: A Doubly-Rooted Stem-and-Cycle Ejection Chain Algorithm for Asymmetric Traveling Salesman Problems. submitted

    Google Scholar 

  45. Trevisan L (1997) When Hamming meets Euclid: the approximability of geometric TSP and MST. In: Proc. 29th ACM Symp. Theory Comput. ACM, pp 21–39

    Google Scholar 

  46. Zemel E (1981) Measuring the quality of approximate solutions to zero-one programming problems. Math Oper Res 6:319–332

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Royal Holloway, University of London, Egham, UK

    Gregory Gutin

Authors
  1. Gregory Gutin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Gutin, G. (2008). Traveling Salesman Problem . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_687

Download citation

Publish with us

Policies and ethics

Search

Navigation