The full text of this article
Hybridisation of classical unidimensional search with ABC to improve exploitation capability
by Pranav Dass; Shimpi Singh Jadon; Harish Sharma; Jagdish Chand Bansal; Kendall E. Nygard
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 5, No. 2, 2015
Abstract: Artificial bee colony (ABC) optimisation algorithm is relatively a recent, fast and easy to implement population-based meta heuristic for optimisation. ABC has been proved a competitive algorithm with some popular swarm intelligence-based algorithms such as particle swarm optimisation, firefly algorithm and ant colony optimisation. However, it is observed that ABC algorithm is better at exploration but poor at exploitation. Due to large step size, the solution search equation of ABC has enough chance to skip the optimum. In order to balance this, ABC is hybridised with a local search called as classical unidimensional search (CUS). The proposed algorithm is named as hybridised ABC (HABC). In HABC, best solution of each iteration is further exploited in both its positive and negative direction in a predefined range which enhances the exploitation in ABC. The experiments are carried out on 15 test problems of different complexities and dimensions in order to prove the efficiency of proposed algorithm and compared with ABC. The results shows that hybridisation of CUS with ABC improves the performance of ABC.
Online publication date: Wed, 15-Jul-2015
is only available to individual subscribers or to users at subscribing institutions.
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 Artificial Intelligence and Soft Computing (IJAISC):
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 firstname.lastname@example.org