Several Methods for Solving Traveling Salesman Problem
Xuejie Wei · Jisuanji fangzhen · 2006
The Traveling Salesman Problem(TSP) is one of the typical NP-Complete hard problems in combinatorial optimization,which is easy to be described but hard to be solved.Its possible amounts of path increase exponentially with the amounts of city,so it is very difficult to solve.But to solve TSP quickly and effectively has important theoretical values and high practical application values.TSP is first introduced in this paper.Then the basic thoughts of six effective methods(simulated annealing algorithm,taboo search algorithm,Hopfield neural networks optimization algorithm,ant colony algorithm,genetic algorithms and hybrid optimization strategy) for solving TSP and their processes are discussed.At last,the advantages and disadvantages of the six main solving methods are respectively indicated,and the prospect for the future of solving TSP is provided.