求解TSP的遗传蚁群融合算法  

Hybrid of Ant Colony Algorithm and Genetic Algorithm and Its Application in TSP

作　　者：江君莉 潘丰 

机构地区：[1]江南大学轻工过程先进控制教育部重点实验室,江苏无锡214122

出　　处：《江南大学学报（自然科学版）》2012年第3期253-256,共4页Joural of Jiangnan University (Natural Science Edition)　

基　　金：国家863计划项目(2009AA05Z203)

摘　　要：原有的遗传融合蚁群算法虽然克服了基本蚁群算法的不足,优化效果得到了改善,但存在克服收敛速度较慢、易出现停滞以及全局搜索能力较低的缺陷。针对存在容易陷入局部最优解等问题,在原有的遗传融合蚁群算法的基础上进行了许多改进以扩大解的搜索空间,提高了其寻优能力和速度。仿真结果表明,改进后的算法具有更好的寻优能力,效果较好。Compared to basic colony algorithm,former ant colony algorithm based on genetic gene has overcome lots of prob- lems, such as slow convergence speed, easy to get stagnated, and low ability of full search etc. But it also have some disvan- tages,such as easy to fall into a local optimal solution. Therefore, made many improvements in the former ant algorithm based on genetic gene to expand search space solutions, to improve its optimization ability and speed. The experimental re-sults indicated that the improved algorithm has better optimization ability, results are satisfactory.

关 键 词：旅行商问题 蚁群算法 模拟进化算法 遗传算法 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]