Solving the Bottleneck Traveling Salesman Problem Using the Lin-Kernighan-Helsgaun Algorithm

The Clustered Traveling Salesman Problem (CTSP) is an extension of the Traveling Salesman Problem (TSP) where the set of cities is partitioned into clusters, and the salesman has to visit the cities of each cluster consecutively. It is well known that any instance of CTSP can be transformed into a standard instance of the Traveling Salesman Problem (TSP), and therefore solved with a TSP solver. This paper evaluates the performance of the state-of-the art TSP solver Lin-Kernighan-Helsgaun (LKH) on transformed CTSP instances. Although LKH is used as a black box, without any modifications, the computational evaluation shows that all instances in a well-known library of benchmark instances, GTSPLIB, could be solved to optimality in a reasonable time. In addition, it was possible to solve a series of new very-large-scale instances with up to 17,180 clusters and 85,900 vertices. Optima for these instances are not known but it is conjectured that LKH has been able to find solutions of a very high quality. The program is free of charge for academic and non-commercial use and can be downloaded in source code.

[1]  Sine Zambach,et al.  Regulatory relations represented in logics and biomedical texts , 2012 .

[2]  Gilbert Laporte,et al.  Some applications of the clustered travelling salesman problem , 2000, J. Oper. Res. Soc..

[3]  Gourinath Banda,et al.  Modelling and Analysis of Real Time Systems with Logic Programming and Constraints , 2010 .

[4]  Rasmus Ole Rasmussen,et al.  Electronic Whiteboards in Emergency Medicine: Studies of Implementation Processes and User Interface Design Evaluations , 2011 .

[5]  Ming-Yang Kao,et al.  An Approximation Algorithm for a Bottleneck Traveling Salesman Problem , 2006, CIAC.

[6]  George L. Vairaktarakis,et al.  On Gilmore-Gomory's open question for the bottleneck TSP , 2003, Oper. Res. Lett..

[7]  Tine Lassen,et al.  Uncovering Prepositional Senses , 2010 .

[8]  Jens Ulrik Hansen.  A logic toolbox for modeling knowledge and information in multi-agent systems and social epistemology , 2011 .

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

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

[11]  James A. Chisman,et al.  The clustered traveling salesman problem , 1975, Comput. Oper. Res..

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

[13]  Matteo Fischetti,et al.  Exact Methods for the Asymmetric Traveling Salesman Problem , 2007 .

[14]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[15]  Abraham P. Punnen,et al.  The Bottleneck TSP , 2007 .

[16]  Ole Torp Lassen,et al.  Compositionality in probabilistic logic modelling for biological sequence analysis , 2011 .

[17]  Christian Theil Have,et al.  Efficient Probabilistic Logic Programming for Biological Sequence Analysis , 2011 .

[18]  Keld Helsgaun,et al.  General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..

[19]  Abraham P. Punnen,et al.  Experimental analysis of heuristics for the bottleneck traveling salesman problem , 2012, J. Heuristics.

[20]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

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

[22]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[23]  Gregory Gutin,et al.  A memetic algorithm for the generalized traveling salesman problem , 2008, Natural Computing.

[24]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .