| 改进的蚁群算法在TSP问题中的应用 |
| |
| 引用本文： | 杨仲坡,辛立民,魏云. 改进的蚁群算法在TSP问题中的应用[J]. 山西建筑, 2010, 36(8): 9-10 |
| |
| 作者姓名： | 杨仲坡 辛立民 魏云 |
| |
| 作者单位： | 安徽理工大学,安徽,淮南,232001 |
| |
| 摘 要： | 应用基本蚁群算法来求解TSP问题，在算法中引入去交叉策略，降低其计算复杂度，仿真算例表明，该方法能有效加快局部搜索能力，加快了大规模TSP问题的求解。
|
| 关 键 词： | 蚁群算法 TSP 复杂度 大规模 |
On application of reformed ant colony algorithm in TSP problems |
| |
| YANG Zhong-po,XIN Li-min,WEI Yun. On application of reformed ant colony algorithm in TSP problems[J]. Shanxi Architecture, 2010, 36(8): 9-10 |
| |
| Authors: | YANG Zhong-po XIN Li-min WEI Yun |
| |
| Affiliation: | YANG Zhong-po XIN Li-min WEI Yun |
| |
| Abstract: | The problem of TSP was resolved by the apply the basic ant colony algorithm,cross-cutting strategy was pulled into the algorithm,the computational complexity was reduced.The simulation case was showed that the local search capabilities can be effectively speeded up by this method,the solution of large-scale TSP problems was speeded up. |
| |
| Keywords: | ant colony algorithm TSP complexity large-scale |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
