Heuristic Approaches to Solve Traveling Salesman Problem

This paper provides the survey of the heuristics solution approaches for the traveling salesman problem (TSP). TSP is easy to understand, however, it is very difficult to solve. Due to complexity involved with exact solution approaches it is hard to solve TSP within feasible time. That’s why different heuristics are generally applied to solve TSP. Heuristics to solve TSP are presented here with detailed algorithms. At the end, comparison among selected approaches shows the efficiency of approaches in terms of solution quality and time consumed to solve TSP.

[1]  Fatma A. Karkory,et al.  Implementation of Heuristics for Solving Travelling Salesman Problem Using Nearest Neighbour and Minimum Spanning Tree Algorithms , 2013 .

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

[3]  Fred W. Glover,et al.  Traveling salesman problem heuristics: Leading methods, implementations and latest advances , 2011, Eur. J. Oper. Res..

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

[5]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

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

[7]  David Applegate,et al.  Finding Cuts in the TSP (A preliminary report) , 1995 .

[8]  R. Bixby,et al.  On the Solution of Traveling Salesman Problems , 1998 .

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

[10]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[11]  Min Zhang,et al.  Comparison of TSP Algorithms Project for Models in Facilities Planning and Materials Handling December 1998 , 2001 .

[12]  Martin Grötschel,et al.  A cutting plane algorithm for minimum perfect 2-matchings , 1987, Computing.

[13]  Efraim Turban,et al.  Decision support and expert systems , 1993 .

[14]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[15]  Donald L. Miller,et al.  Exact Solution of Large Asymmetric Traveling Salesman Problems , 1991, Science.

[16]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[17]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[18]  H. D. Ratliff,et al.  Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem , 1983, Oper. Res..

[19]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

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