A hybrid algorithm to solve traveling salesman problem

Abstract

The TSP problem is a typical one in the field of combinatorial optimization. After study other researchers' related works, this paper presents a hybrid algorithm based on simulated annealing, ant colony and genetic in reference to previous research, in order to improve computing performance. Algorithms of this paper are used for solving traveling salesman problem, and the simulation contrast test results show that the algorithm has better convergence speed and optimal results; it also shows that the algorithm is feasible and effective. © 2012 Springer-Verlag.