进化策略与蚁群算法融合的求解旅行商问题  

Traveling Salesman Problem Based on Integration of Evolution Strategies and Ant ColonyAlgorithm

作　　者：丛爽[1] 贾亚军[1] 

机构地区：[1]中国科学技术大学自动化系,安徽合肥230026

出　　处：《控制工程》2011年第1期83-86,137,共5页Control Engineering of China

基　　金：国家自然科学基金资助项目(61074050)

摘　　要：针对进化策略收敛速度快但容易陷入早熟收敛以及最大最小蚂蚁系统求解能力强但收敛速度较慢的特点,将进化策略与最大最小蚂蚁系统融合,并利用最大最小蚂蚁系统求出每一步迭代的最优解,再对迭代出最优解进行进化策略中的变异操作来加快解的收敛速度。将所提出的算法应用到中国旅行商问题(CTSP)的实际应用中,其结果显示出优越性。To the problem that the evolution strategies converge fast,prone to premature convergence,as well as the max-min ant system has good solving ability,but converges slowly,the max-min ant system is combined with the evolution strategies are combired.The max-min ant system is used to calculate the optimal solution of each iteration,and a mutate operation is put on the iterative optimal solution to speed up the convergence rate of solutions.The combination algorithm is applied into the Chinese traveling salesman problem.The superiority of the proposed algorithm is showed by the results.

关 键 词：进化策略 蚁群算法 最大最小蚁群系统 中国旅行商问题 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]