摘要
针对人工蜂群算法在处理大规模旅行商问题时普遍存在易陷入局部最优解和早熟收敛的问题,提出一种改进的人工蜂群算法.将柯西变异算子引入蜜蜂食物源更新公式,设计了一种自适应对数步长代替随机步长以改进随机解生成公式.将改进算法用于求解对称TSP问题,实验结果表明,改进后的算法有效地解决了人工蜂群算法早熟收敛和搜索速度较慢等问题,在求解TSP问题上确实有效可行.
Aiming at the premature convergence problem and easily plunged into local optimal solution in artificialbee colony algorithm when dealing with large-scale travlling salesman problem,this paper proposes an improvedartificial bee colony algorithm. The Cauchy mutation operator is introduced into the bee food source update formula.A kind of adaptive logarithm step is designed instead of generated random step to improve the random solution formula.The improved algorithm is used for solving symmetric TSP problem,the experimental results show that the improvedalgorithm can effectively solve the artificial colony algorithm problem such as premature convergence and slow searchspeed,and it is really effective and feasible in solving TSP problem.
引文
[1]毕晓君.信息智能处理技术[M].北京:电子工业出版社,2010.
[2]王剑文,戴光明,谢柏桥,等.求解TSP问题算法综述[J].计算机工程与科学,2008,30(2):72-74.
[3]巩固,胡晓婷,郝国生,等.一种解决TSP的改进遗传算法[J].计算机应用与软件,2009,26(4):87-89.
[4]朱小平,赵曦.一种改进的求解TSP的粒子群算法[J].科学技术与工程,2010,10(15):3727-3729.
[5]朱命昊,厍向阳.求解旅行商问题的改进人工鱼群算法[J].计算机应用研究,2010,27(10):3734-3736.
[6]柳寅,马良.模糊人工蜂群算法的旅行商问题求解[J].计算机应用研究,2013,30(19):2694-2696.
[7]Karaboga D.An idea based on honey bee swarm for numerical optimization[R].Kayseri:Computer Engineering Department,Engineering Faculty,Erciyes University,2005.
[8]Karaboga D,Basturk B.On the performance of artificial bee colony(ABC)algorithm[J].Applied Soft Computing,2008,8(1):687-697.
[9]张银雪,田学民,曹玉苹.改进搜索策略的人工蜂群算法[J].计算机应用,2012,32(12):3326-3330.
[10]李晶晶,戴月明.自适应混合变异的蛙跳算法[J].计算机工程与应用,2013,49(10):58-61.
[11]臧明相,马轩,段奕明.一种改进的人工蜂群算法[J].西安电子科技大学学报:自然科学版,2015,42(2):73-79.
[12]胡中华,赵敏.基于人工蜂群算法的TSP仿真[J].北京理工大学学报,2009,29(11):978-982.
[13]马良,朱刚,宁爱兵.蚂蚁优化算法[M].北京:科学出版社,2008.