摘要：

为克服人工蜂群算法在求解函数优化问题时存在收敛精度低、收敛速度慢的缺点,提出一种改进的人工蜂群算法。为提高人工蜂群算法的局部搜索能力和避免早熟收敛,跟随蜂在当前最优解的周围进行局部搜索,并随着迭代次数的增加,逐渐缩小侦查蜂在当前最优解周围的局部搜索范围。通过6 个标准测试函数完成仿真实验, 结果表明,与基本人工蜂群算法相比,改进算法在寻优精度和收敛速度上均得到提高。

关键词: 人工蜂群算法, 当前最优解, 局部搜索, 早熟收敛, 侦查蜂

Abstract:

An efficient modified Artificial Bee Colony(ABC) algorithm is proposed for function optimization problems to overcome the drawbacks of low computational accuracy and slow convergence of conventional ABC algorithm. In this algorithm,in order to enhance the local search capability of the ABC algorithm,and avoid the premature convergence effectively,onlooker bees do the local search around the current optimal solution,and the radius of the search around the current optimal solution for scout bees is gradually decreased with the increase of iterations. Simulation results of six standard functions show that compared with the basic ABC algorithm,the modified ABC algorithm can attain significant improvement on solution accuracy and convergence rate.

Key words: Artificial Bee Colony (ABC) algorithm, current optimal solution, local search, premature convergence, scout bee

中图分类号: 

• TP301. 6