| 双信息素蚁群算法及其在TSP中的应用研究 |
| |
| 引用本文： | 薛莉,戴居丰,魏志成.双信息素蚁群算法及其在TSP中的应用研究[J].计算机仿真,2007,24(8):167-170,181. |
| |
| 作者姓名： | 薛莉 戴居丰 魏志成 |
| |
| 作者单位： | 天津大学电子信息工程学院,天津,300072 |
| |
| 摘 要： | 提出了一种新的蚁群算法,通过在算法中引入双信息素,很好地改进了算法在解决TSP(旅行商)问题时的收敛性和最优解的全局性.一方面通过提高全局信息素对城市路径选择的影响度,很大程度上缩短了算法寻优时间,使算法收敛性得到很大的改善;另一方面通过对接近最优解的一定范围内次优解进行局部更新,避免了算法容易收敛于局部最优解的缺点,极大地改进了最优解的全局特性.在MATLAB中构建了基于蚁群算法的TSP问题模型,仿真结果表明,独立的全局信息素使蚁群很快集中于各个次优解区域搜索,局部更新策略又使蚁群跳出局部级值寻找最优,仿真结果证明算法的改进十分有效.
|
| 关 键 词： | 蚁群算法 双信息素 旅行商问题 信息素 蚁群算法 应用 研究 Pheromone Ant Colony Algorithm 最优 级值 更新策略 搜索 区域 仿真结果 模型 MATLAB 特性 算法收敛性 局部 次优解 范围 改善 |
| 文章编号： | 1006-9348（2007）08-0167-04 |
| 修稿时间： | 2006-08-302006-09-07 |
Application of Ant Colony Algorithm with Two Kinds of Pheromone in TSP |
| |
| XUE Li,DAI Ju-feng,WEI Zhi-cheng.Application of Ant Colony Algorithm with Two Kinds of Pheromone in TSP[J].Computer Simulation,2007,24(8):167-170,181. |
| |
| Authors: | XUE Li DAI Ju-feng WEI Zhi-cheng |
| |
| Affiliation: | Electronics and Information Engineering Department, Tianjin University,Tianjin 300072, China |
| |
| Abstract: | This paper gives an improved ant colony algorithm with two kinds of pheromone, it can overcome the deficiencies of the primal ant colony algorithm. To solve TSP, it shortens the time of the course to find the best value by enhancing the global pheromone weight. Also a local updating is introduced when the value is in a range of the best value given in TSPLIB. So this improved ant colony algorithm can find the desired value fleetly and accurately. At last, the module of TSP is developed, the improved ant colony algorithm is simulated in MATLAB, and the algorithm is improved obviously. |
| |
| Keywords: | Ant colony algorithm Two kinds of pheromone TSP |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
