混合蚁群蜂群算法在旅行Agent问题中的应用.pdf

34 2012 ，48 （36 ） Computer Engineering and Applications 计算机工程与应用 ⦾研究、探讨⦾ 混合蚁群蜂群算法在旅行Agent 问题中的应用 1 1 2 宋佩莉 ，祁 飞 ，张 鹏 1 1 2 SONG Peili , QI Fei , ZHANG Peng 1.西安建筑科技大学 信息与控制工程学院，西安 710055 2.西安建筑科技大学 艺术学院，西安 710055 1.School of Information and Control Engineering, Xi ’an University of Architecture and Technology, Xi ’an 710055, China 2.College of Arts, Xi ’an University of Architecture and Technology, Xi ’an 710055, China SONG Peili, QI Fei, ZHANG Peng. Application of hybrid ant colony and bee colony algorithm in traveling Agent problem. Computer Engineering and Applications, 2012, 48 （36 ）：34-38. Abstract ：Aiming at the defects such as long search time and tending to be trapped by local optimization for ant col- ony algorithm on solving Traveling Agent Problem （TAP ）, this paper proposes an improves algorithm which inte- grates ant and bee colony algorithm. The algorithm is more suitable for the characteristics of TAP by modifying the state transition probability and pheromone updating rules. This algorithm makes the ants search for the optimal solu- tion as soon as possible by introducing the thought of follow bees. The algorithm adding the obstruction factor avoids the shortcoming that the solution is trapped easily in the local optimum. The simulation results show that the algo- rithm for resolving the TAP avoids effectively the above-mentioned disadvantages of the ant colony algorithm, and also show that the algorithm is superior to other related methods on the performance of solution. Key words ：traveling Agent problem; ant colony algorithm; bee colony algorithm; follow ants; obstruction factor 摘 要：针对蚁群算法在解决旅行Agent 问题（TAP ）时存在搜索时间长和易陷入局部最优的缺点，提出一种将 蜂群和蚁群算法相结合的新型算法。通过修改状态转移概率和信息素更新规则使算法更符合TAP 问题的特 征，引入跟随蜂思想使蚂蚁尽快搜索到问题最优解，加入阻塞度因子以避免算法陷入局部最优。仿真结果表 明，该算法在解决旅行Agent 问题时有效避免了蚁群算法的上述缺点，且在解的性能上优于相关算法。 关键词：旅行Agent 问题；蚁群算法；蜂群算法；跟随蚁；阻塞度因子 文献标志码：A 中图分类号：TP39