Improved multi-strategy artificial bee colony algorithm
by Li Lv; Lieyang Wu; Jia Zhao; Hui Wang; Runxiu Wu; Tanghuai Fan; Min Hu; Zhifeng Xie
International Journal of Computing Science and Mathematics (IJCSM), Vol. 7, No. 5, 2016

Abstract: Artificial bee colony (ABC) algorithm is a nature-inspired metaheuristic based on imitating the foraging behaviour of bee, which is widely used in solving complex multi-dimensional optimisation problems. In order to overcome the drawbacks of standard ABC, such as slow convergence and low solution accuracy, we propose an improved multi-strategy artificial bee colony algorithm (MSABC). According to the type of position information in ABC, three basic search mechanisms are summarised, the mechanisms include searching around the individual, the random neighbour and the global best solution. Then, the basic search mechanisms are improved to obtain three search strategies. Each bee randomly selects a search strategy to produce a candidate solution under the same probability in each iteration. Thus these strategies can make a good balance between exploration and exploitation. Finally, the experiments are conducted on eight classical functions. Results show that our algorithm performs significantly better than several recently proposed similar algorithms in terms of the convergence speed and solution accuracy.

Online publication date: Tue, 01-Nov-2016

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