Skip to main content
SpringerLink
Log in

On the symmetric travelling salesman problem: A computational study

  • Chapter
  • First Online:
Combinatorial Optimization

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 12))

Abstract

The symmetric travelling salesman problem has been formulated by Dantzig, Fulkerson and Johnson in 1954 as a linear programming problem in zero-one variables. We use this formulation and report the results of a computational study addressing itself to the problem of proving optimality of a particular tour. The empirical results based on a total of 74 problems of sizes ranging from 15-cities to 318-cities lend convincing support to the hypothesis that inequalities defining facets of the convex hull of tours are of substantial computational value in the solution of this difficult combinatorial problem.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Chvátal. “Edmonds polytopes and weakly Hamiltonian graphs”, Mathematical Programming 5 (1973) 29–40.

    Article  MATH  MathSciNet  Google Scholar 

  2. H. Crowder and J. Hattingh, “Partially normalized pivot selection in linear programming”, Mathematical Programming Study 4 (1975) 12–25.

    MathSciNet  Google Scholar 

  3. G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “Solution of a large-scale travelling-salesman problem”, Operations Research 2 (1954) 393–410.

    Article  MathSciNet  Google Scholar 

  4. G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “On a linear programming approach to the travelling salesman problem”, Operations Research 7 (1959) 59–66.

    Article  MathSciNet  Google Scholar 

  5. J. Edmonds, “Maximum matching and a polyhedron with 0, 1 vertices”, Journal of Research of the National Bureau of Standards, Section B 69 (1965) 125–130.

    MATH  MathSciNet  Google Scholar 

  6. M. Grötschel, “Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme”, Dissertation, Rheinische Friederich-Wilhelms-Universität (Bonn, 1977).

    MATH  Google Scholar 

  7. M. Grötschel and M.W. Padberg, “On the symmetric travelling salesman problem, Part I and Part II”, Mathematical Programming 16 (1979) 265–302.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Held and R.M. Karp, “The travelling salesman problem and minimum spanning trees, Part I”, Operations Research 18 (1970) 1138–1162; “Part II”, Mathematical Programming 1 (1971) 6–26.

    Article  MATH  MathSciNet  Google Scholar 

  9. R.L. Karg and G.L., Thompson, “A heuristic approach to solving travelling-salesman problems”, Management Science 10 (1964) 225–247.

    Article  Google Scholar 

  10. R.M. Karp, “Reducibility among combinatorial problems”, in: R.E. Miller and J.W. Thatcher, eds., Complexity of computer computations (Plenum Press, New York, 1972) pp. 85–103.

    Google Scholar 

  11. D. Knuth, “The travelling salesman problem”, illustrative example in: W. Sullivan, “Frontiers of science, from microcosm to macrocosm”, The New York Times (February 24, 1976) p. 18.

    Google Scholar 

  12. P. Krolak, W. Felts and G. Marble, “A man-machine approach towards solving the travelling salesman problem”, Communications of the Association for Computing Machinery 14 (1971) 327–334.

    MATH  Google Scholar 

  13. S. Lin and B.W. Kernighan, “An effective heuristic algorithm for the travelling-salesman problem”, Operations Research 21 (1973) 498–516.

    Article  MATH  MathSciNet  Google Scholar 

  14. K. Menger, “Botenproblem”, in: K. Menger, ed., Ergebnisse eines mathematischen Kolloquiums (Leipzig 1932) Heft 2, pp. 11–12.

    Google Scholar 

  15. M.W. Padberg, “On the facial structure of set packing polyhedra”, Mathematical Programming 5 (1973) 199–215.

    Article  MATH  MathSciNet  Google Scholar 

  16. Ch. Papadimitriou and K. Steiglitz, “Traps for the travelling salesman”, Paper presented at the ORSA Meeting, Miami Florida, November 1976.

    Google Scholar 

  17. Ch. Papadimitriou K. Steiglitz, “On the complexity of local search for the travelling salesman problem”, Tech. Rep. No. 189, Department of Electrical Engineering, Princeton University (Princeton, NJ, 1976).

    Google Scholar 

  18. K. Patton, “An algorithm for the blocks and cutnodes of a graph”, Communications of the Association for Computing Machinery 14 (1971) 468–475.

    MathSciNet  Google Scholar 

  19. M. Simmonard, Linear programming (Prentice-Hall, Englewood Cliffs, NJ 1962).

    Google Scholar 

  20. M.W. Padberg and M.R. Rao, “Odd minimum cut-sets and b-matchings” 68A Working paper, New York University (New York, July 1979).

    Google Scholar 

  21. H.P. Crowder and M.W. Padberg, “Solving large-scale symmetric travelling salesman problems to optimality”, T.J. Watson Research Center Report, IBM Research (Yorktown Heights, June 1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. New York University, New York, U.S.A.

    Manfred W. Padberg

  2. Operations Research Group, RCA Corporation, Princeton, NJ, U.S.A.

    Saman Hong

Authors
  1. Manfred W. Padberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saman Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. W. Padberg

Rights and permissions

Reprints and permissions

Copyright information

© 1980 The Mathematical Programming Society

About this chapter

Cite this chapter

Padberg, M.W., Hong, S. (1980). On the symmetric travelling salesman problem: A computational study. In: Padberg, M.W. (eds) Combinatorial Optimization. Mathematical Programming Studies, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120888

Download citation

  • DOI: https://doi.org/10.1007/BFb0120888

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00801-6

  • Online ISBN: 978-3-642-00802-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation