计算机与数字工程2016，Vol.44Issue(3)：396-399,437,5.DOI:10.3969/j.issn.1672-9722.2016.03.003
一种改进的竞争型蚁群算法在TSP问题中的应用磁
Application of An Improved Competitive Ant Colony Algorithm in TSP
张开碧 1张洋川 1万素波 1白银1
作者信息
- 1. 重庆邮电大学自动化学院重庆 400065
- 折叠
摘要
Abstract
The path optimization problem has been a crucial factor in the transportation costs .With the continuous pro‐gress of the society and the rapid development of economy ,the path optimization problem has been greatly developed .The method of optimizing the distribution route can save the transportation costs and control the cost effectively .On the basis of analyzing the conventional ant colony algorithm ,this way of competition is used to let the ant colony release information ,and the pheromone update mechanism is changed to further optimize the distribution route .Finally ,the result can be gotten that the algorithm converges faster ,is more powerful and more accurate ,and has better result .关键词
蚁群算法/TSP/信息素竞争机制/路径优化Key words
ant colony algorithm/TSP/pheromone competition mechanism/route optimization分类
信息技术与安全科学引用本文复制引用
张开碧,张洋川,万素波,白银..一种改进的竞争型蚁群算法在TSP问题中的应用磁[J].计算机与数字工程,2016,44(3):396-399,437,5.
