Enhancing artificial bee colony algorithm with generalised opposition-based learning
by Xinyu Zhou; Zhijian Wu; Changshou Deng; Hu Peng
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 3, 2015

Abstract: As a new global optimisation technique, artificial bee colony (ABC) algorithm becomes popular in recent years for its simplicity and effectiveness. In the basic ABC, however, the solution search equation updates only one dimension to produce a new candidate solution, which may result in that the offspring becomes similar to its parent and cause insufficient search. To overcome this drawback, we proposes an enhanced ABC (EABC) variant by utilising the generalised opposition-based learning (GOBL) strategy. With the help of GOBL, much more promising search regions can be explored, so the probability of converging to the global optimum is highly increased. Experiments are conducted on 13 well-known benchmark functions to verify the proposed approach, and the results show that EABC is very promising in terms of solution accuracy and convergence speed.

Online publication date: Thu, 28-May-2015

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