Some Simple Applications of the Travelling Salesman Problem

The travelling salesman problem arises in many different contexts. In this paper we report on typical applications in computer wiring, vehicle routing, clustering and job-shop scheduling. The formulation as a travelling salesman problem is essentially the simplest way to solve these problems. Most applications originated from real world problems and thus seem to be of particular interest. Illustrated examples are provided with each application.

[1]  J. Piehler,et al.  Ein Beitrag zum Reihenfolgeproblem , 1960, Unternehmensforschung.

[2]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3]  C. V. Ramamoorthy,et al.  A Scheduling Problem , 1973 .

[4]  S. K. Goyal.  A Note on the Paper: On the Flow-Shop Sequencing Problem with No Wait in Process , 1973 .

[5]  C. V. Ramamoorthy,et al.  Reply to Dr. Goyal's Comments , 1973 .

[6]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[7]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[8]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..

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

[10]  Michael Florian,et al.  An Implicit Enumeration Algorithm for the Machine Sequencing Problem , 1971 .

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

[12]  M. Syslo.  On some machine sequencing problems (II) , 1974 .

[13]  Maurice Hanan,et al.  A review of the placement and quadratic assignment problems , 1972 .

[14]  Jakob Krarup,et al.  Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem , 1974, Math. Program..

[15]  Jan Karel Lenstra,et al.  Technical Note - Clustering a Data Array and the Traveling-Salesman Problem , 1974, Oper. Res..

[16]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .

[17]  Mandell Bellmore,et al.  Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..

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

[19]  A.H.G. Rinnooy Kan,et al.  The machine scheduling problem , 1973 .

[20]  K. R. Baker,et al.  Minimizing Mean Flowtime in the Flow Shop with No Intermediate Queues , 1974 .

[21]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[22]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[23]  Nicos Christofides,et al.  Algorithms for Large-scale Travelling Salesman Problems , 1972 .

[24]  Paul J. Schweitzer,et al.  Problem Decomposition and Data Reorganization by a Clustering Technique , 1972, Oper. Res..

[25]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[26]  Efraim Turban,et al.  Letter to the Editor - Some Comments on the Traveling Salesman Problem , 1969, Oper. Res..