الگوریتم کلونی زنبور عسل با راهبرد جستجوی متغیر برای بهینه سازی مستمر

The artificial bee colony (ABC) algorithm is a swarm-based optimization technique proposed for solving continuous optimization problems. The artificial agents of the ABC algorithm use one solution update rule during the search process. To efficiently solve optimization problems with different characteristics, we propose the integration of multiple solution update rules with ABC in this study. The proposed method uses five search strategies and counters to update the solutions. During initialization, each update rule has a constant counter content. During the search process performed by the artificial agents, these counters are used to determine the rule that is selected by the bees. Because the optimization problems and functions have different characteristics, one or more search strategies are selected and are used during the iterations according to the characteristics of the numeric functions in the proposed approach. By using the search strategies and mechanisms proposed in the present study, the artificial agents learn which update rule is more appropriate based on the characteristics of the problem to find better solutions. The performance and accuracy of the proposed method are examined on 28 numerical benchmark functions, and the obtained results are compared with various classical versions of ABC and other nature-inspired optimization algorithms. The experimental results show that the proposed algorithm, integrated and improved with search strategies, outperforms the basic variants and other variants of the ABC algorithm and other methods in terms of solution quality and robustness for most of the experiments.