Abstract
The Bees Algorithm (BA) is a swarm- based metaheuristic algorithm inspired by the foraging behavior of honeybees. This algorithm is very efficient, simple and natural algorithm. In this paper, two natural aspects, namely the patch environment and Levy motion are employed to propose a novel initialization algorithm to initialize the population of bees in the Bees Algorithm. Thus, an improved version of Bees Algorithm is adopted based on the proposed initialization procedure. This initialization algorithm is more natural modeling the patch environment in nature and Levy motion that is believed to characterize the foraging patterns of bees in nature. Experimental results prove the effectiveness of the proposed initialization algorithm. The obtained results confirm that the improved Bees Algorithm employing the proposed initialization algorithm outperforms the standard Bees Algorithm in terms of convergence speed and success rate.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Yang, X.-S.: Review of metaheuristics and generalised evolutionary walk algorithm. Int. J. Bio-Inspired Comput. 3(2), 77–84 (2011)
Pham, D., et al.: The bees algorithm–a novel tool for complex optimisation problems. In: Proceedings of IPROMS 2006 Conference (2006)
Pham, D., et al.: Using the bees algorithm to schedule jobs for a machine. In: Proceedings of Eighth International Conference on Laser Metrology, CMM and Machine Tool Performance (2007)
Pham, D., Otri, S., Darwish, A.H.: Application of the Bees Algorithm to PCB assembly optimisation. In: IPROMS, 3rd International Virtual Conference on Intelligent Production Machines and Systems (2007)
Lara, C., Flores, J.J., Calderón, F.: Solving a School Timetabling Problem Using a Bee Algorithm. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol. 5317, pp. 664–674. Springer, Heidelberg (2008)
Pham, D., Darwish, A.H.: Fuzzy selection of local search sites in the Bees Algorithm. In: 4th International Virtual Conference on Intelligent Production Machines and Systems, IPROMS 2007 (2008)
Ahmad, S.: A study of search neighbourhood in the bees algorithm. Cardiff University (2012)
Ghanbarzadeh, A.: The Bees algorithm. A novel optimisation tool. Cardiff University
Otri, S.: Improving the bees algorithm for complex optimisation problems. Cardiff University (2011)
Packianather, M., Landy, M., Pham, D.: Enhancing the speed of the Bees Algorithm using Pheromone-based Recruitment. In: 7th IEEE International Conference on Industrial Informatics. IEEE (2009)
Viswanathan, G., et al.: Optimizing the success of random searches. Nature 401(6756), 911–914 (1999)
Bailis, P., Nagpal, R., Werfel, J.: Positional communication and private information in honeybee foraging models. Swarm Intelligence, 263–274 (2010)
Reynolds, A.M.: Cooperative random Lévy flight searches and the flight patterns of honeybees. Physics Letters A 354(5), 384–388 (2006)
Reynolds, A.M., et al.: Honeybees perform optimal scale-free searching flights when attempting to locate a food source. Journal of Experimental Biology 210(21), 3763–3770 (2007)
Bartumeus, F., Catalan, J.: Optimal search behavior and classic foraging theory. Journal of Physics A: Mathematical and Theoretical 42(43) (2009)
Reynolds, A.M., et al.: Displaced honey bees perform optimal scale-free search flights. Ecology 88(8), 1955–1961 (2007)
Viswanathan, G., Raposo, E., Da Luz, M.: Lévy flights and superdiffusion in the context of biological encounters and random searches. Physics of Life Review 5(3), 133–150 (2008)
Brown, C.T., Liebovitch, L.S., Glendon, R.: Lévy flights in Dobe Ju/’hoansi foraging patterns. Human Ecology 35(1), 129–138 (2007)
Edwards, A.M.: Overturning conclusions of Lévy flight movement patterns by fishing boats and foraging animals. Ecology 92(6), 1247–1257 (2011)
Edwards, A.M.: Using likelihood to test for Lévy flight search patterns and for general power‐law distributions in nature. Journal of Animal Ecology 77(6), 1212–1222 (2008)
Mantegna, R.N.: Fast, accurate algorithm for numerical simulation of Levy stable stochastic processes. Physical Review E 49, 4677–4683 (1994)
Molga, M., Smutnicki, C.: Test functions for optimization needs, http://www.zsd.ict.pwr.wroc.pl/files/docs/functions.pdf
Adorio, E.P., Diliman, U.: MVF-Multivariate Test Functions Library in C for Unconstrained Global Optimization, http://www.geocities.ws/eadorio/mvf.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hussein, W.A., Sahran, S., Sheikh Abdullah, S.N.H. (2013). A New Initialization Algorithm for Bees Algorithm. In: Noah, S.A., et al. Soft Computing Applications and Intelligent Systems. M-CAIT 2013. Communications in Computer and Information Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40567-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-40567-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40566-2
Online ISBN: 978-3-642-40567-9
eBook Packages: Computer ScienceComputer Science (R0)