An improved artificial bee colony algorithm for global numerical optimisation Online publication date: Mon, 05-Jun-2017
by Tahere Yaghoobi; Elahe Esmaeili
International Journal of Bio-Inspired Computation (IJBIC), Vol. 9, No. 4, 2017
Abstract: Artificial bee colony (ABC) is a simple and powerful optimisation algorithm, which simulates the random behaviour of honey bees. In this study, a modified version of ABC algorithm is proposed by considering: 1) initialising the population based on chaos theory; 2) utilising multiple searches, instead of single search, in employee and onlooker bee phases; 3) controlling the frequency of perturbation by a modification rate. The proposed algorithm implemented by C# programming language and executed on benchmark functions of Sphere, Rosenbrock, Rastrigin, non-continuous Rastrigin, Griewank, Schwefel, Schwefel 1.2, Schwefel 2.2, Step and Ackley. The performance of proposed ABC algorithm is compared with ABC and modified ABC algorithms, on different tests, according to measures of mean and standard deviation. Findings showed the suggested algorithm outperforms ABC and modified ABC algorithms in 65% of test cases in getting best mean and in 55% of cases for standard deviation.
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 Bio-Inspired Computation (IJBIC):
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