| 求解TSP问题的蚁群算法研究 |
| |
| 引用本文： | 吴桂芳,伍红华.求解TSP问题的蚁群算法研究[J].广西民族大学学报,2007,13(2):64-67. |
| |
| 作者姓名： | 吴桂芳 伍红华 |
| |
| 作者单位： | 黄石理工,学院高等职业技术学院,湖北,黄石435003;黄石理工,学院师范学院,湖北,黄石,435003 |
| |
| 摘 要： | 分析了标准蚁群算法易于出现早熟、停滞和算法收敛速度慢的主要原因,在原有算法基础上提出了一种改进型的蚁群算法,该算法可以有效的提高收敛速度,并把该算法应用到TSP问题中,取得了很好的效果.
|
| 关 键 词： | 蚁群算法 旅行商问题 信息素 优化 |
| 文章编号： | 1673-8462（2007）02-0064-04 |
| 修稿时间： | 2007-02-10 |
Research of Ant Colony Algorithm on TSP Problems |
| |
| WU Gui-fang,WU Hong-hua.Research of Ant Colony Algorithm on TSP Problems[J].Journal of Guangxi University For Nationalities(Natural Science Edition),2007,13(2):64-67. |
| |
| Authors: | WU Gui-fang WU Hong-hua |
| |
| Institution: | 1 .Advanced Vocational Technology Branch, Huangshi Institute of Technology , Huangshi 435003 ,China; 2 .Nomal Department of Huangshi Technology of Institute, Huangshi 435003,China |
| |
| Abstract: | The research Analyzed the main reasons for the premature,stagnation and slow constringency of standard ant algorithm,and proposed an improved version of the ant algorithm grounded on the original algorithm,which could effectively improve the rate of the algorithm convergence,and its application in TSP has achieved very good result. |
| |
| Keywords: | ant colony algorithm TSP pheromone optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
