An Improved Simulated Annealing Algorithm for Traveling Salesman Problem

Traveling salesman problem (TSP) is one of the well-known NP-Complete problems. The simulated annealing algorithm is improved with the four vertices and three lines inequality to search the optimal Hamiltonian circuit or near optimal Hamiltonian circuit. The four vertices and three lines inequality is considered as the heuristic information to change the local Hamiltonian paths into the local optimal Hamiltonian paths. The local optimal Hamiltonian circuits are generated with the basic simulated algorithm firstly, and the local Hamiltonian paths in them are changed into the local optimal Hamiltonian paths with the four vertices and three lines inequality, and then the shorter local optimal Hamiltonian circuits are obtained. The algorithm of the improved simulated annealing is designed and tested with several TSP instances. The experimental results show that the shorter local optimal Hamiltonian circuits are found than those searched with the basic simulated annealing algorithm under the same preconditions.

[1]  Serban Iordache,et al.  Consultant-guided search: a new metaheuristic for combinatorial optimization problems , 2010, GECCO '10.

[2]  Gerhard J. Woeginger,et al.  Four point conditions and exponential neighborhoods for symmetric TSP , 2006, SODA '06.

[3]  Christian Artigues,et al.  A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem , 2008, Comput. Oper. Res..

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

[5]  Philip N. Klein,et al.  An O(n log n) approximation scheme for Steiner tree in planar graphs , 2009, TALG.

[6]  I. Osman,et al.  A neural network algorithm for the traveling salesman problem with backhauls , 2003 .

[7]  D. West.  Introduction to Graph Theory , 1995 .

[8]  C. Seife.  What Are the Limits of Conventional Computing? , 2005, Science.

[9]  Yang Li,et al.  Simulated annealing with probabilistic neighborhood for traveling salesman problems , 2011, 2011 Seventh International Conference on Natural Computation.

[10]  Jun Zhang,et al.  A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems , 2010, IEEE Transactions on Evolutionary Computation.

[11]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[12]  S. Voß,et al.  A classification of formulations for the (time-dependent) traveling salesman problem , 1995 .

[13]  Yu-Hsin Liu.  Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem , 2010, Appl. Math. Comput..

[14]  Yi Liu,et al.  Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP , 2009, GEC '09.

[15]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[16]  Guevara Noubir,et al.  Universal approximations for TSP, Steiner tree, and set cover , 2005, STOC '05.