Artificial bee colony with bidirectional search
by Yong Lu; Ruixiang Li; Sumin Li
International Journal of Computing Science and Mathematics (IJCSM), Vol. 7, No. 6, 2016

Abstract: Artificial bee colony (ABC) is an efficient meta-heuristic, which has shown good search abilities on many optimisation problems. In the standard ABC, its solution updating equation uses a random weight to control the difference vector between the current food source and another randomly selected one, and the random weight between −1 and 1 determines the search directions. How to select a good search direction is not an easy task. In this paper, we propose a new ABC algorithm called ABC with bidirectional search, which employs a new method to control the search direction of ABC. To verify the effectiveness of the bidirectional search method, we embed it into two ABC variants and test compares their performance with their corresponding parent algorithms. Experimental results on six benchmark functions show that the bidirectional search method can effectively improve the performance of ABC.

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