A New Heuristic Algorithm for the Classical Symmetric Traveling Salesman Problem

paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem (TSP). The idea of the algorithm is to cut a TSP tour into overlapped blocks and then each block is improved separately. It is conjectured that the chance of improving a good solution by moving a node to a position far away from its original one is small. By doing intensive search in each block, it is possible to further improve a TSP tour that cannot be improved by other local search methods. To test the performance of the proposed algorithm, computational experiments are carried out based on benchmark problem instances. The computational results show that algorithm proposed in this paper is efficient for solving the TSPs.

[1]  F. Glover,et al.  The application of tabu search to the symmetric traveling salesman problem , 1989 .

[2]  H. L. Ong,et al.  A generalized crossing local search method for solving vehicle routing problems , 2007, J. Oper. Res. Soc..

[3]  Cheng-Fa Tsai,et al.  A new and efficient ant-based heuristic method for solving the traveling salesman problem , 2003, Expert Syst. J. Knowl. Eng..

[4]  E. Bonomi,et al.  The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .

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

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

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

[8]  Darrell Whitley,et al.  Scheduling problems and traveling salesman: the genetic edge recombination , 1989 .

[9]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[10]  Egon Balas,et al.  A restricted Lagrangean approach to the traveling salesman problem , 1981, Math. Program..

[11]  Sartaj Sahni,et al.  Simulated Annealing and Combinatorial Optimization , 1986, 23rd ACM/IEEE Design Automation Conference.

[12]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[13]  Claude-Nicolas Fiechter,et al.  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..

[14]  Jean-Yves Potvin,et al.  Genetic Algorithms for the Traveling Salesman Problem , 2005 .

[15]  Takao Enkawa,et al.  A self-organising model for the travelling salesman problem , 1997 .

[16]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[17]  P. Toth,et al.  Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

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

[19]  Ching-Chi Hsu,et al.  An annealing framework with learning memory , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[20]  Moritoshi Yasunaga,et al.  Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

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

[24]  E. M. Cochrane,et al.  The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem , 2003, Neural Networks.

[25]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[26]  Benjamín Barán,et al.  Reasons of ACO's Success in TSP , 2004, ANTS Workshop.

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

[28]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[29]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[30]  Gerald L. Thompson,et al.  Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems. , 1977 .

[31]  David S. Johnson,et al.  8. The traveling salesman problem: a case study , 2003 .

[32]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

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

[34]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .