Artificial bee colony algorithm with improved special centre
by Hui Sun; Kun Wang; Jia Zhao; Xiang Yu
International Journal of Computing Science and Mathematics (IJCSM), Vol. 7, No. 6, 2016

Abstract: Artificial bee colony (ABC) algorithm is a powerful stochastic evolutionary algorithm, which is widely used to solve complex optimisation problems. However, ABC is good at exploration but poor at exploitation because of its search strategy. For overcoming the shortcomings of original ABC algorithm, such as slow convergence and low solution accuracy, we propose a new ABC algorithm - artificial bee colony algorithm with improved special centre (ISC-ABC). Firstly, an improved special centre is used to determine the current gbest position, and lead the colony convergence. Secondly, Employed bees incorporate the information of gbest solution into the search strategy. By this way, the new candidate solutions are always around with gbest. Finally, compare result on 12 classic functions. The results testify that ISC-ABC performs significantly better than original ABC and several recently proposed similar algorithm.

Online publication date: Fri, 20-Jan-2017

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