分阶段搜索的改进人工蜂群算法

Improved artificial bee colony algorithm using phased search

针对人工蜂群(ABC)及其改进算法在求解高维复杂函数优化问题时,存在求解精度低、收敛速度慢、易陷入局部寻优且改进算法控制参数多的不足,提出一种分阶段搜索的改进人工蜂群算法。该算法设计了分阶段雇佣蜂搜索策略,使雇佣蜂在不同阶段具备不同的搜索特点,降低了算法陷入局部极值的概率;定义逃逸半径,使其能够更好地指导早熟个体跳出局部极值,避免了逃逸行为的盲目性;同时,采用均匀分布结合反向学习的初始化策略,促使初始解分布均匀且质量较优。通过对优化问题中8个典型高维复杂函数的仿真实验结果表明,该改进算法求解精度更高,收敛速度更快,更加适合高维复杂函数求解。

Aiming at the shortcomings of Artificial Bee Colony（ ABC） algorithm and its improved algorithms in solving high-dimensional complex function optimization problems, such as low solution precision, slow convergence, being easy to fall in local optimum and too many control parameters of improved algorithms, an improved artificial bee colony algorithm using phased search was proposed. In this algorithm, to reduce the probability of being falling into local extremum, the segmentalsearch strategy was used to make the employed bees have different characteristics in different stages of search. The escape radius was defined to guide the precocity individual to jump out of the local extremum and avert the blindness of escape operation. Meanwhile, to improve the quality of initialization food sources, the uniform distribution method and oppositionbased learning theory were used. The simulation results of eight typical high-dimensional complex functions of optimization problems show that the proposed method not only obtains higher solving accuracy, but also has faster convergence speed. It is especially suitable for solving high-dimensional optimization problems.