Improving ABC algorithm using new search mechanisms
by Seyed-Hadi Mirghaderi; Mostafa Zandieh
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 16, No. 1, 2017

Abstract: This paper analyses current search equation of the artificial bee colony (ABC) algorithm to diagnose its search method and to provide alternative methods. Although ABC algorithm is an efficient metaheuristic for some combinatorial problems, its equation generates some out-of-range solutions. Hereby, we propose two alternative mechanisms to prevent such a malfunction. The first one uses triangular distribution to restrict the search between upper and lower bound and the second utilises truncated-normal distribution. Focused study reveals the efficiency of proposed alternatives and extended study proves their superior performance in finding near-optimum solutions for 18 benchmark functions.

Online publication date: Thu, 29-Dec-2016

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 Intelligent Systems Technologies and Applications (IJISTA):
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