Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization — Eureka, You Shrink! pp 64–77Cite as

Solving Real-World ATSP Instances by Branch-and-Cut

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2570))

Abstract

Recently, Fischetti, Lodi and Toth [15] surveyed exact methods for the Asymmetric Traveling Salesman Problem (ATSP) and computationally compared branch-and-bound and branch-and-cut codes. The results of this comparison proved that branch-and-cut is the most effective method to solve hard ATSP instances. In the present paper the branch-and-cut algorithms by Fischetti and Toth [17] and by Applegate, Bixby, Chvátal and Cook [2] are considered and tested on a set of 35 real-world instances including 16 new instances recently presented in [12].

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Applegate, R.E. Bixby, V. Chvátal, and W. Cook. Concorde-a code for solving traveling salesman problems. 12/15/1999 Release. http://www.keck.caam.rice.edu/concorde.html.

  2. D. Applegate, R.E. Bixby, V. Chvátal, and W. Cook. On the solution of traveling salesman problems. Documenta Mathematica, Extra Volume ICM III:645–656, 1998.

    Google Scholar 

  3. N. Ascheuer. Hamiltonian Path Problems in the On-line Optimization of Flexible Manufacturing Systems. PhD thesis, Technische Universität Berlin, Germany, 1995.

    MATH  Google Scholar 

  4. N. Ascheuer, M. Fischetti, and M. Grötschel. A polyhedral study of the asymmmetric travelling salesman problem with time windows. Networks, 36:69–79, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  5. N. Ascheuer, M. Fischetti, and M. Grötschel. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming, Ser. A, 90:475–506, 2001.

    Article  MATH  Google Scholar 

  6. N. Ascheuer, M. Jünger, and G. Reinelt. A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Computational Optimization and Applications, 17:61–84, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  7. E. Balas. The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. SIAM Journal on Discrete Mathematics, 2:425–451, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  8. E. Balas. Personal communication, 2000.

    Google Scholar 

  9. E. Balas and M. Fischetti. A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Mathematical Programming, Ser. A, 58:325–352, 1993.

    Article  MathSciNet  Google Scholar 

  10. E. Balas and M. Fischetti. Polyhedral theory for the asymmetric traveling salesman problem. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 117–168. Kluwer Academic Publishers, 2002.

    Google Scholar 

  11. G. Carpaneto, M. Dell’Amico, and P. Toth. Algorithm CDT: a subroutine for the exact solution of large-scale asymmetric traveling salesman problems. ACM Transactions on Mathematical Software, 21:410–415, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  12. J. Cirasella, D.S. Johnson, L.A. McGeoch, and W. Zhang. The asymmetric traveling salesman problem: Algorithms, instance generators, and tests. In A.L. Buchsbaum and J. Snoeyink, editors, Proceedings of ALENEX’01, volume 2153 of Lecture Notes in Computer Science, pages 32–59. Springer-Verlag, Heidelberg, 2001.

    Google Scholar 

  13. M. Fischetti. Facets of the asymmetric traveling salesman polytope. Mathematics of Operations Research, 16:42–56, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  14. M. Fischetti, A. Lodi, S. Martello, and P. Toth. A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Science, 47:833–850, 2001.

    Article  Google Scholar 

  15. M. Fischetti, A. Lodi, and P. Toth. Exact methods for the asymmetric traveling salesman problem. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 169–205. Kluwer Academic Publishers, 2002.

    Google Scholar 

  16. M. Fischetti and P. Toth. An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming, Ser. A, 53:173–197, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  17. M. Fischetti and P. Toth. A polyhedral approach to the asymmetric traveling salesman problem. Management Science, 43:1520–1536, 1997.

    MATH  Google Scholar 

  18. A.M.H. Gerards and A. Schrijver. Matrices with the Edmonds-Johnson property. Combinatorica, 6:365–379, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  19. M. Grötschel and M.W. Padberg. Polyhedral theory. In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and Shmoys D.B. eds., editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pages 251–305. Wiley, Chichester, 1985.

    Google Scholar 

  20. R. Jonker and T. Volgenant. Transforming asymmetric into symmetric traveling salesman problems. Operations Research Letters, 2:161–163, 1983.

    Article  MATH  Google Scholar 

  21. M. Jünger, G. Reinelt, and G. Rinaldi. The traveling salesman problem. In M. Ball, T.L. Magnanti, C.L. Monma, and G. Nemhauser, editors, Network Models, volume 7 of Handbooks in Operations Research and Management Science, pages 255–330. North Holland, Amsterdam, 1995.

    Google Scholar 

  22. R.M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, New York, 1972.

    Google Scholar 

  23. A. Löbel. Vehicle scheduling in public transit and Lagrangean pricing. Management Science, 44:1637–1649, 1998.

    MATH  Google Scholar 

  24. S. Martello. An enumerative algorithm for finding Hamiltonian circuits in a directed graph. ACM Transactions on Mathematical Software, 9:131–138, 1983.

    Article  MATH  Google Scholar 

  25. D. Naddef. Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 29–116. Kluwer Academic Publishers, 2002.

    Google Scholar 

  26. M.W. Padberg and G. Rinaldi. An efficient algorithm for the minimum capacity cut problem. Mathematical Programming, Ser. A, 47:19–36, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  27. M.W. Padberg and G. Rinaldi. Facet identification for the symmetric traveling salesman polytope. Mathematical Programming, Ser. A, 47:219–257, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  28. G. Reinelt. TSPLIB-a traveling salesman problem library. ORSA Journal on Computing, 3:376–384, 1991. http://www.crpc.rice.edu/softlib/tsplib/.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEI, University of Padova, Via Gradenigo 6/A, 35100, Padova, Italy

    Matteo Fischetti

  2. DEIS, University of Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Andrea Lodi & Paolo Toth

Authors
  1. Matteo Fischetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Lodi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paolo Toth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität zu Köln, Pohligstr. 1, 50969, Köln, Germany

    Michael Jünger

  2. Institut für Informatik, Universität Heidelberg, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany

    Gerhard Reinelt

  3. Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti”, CNR, viale Manzoni 30, 00185, Rome, Italy

    Giovanni Rinaldi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Fischetti, M., Lodi, A., Toth, P. (2003). Solving Real-World ATSP Instances by Branch-and-Cut. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds) Combinatorial Optimization — Eureka, You Shrink!. Lecture Notes in Computer Science, vol 2570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36478-1_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-36478-1_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00580-3

  • Online ISBN: 978-3-540-36478-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation