智能算法求解TSP问题的比较

Comparison of Intelligent Algorithms for Solving TSP Problems

截至目前，针对如何解决旅行商问题（即TSP问题）的方法出现了很多版本，而且各具特色，毫不雷同。通过大量的搜集总结，可以归纳出目前被广泛使用的几种解法：禁忌搜索算法、蚁群算法、进化算法、Hopfield神经网络算法、粒子群优化算法和模拟退火算法。通过对6种方法优缺点的比较，可得出适合智能求解TSP问题的方法及改进措施。

Up to now-, there are many versions of the method to solve the traveling salesman problem（TSP problem）. Through a large number of collection and summary, we can sum up several methods which are widely used at present： tabu search algorithm, ant colony algorithm, evolutionary algorithm, Hopfield neural network algorithm, particle swarm optimization algorithm and simulated annealing algorithm. Through the comparison of the advantages and dis- advantages of the 6 methods, we can get the method and improvement measures that are suitable for solving TSP prob- lems intelligently.