Introduction to TSP – Infrastructure for the Traveling Salesperson Problem

The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving the TSP is difficult since it belongs to the class of NP-complete problems. The importance of the TSP arises besides from its theoretical appeal from the variety of its applications. Typical applications in operations research include vehicle routing, computer wiring, cutting wallpaper and job sequencing. The main application in statistics is combinatorial data analysis, e.g., reordering rows and columns of data matrices or identifying clusters. In this paper we introduce the R package TSP which provides a basic infrastructure for handling and solving the traveling salesperson problem. The package features S3 classes for specifying a TSP and its (possibly optimal) solution as well as several heuristics to find good solutions. In addition, it provides an interface to Concorde, one of the best exact TSP solvers currently available.

[1]  Michael Hahsler,et al.  TSPInfrastructure for the Traveling Salesperson Problem , 2007 .

[2]  C. Alpert,et al.  Splitting an Ordering into a Partition to Minimize Diameter , 1997 .

[3]  Abraham P. Punnen,et al.  The Traveling Salesman Problem: Applications, Formulations and Variations , 2007 .

[4]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[5]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[6]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

[7]  Sanghamitra Bandyopadhyay,et al.  Gene ordering in partitive clustering using microarray expressions , 2007, Journal of Biosciences.

[8]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[9]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[10]  Lawrence Hubert,et al.  Applications of combinatorial programming to data analysis: The traveling salesman and related problems , 1978 .

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

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

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

[14]  William J. Cook,et al.  TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.

[15]  ATSPDavid S. JohnsonAT.  Experimental Analysis of Heuristics for the Stsp , 2001 .

[16]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[17]  Michael Jünger,et al.  Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000] , 2000 .

[18]  R. Jonker,et al.  Transforming asymmetric into symmetric traveling salesman problems , 1983 .

[19]  J. Cunningham.  History , 2007, The Journal of Hellenic Studies.

[20]  Jan Karel Lenstra,et al.  Some Simple Applications of the Travelling Salesman Problem , 1975 .

[21]  F. Glover,et al.  Local Search and Metaheuristics , 2007 .

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

[23]  Weixiong Zhang,et al.  Rearrangement Clustering: Pitfalls, Remedies, and Applications , 2006, J. Mach. Learn. Res..

[24]  David S. Johnson,et al.  Compressing Large Boolean Matrices using Reordering Techniques , 2004, VLDB.

[25]  Jing Liu,et al.  A traveling salesman approach for predicting protein functions , 2006, Source Code for Biology and Medicine.