A hybrid artificial bee colony algorithm based on different search mechanisms Online publication date: Sun, 03-Jan-2016
by Hui Sun; Bing Li; Qing Yu
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 9, No. 4, 2015
Abstract: In order to overcome the drawbacks of standard artificial bee colony (ABC) algorithm, such as slow convergence and low solution accuracy, a hybrid ABC algorithm based on different search mechanisms is proposed in this paper. According to the type of position information in ABC, three basic search mechanisms are summarised which 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. All of these strategies can make a good balance between exploration and exploitation. At every iteration, each bee randomly selects a search strategy to produce a candidate solution under the same probability. The experiment is conducted on 12 classical functions and 28 CEC2013 functions. Results show that the new algorithm performs significantly better than several recently proposed similar algorithms in terms of the convergence speed and solution accuracy.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook