计算机工程与应用Issue(10)：32-34,187,4.DOI:10.3778/j.issn.1002-8331.1202-0345
一种基于优质边求解TSP的蚁群算法
Ant colony algorithm based on quality edge to solve TSP
胡银厚 1王世卿1
作者信息
- 1. 郑州大学 信息工程学院，郑州 450052
- 折叠
摘要
Abstract
On the research of ant colony algorithm to the Traveling Salesman Problem shows that it can easily fall into the local optimal solution, leading to lower ability to explore better solutions. This paper proposes a solving approach which based on the quality edge to solve this problem. Choose the quality edge according to the information from the algorithm. While the algo-rithm is in stagnation, adjust the pheromone on quality edge, it will enhance the ability of algorithm to explore better solutions. At the same time, improved routing rules will limit the ant to choose the quality edge as much as possible, thereby improving the quality of solution. The experiment results show that the improved solution strategy is reasonable and effective.关键词
蚁群优化/旅行商问题/最大-最小蚁群算法/智能计算/优质边Key words
Ant Colony Optimization(ACO)/Traveling Salesman Problem(TSP)/Max-Min Ant System(MMAS)/intelligent computation/quality edge分类
信息技术与安全科学引用本文复制引用
胡银厚,王世卿..一种基于优质边求解TSP的蚁群算法[J].计算机工程与应用,2013,(10):32-34,187,4.
