| 求解旅行商问题的几种智能算法 |
| |
| 引用本文： | 朱献文,李福荣.求解旅行商问题的几种智能算法[J].计算机与数字工程,2010,38(1):32-35. |
| |
| 作者姓名： | 朱献文 李福荣 |
| |
| 作者单位： | 黄淮学院国际学院,驻马店,463000 |
| |
| 摘 要： | 旅行商问题（TSP）是一个典型的组合优化问题，易于描述却难于求解。对于大规模TSP问题，目前仍未有非常有效的方法，如何快速有效的求解TSP问题有着重要的理论价值和实际意义。文章介绍了什么是TSP，论述了目前求解旅行商问题较为有效的六种智能算法（遗传算法、蚁群算法、Hopfield神经网络算法、模拟退火算法、人工免疫算法、混合优化算法），并简单阐述了其优缺点，给出了未来针对TSP问题的研究重点。
|
| 关 键 词： | 旅行商问题 智能算法 路径 |
Several Intelligent Algorithms for Solving Traveling Salesman Problem |
| |
| Zhu Xianwen,Li Furong.Several Intelligent Algorithms for Solving Traveling Salesman Problem[J].Computer and Digital Engineering,2010,38(1):32-35. |
| |
| Authors: | Zhu Xianwen Li Furong |
| |
| Affiliation: | International College/a>;Huanghuai University/a>;Zhumadian 463000 |
| |
| Abstract: | Traveling Salesman Problem(TSP) is a typical combination optimization problem,which is easy to be described and hard to be solved.For massive TSP,there is no effective solution has been found today.It has important theoretical values and high practical application values to solve TSP quickly and effectively.This paper introduces TSP firstly,and then discusses the six effective methods generally(Genetic algorithm,Ant Colony algorithm,Hopfield Neural Network,Simulated Annealing algorithm,Artificial Immune alg... |
| |
| Keywords: | traveling salesman problem （TSP） intelligent algorithms path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
