Artificial bee colony with multiple search strategies and a new updating mechanism
by Xin Li; Kai Li; Tao Zeng; Tingyu Ye; Luqi Zhang; Hui Wang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 18, No. 1, 2023

Abstract: The imbalance of exploration and exploitation is a weakness in artificial bee colony (ABC) algorithm. To overcome this deficiency, this paper presents an improved ABC (IABC) by employing multiple search strategies and a novel updating method. Firstly, a concept of marginal group is introduced to construct an exploration search strategy. Then, an exploitation search strategy is designed utilising some excellent solutions. Thirdly, the probabilistic selection strategy is modified on this basis of some elite solutions. In the experiments, 22 benchmark problems were utilised to prove the effectiveness of IABC. Test results indicate that IABC achieves stronger optimisation capabilities than the other five ABCs.

Online publication date: Tue, 19-Sep-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com