Optimization Models and Heuristic Method Based on Simulated Annealing Strategy for Traveling Salesman Problem
Hao Xu · Applied Mechanics and Materials · 2010
The traveling salesman problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science. In this paper, we presented a novel heuristic simulated annealing algorithm for solving TSP. The algorithm is fully operational in the genetic role of crossover operator, and mutation operator, to achieve a balance between speed and accuracy. The experiment results show that the algorithm is better than the traditional method.