Implementation of Travelling Saleman Problem Based on Simulated Annealing
Guo Le-xin · Modern Computer · 2012
Travelling salesman problem is a kind of a typical NP-complete problems,around this problem there are different ways of solving.The existing algorithms such as dynamic programming method,Branch and bound method,Backtracking,etc.These precision-type methods are exponential,simply will not solve the practical problems.Greedy method is approximate method can not achieve satisfactory approximation ratio.Genetic algorithm for solving such problems is also one of the commonly used.Since the solution of the problem is a special sequence,therefore,the genetic algorithm in solving the problem of performance is not satisfactory.Describes simulated annealing algorithm in a simple,flexible,use a wide range,run efficient and less constrained by the initial conditions,is a good algorithm to solve the travelling salesman problem.