An improved artificial bee colony algorithm for numerical functions Online publication date: Mon, 09-Nov-2015
by Jiuyuan Huo; Yaonan Zhang; Hongxing Zhao
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 7, No. 3/4, 2015
Abstract: The artificial bee colony (ABC) algorithm is an important branch of evolutionary algorithms and has been shown to be competitive with other algorithms for solving optimisation problems. However, there are always some insufficiencies in ABC algorithm such as lower convergence speed and easily get trapped in the local optima. To increase depth search capabilities of onlooker bees and ensure scout bees do not discard the current optimal solution, we proposed a modified ABC algorithm (denoted as ORABC) based on the optimisation strategy and retained strategy of the best individual in this paper. Compared with ABC algorithm, ABC* (added retained strategy to ABC) and ORABC algorithm, experiments are conducted on a set of numerical benchmark functions. The numerical simulation results demonstrate that ORABC algorithm improves the convergence characteristics of ABC algorithm and provides very remarkable performance in solving complex numerical optimisation problems compared to original algorithm.
Online publication date: Mon, 09-Nov-2015
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 Reasoning-based Intelligent Systems (IJRIS):
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 email@example.com