The traveling salesman problem (TSP) is an important problem for the classical discrete optimization, which is very important to study the solving algorithm. After the introduction of the greedy algorithm, taboo search algorithm, simulated annealing algorithm, genetic algorithm, the author put forward the corresponding algorithm. Aiming at the four typical examples in the test base, we realized implementation of these algorithms with procedures, and the running time and the results of these algorithms are compared. The results show that the greedy algorithm can draw the solution in a short time, the taboo search algorithm and genetic algorithm have the same effect, and the results of simulated annealing algorithm is better than those of genetic algorithm.%旅行售货商问题(简称TSP )是离散优化的一个经典的重要问题，对求解算法的研究非常重要。在介绍求解TSP问题的贪婪算法、禁忌搜索算法、模拟退火算法、遗传算法的基本思想之后，提出了相应的算法。针对测试库的四个典型算例，用程序实现这些算法，对这些算法的运行时间和结果进行比较研究。结果表明贪婪算法短时间就可以得出解，禁忌搜索算法与遗传算法的效果相当，模拟退火算法比遗传算法的结果好。
展开▼
