A Parallel Ring Method for Solving a Large-scale Traveling Salesman Problem

A parallel approach for solving a large-scale Traveling Salesman Problem (TSP) is presented. The problem is solved in four stages by using the following sequence of procedures: decomposing the input set of points into two or more clusters, solving the TSP for each of these clusters to generate partial solutions, merging the partial solutions to create a complete initial solution M0, and finally optimizing this solution. Lin-KernighanHelsgaun (LKH) algorithm is used to generate the partial solutions. The main goal of this research is to achieve speedup and good quality solutions by using parallel calculations. A clustering algorithm produces a set of small TSP problems that can be executed in parallel to generate partial solutions. Such solutions are merged to form a solution, M0, by applying the ―Ring‖ method. A few optimization algorithms were proposed to improve the quality of M0 to generate a final solution Mf. The loss of quality of the solution by using the developed approach is negligible when compared to the existing best-known solutions but there is a significant improvement in the runtime with the developed approach. The minimum number of processors that are required to achieve the maximum speedup is equal to the number of clusters that are created.

[1]  Rémy Dupas,et al.  A Decomposition Algorithm for Uniform Traveling Salesman Problem , 2009, IICAI.

[2]  D. Vickers,et al.  Human performance on visually presented Traveling Salesman problems , 2001, Psychological research.

[3]  Yll Haxhimusa,et al.  Traveling Salesman Problem: A Foveating Pyramid Model , 2006, J. Probl. Solving.

[4]  Guy E. Blelloch,et al.  Design and Implementation of a Practical Parallel Delaunay Algorithm , 1999, Algorithmica.

[5]  Fang Zhang,et al.  Distributed Evolutionary Algorithms to TSP with Ring Topology , 2009 .

[6]  Alan L. Yuille,et al.  Generalized Deformable Models, Statistical Physics, and Matching Problems , 1990, Neural Computation.

[7]  Peter Merz,et al.  A distributed Chained Lin-Kernighan algorithm for TSP problems , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[8]  K. Appel,et al.  Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[9]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[10]  H. A. Mallot,et al.  Planning paths to multiple targets: memory involvement and planning heuristics in spatial problem solving , 2009, Psychological research.

[11]  W. Wolfe,et al.  Hopfield-style neural networks and the TSP , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[12]  Dongmei Zhang,et al.  A Hierarchical Distributed Evolutionary Algorithm to TSP , 2010, ISICA.

[13]  T. Ormerod,et al.  Human performance on the traveling salesman problem , 1996, Perception & psychophysics.

[14]  Rémy Dupas,et al.  Decomposition Algorithms for Large-scale Clustered TSP , 2007, IICAI.

[15]  William J. Cook,et al.  Certification of an optimal TSP tour through 85, 900 cities , 2009, Oper. Res. Lett..

[16]  T. Ormerod,et al.  A model of human performance on the traveling salesperson problem , 2000, Memory & cognition.

[17]  J A Sethian,et al.  Fast marching methods for the continuous traveling salesman problem , 2007, Proceedings of the National Academy of Sciences.

[18]  Brian Everitt,et al.  Miscellaneous Clustering Methods , 2011 .

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

[20]  Yll Haxhimusa,et al.  2D and 3D Traveling Salesman Problem , 2011, J. Probl. Solving.

[21]  Bhanu Prasad,et al.  Decomposition and Scanning Optimization Algorithms for TSP , 2008, TMFCS.

[22]  A. Kryazhimskiy,et al.  The travelling-Salesman problem with moving objects , 1995 .

[23]  Jonatan Gómez,et al.  Grisland: a parallel genetic algorithm for finding near optimal solutions to the traveling salesman problem , 2009, GECCO '09.

[24]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[25]  S. S. Sengupta,et al.  The traveling salesman problem , 1961 .

[26]  Rémy Dupas,et al.  A Parallel Approach for Solving a Large-Scale Traveling Salesman Problem , 2011, IICAI.

[27]  Keld Helsgaun,et al.  An Effective Implementation of K-opt Moves for the Lin-Kernighan TSP Heuristic , 2007 .

[28]  Kamil Rocki,et al.  Large scale parallel iterated local search algorithm for solving traveling salesman problem , 2012, HiPC 2012.

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

[30]  Forschungsinstitut für Diskrete.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003 .

[31]  Yll Haxhimusa,et al.  Approximating TSP Solution by MST Based Graph Pyramid , 2007, GbRPR.

[32]  A. Joshi,et al.  The traveling salesman problem: A hierarchical model , 2000, Memory & cognition.

[33]  J. Monnot,et al.  The Traveling Salesman Problem and its Variations , 2014 .