| 蚁群算法求解TSP综述 |
| |
| 引用本文： | 张广帅,张煜东,吉根林. 蚁群算法求解TSP综述[J]. 南京师范大学学报, 2014, 0(4): 39-44 |
| |
| 作者姓名： | 张广帅 张煜东 吉根林 |
| |
| 作者单位： | 南京师范大学计算机科学与技术学院,江苏 南京,210023 |
| |
| 基金项目： | 国家自然科学基金，南京师范大学高层次人才科研启动基金项目 |
| |
| 摘 要： | 蚁群算法是一种群智能算法,可用于求解图模型最优化路径的计算问题.它于1992年由Dorigo M.提出,借鉴蚂蚁在蚁群与食物之间寻找最短路径.本文集中讨论了几种典型的求解旅行商问题的蚁群算法扩展,讨论其相应的优缺点,并对其学术与工业的应用领域与合理发展进行了总结与展望.
|
| 关 键 词： | 蚁群算法 蚂蚁系统 蚁群系统 最大最小蚂蚁系统 旅行商问题 |
Survey on Ant Colony Algorithm for the Traveling Salesman Problem |
| |
| Zhang Guangshuai,Zhang Yudong,Ji Genlin. Survey on Ant Colony Algorithm for the Traveling Salesman Problem[J]. Journal of Nanjing Nor Univ: Eng and Technol, 2014, 0(4): 39-44 |
| |
| Authors: | Zhang Guangshuai Zhang Yudong Ji Genlin |
| |
| Affiliation: | ( School of Computer Science and Technology, Nanjing Normal University, Nanjing 210023, China) |
| |
| Abstract: | Ant colony algorithm（ ACA） is a swarm intelligence- based method for solving computational problems that can be reduced to finding good paths through graphs. It was initially proposed by M. Dorigo in 1992,inspired by the behavior of ants seeking a shortest paths between the colony and a source of food. The paper concentrates on the discussions of the typical ACA extension for solving the traveling salesman problem（ TSP） and their respective advantages and disadvantages,and finally summarize and expect their academic and industrial applied fields and reasonable developments. |
| |
| Keywords: | ant colony algorith ant system ant colony system max-min ant system TSP |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
