基于分段搜索策略的改进蜂群算法  

Modified artificial bee colony algorithm based on segmental-search strategy

作　　者：罗钧[1] 肖向海[1] 付丽[1] 王强[1] 

机构地区：[1]重庆大学 光电技术及系统教育部重点实验室,重庆400030

出　　处：《控制与决策》2012年第9期1402-1405,1410,共5页Control and Decision

基　　金：国防科工委国防军工计量“十一五”计划重点项目(B20301118)

摘　　要：针对基本人工蜂群算法在解决优化问题时收敛速度不够快、易陷入局部最优的缺陷,提出一种改进蜂群算法,该算法采用"分段搜索"方式对食物源进行贪婪更新,以提高食物源更新的成功率;同时,招募所有观察蜂选择当前最优食物源,以实现对最优食物源的充分优化,对经典测试函数反复实验的结果表明,改进算法计算结果稳定,与基本蜂群算法相比,加速收敛效果非常明显,全局搜索能力显著提高,运行时间大大缩短,For the problem that when using the basic artificial bee colony（ABC） algorithm to solve the optimal problems, it can not converge so fast and can trap in a local optimal solution easily. Therefore, a modified artificial bee colony algorithm is proposed. To improve the updating rate of food sources, the segmental-search strategy is used, and the way of the onlookers choosing the food sources is modified to optimize the best food source fully. Many experiment results of classic functions show that the modified algorithm owns steady performance, has great advantage of convergence property and global optimizing ability, and also runs faster than ABC algorithm.

关 键 词：人工蜂群 改进算法 分段搜索 充分优化 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]