Solution of large-scale symmetric travelling salesman problems

In this paper we report on a cutting plane procedure with which we solved symmetric travelling salesman problems of up to 1000 cities to optimality. Our implementation is based on a fast LP-solver (IBM's MPSX) and makes effective use of polyhedral results on the symmetric travelling salesman polytope. We describe the important ingredients of our code and give an extensive documentation of its computational performance.

[1]  J. P. Secrétan,et al.  Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .

[2]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[3]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[4]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[5]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .

[6]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[7]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[8]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[9]  Patrick D. Krolak,et al.  A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.

[10]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[11]  T. H. C. Smith,et al.  A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation , 1977 .

[12]  Martin Grötschel,et al.  Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme , 1977 .

[13]  Martin Grötschel,et al.  On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..

[14]  Martin Grötschel,et al.  On the symmetric travelling salesman problem II: Lifting theorems and facets , 1979, Math. Program..

[15]  M. Padberg,et al.  On the symmetric travelling salesman problem II , 1979 .

[16]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[17]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[18]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[19]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[20]  F. Glover,et al.  A Primal Simplex Variant for the Maximum Flow Problem , 1984 .

[21]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[22]  M. Grötschel,et al.  Solving matching problems with linear programming , 1985, Math. Program..

[23]  William R. Pulleyblank,et al.  Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..

[24]  R. Bland,et al.  Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation , 1989 .

[25]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[26]  Giovanni Rinaldi,et al.  An efficient algorithm for the minimum capacity cut problem , 1990, Math. Program..

[27]  Giovanni Rinaldi,et al.  Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..