An Artificial Bee Colony algorithm with guide of global & local optima and asynchronous scaling factors for numerical optimization

• Published in: Applied soft computing Vol. 37; pp. 608 - 618
• Main Authors: Liu, Jianjun, Zhu, Hongqiu, Ma, Qiang, Zhang, Lanlan, Xu, Honglei
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.12.2015
• Subjects: Artificial Bee Colony algorithm; Global optimization; Population-based optimization; Scaling factors; Artificial Bee Colony algorithm; Global optimization; Population-based optimization; Scaling factors
• ISSN: 1568-4946; 1872-9681
• DOI: 10.1016/j.asoc.2015.08.021

[Display omitted] •Build a better searching mechanism for ABC algorithm.•Integrate information of global and previous best solutions into search strategy.•Introduce two adaptive scaling factors for a better balance between exploration and exploitation. Artificial Bee Colony (ABC) algorithm is a wildly used optimization algorithm. However, ABC is excellent in exploration but poor in exploitation. To improve the convergence performance of ABC and establish a better searching mechanism for the global optimum, an improved ABC algorithm is proposed in this paper. Firstly, the proposed algorithm integrates the information of previous best solution into the search equation for employed bees and global best solution into the update equation for onlooker bees to improve the exploitation. Secondly, for a better balance between the exploration and exploitation of search, an S-type adaptive scaling factors are introduced in employed bees’ search equation. Furthermore, the searching policy of scout bees is modified. The scout bees need update food source in each cycle in order to increase diversity and stochasticity of the bees and mitigate stagnation problem. Finally, the improved algorithms is compared with other two improved ABCs and three recent algorithms on a set of classical benchmark functions. The experimental results show that the our proposed algorithm is effective and robust and outperform than other algorithms.