| 优化型蚁群算法在旅行商问题中的应用研究 |
| |
| 引用本文： | 于海平,杨艳霞. 优化型蚁群算法在旅行商问题中的应用研究[J]. 计算机与数字工程, 2010, 38(6): 22-25 |
| |
| 作者姓名： | 于海平 杨艳霞 |
| |
| 作者单位： | 武汉科技大学城市学院信息工程学部,武汉,430083 |
| |
| 摘 要： | 针对基本蚁群算法的搜索时间长和局部收敛等现象,提出一种用于求解旅行商问题（TSP）的优化型蚁群算法,该算法有效地将最大最小蚁群算法（MMAS）和遗传算法（GA）相结合,一方面在很大程度上缩短了算法的寻优时间;另一方面有效地避免了算法的早熟停滞现象。利用MATLAB对多种TSP问题进行仿真研究,实验结果证明了优化型蚁群算法在性能上优于MMAS和GA。
|
| 关 键 词： | 最大最小蚁群算法 信息素 旅行商问题 遗传算法 |
Research on Applying Optimization-based Ant Colony Algorithm in the Traveling Salesman Problem |
| |
| Yu Haiping,Yang Yanxia. Research on Applying Optimization-based Ant Colony Algorithm in the Traveling Salesman Problem[J]. Computer and Digital Engineering, 2010, 38(6): 22-25 |
| |
| Authors: | Yu Haiping Yang Yanxia |
| |
| Affiliation: | Yu Haiping Yang Yanxia(Department of Information Engineering,Wuhan University of Science and Technology City College,Wuhan 430083) |
| |
| Abstract: | Aiming at the phenomena such as searching for a long time and the local convergence of ant colony algorithm,this paper presents a new optimization ant colony algorithm to solve traveling salesman problem.It effectively ant colony algorithm and genetic algorithm combined,on the one hand a large extent,the algorithm optimization to shorten the time;the other hand,the algorithm was effective in avoiding premature stagnation.Using matlab simulation of the TSP,the experiment proves the algorithm is better than MMAS and GA. |
| |
| Keywords: | max-min ant system pheromone traveling salesman problems genetic algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
