Artificial bee colony algorithm with accelerating convergence Online publication date: Tue, 08-Mar-2016
by Li Lv; Longzhe Han; Tanghuai Fan; Jia Zhao
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 10, No. 1, 2016
Abstract: To overcome the drawbacks of Artificial Bee Colony (ABC) algorithm, which converges slowly in the process of searching and easily suffers from premature, this paper presents an effective approach, called ABC with accelerating convergence (AC-ABC). In the process of evolution, first, the employed bee's position is regarded as the general centre position, the bees choose a location greedily as the new global optimal position in the original and general centre position; then we put the advantage of global optimal bee into evolution rule; we add the ability of best bee's learning into the standard ABC and reduce the value of convergence factor linearly according to the iteration times, which can improve the convergence of the new algorithm effectively. Experiments are conducted on 12 test functions to verify the performance of AC-ABC; the results demonstrate promising performance of our method AC-ABC on convergence velocity, precision, and stability of solution.
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