Enhancing artificial bee colony algorithm using more information-based search equations

Artificial bee colony (ABC) algorithm is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, there is still an insufficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. To address this concerning issue, in this paper, we propose a novel ABC method called as EABC to improve the performance of ABC. In our method, in order to balance the exploration and the exploitation, two new search equations are presented to generate candidate solutions in the employed bee phase and the onlookers phase, respectively. Additionally, we use a more robust calculation to determine and compare the quality of alternative solutions. Experiments are conducted on a set of 48 benchmark functions and also two engineering optimization problems. The results show that EABC significantly improves the performance of ABC, offering faster global convergence, higher solution quality, and stronger robustness when compared with the other algorithms.