Simulated annealing algorithm for TSP

Zhu Jing-l · Journal of Hubei Radio & Television University · 2011

Traveling salesman problem,that TSP(Travelling Salesman Problem),is a combinatorial optimization problem.Computational complexity with the NPC.This paper analyzes the simulated annealing algorithm model to study the simulated annealing algorithm for TSP of the algorithm,and gives the simulated annealing algorithm for TSP on the specific implementation.

Read the paper · More papers on PaperTik