| 改进蚁群算法求解TSP |
| |
| 引用本文： | 胡粼粼,葛红.改进蚁群算法求解TSP[J].计算机系统应用,2012,21(5):198-200,208. |
| |
| 作者姓名： | 胡粼粼 葛红 |
| |
| 作者单位： | 华南师范大学计算机学院,广州510631 |
| |
| 基金项目： | 安徽省教育厅自然科学基金（2005KJ004ZD） |
| |
| 摘 要： | 针对蚁群算法存在易陷入局部寻优、收敛缓慢等缺陷,提出一种基于邻接矩阵的两层搜索决策来选择转移路径的方法对蚁群算法进行改进,求解TSP问题。通过实验及分析,验证了该算法具有较好性能。
|
| 关 键 词： | 改进蚁群算法 TSP 路径寻优 两层搜索决策 全局收敛 |
| 收稿时间： | 2011/8/25 0:00:00 |
| 修稿时间： | 2011/9/23 0:00:00 |
Improved Ant Colony Algorithm for Solving TSP |
| |
| HU Lin-Lin and GE Hong.Improved Ant Colony Algorithm for Solving TSP[J].Computer Systems& Applications,2012,21(5):198-200,208. |
| |
| Authors: | HU Lin-Lin and GE Hong |
| |
| Affiliation: | (School of Computer Science,South China Normal University,Guangzhou 510631,China) |
| |
| Abstract: | Aiming at solving the problem of falling into local optimization easily and slow convergence,this paper proposes a method that adopts a bi-level searching decision based on adjacent matrix in choosing diverting path to improve ant colony algorithm and solve TSP problem.The experiment results show that the new algorithm has better performance. |
| |
| Keywords: | improved ant colony algorithm TSP path optimization bi-level searching decision global convergence |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机系统应用》浏览原始摘要信息 |
|
点击此处可从《计算机系统应用》下载全文 |
