Abstract
The working of basic ABC algorithm depends on the functioning of three categories of bees; the employed bees, the onlooker bees and the scout bees. Although, employed and onlooker bees have different functionality, they follow the same equation for exploration and exploitation. Obviously, the performance of ABC greatly depends on single equation. In order to provide a variation in the working of ABC, we propose the use of different equations in the employed bee and onlooker bee phase. The new mechanism proposed by us for the movement of the bees depends on the convex linear combination of three candidate solutions. This scheme is initially embedded in the employed bees phase while the original equation is maintained for the onlooker bees. In the second variation the basic equation for employed bees is retained while for onlooker bees, different equation is used. The simulation results demonstrate that the modification increases efficiency and capability in terms of balancing exploration and exploitation as well as the accelerating the convergence rate of the ABC.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical Report-TR06. Erciyes University, Kayseri, Turkey (2005)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization 39, 171–459 (2007)
Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing 8, 687–697 (2008)
Karaboga, D., Basturk, B.: A comparative study of artificial bee colony algorithm. Applied Mathematics and Computation 214, 108–132 (2009)
Singh, A.: An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Applied Soft Computing 9, 625–631 (2009)
Kang, F., et al.: Structural inverse analysis by hybrid simplex artificial bee colony algorithms. Computers & Structures 87, 861–870 (2009)
Samrat, L., et al.: Artificial bee colony algorithm for small signal model parameter extraction of MESFET. Engineering Applications of Artificial Intelligence 11, 1573–2916 (2010)
Fan, H.-Y., Lampinen, J., Dulikravich, G.S.: Improvements to the Mutation Donor Formulation of Differential Evolution. In: International Congress on Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems EUROGEN, pp. 1–12 (2003)
Noman, N., Iba, H.: Accelerating differential evolution using an adaptive local Search. IEEE Transactions on Evolutionary Computation 12(1), 107–125 (2008)
Beightler, C., Phillips, D.: Applied geometric programming. John Wiley and Sons, New York (1976)
Prasad, B., Saini, J.: Optimal thermo hydraulic performance of artificially roughened solar air heater. Journal Solar Energy 47, 91–96 (1991)
Babu, B.: New optimization techniques in engineering. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer India Pvt. Ltd.
About this paper
Cite this paper
Sharma, T.K., Pant, M. (2012). Enhancing Different Phases of Artificial Bee Colony for Continuous Global Optimization Problems. In: Deep, K., Nagar, A., Pant, M., Bansal, J. (eds) Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011. Advances in Intelligent and Soft Computing, vol 130. Springer, India. https://doi.org/10.1007/978-81-322-0487-9_68
Download citation
DOI: https://doi.org/10.1007/978-81-322-0487-9_68
Published:
Publisher Name: Springer, India
Print ISBN: 978-81-322-0486-2
Online ISBN: 978-81-322-0487-9
eBook Packages: EngineeringEngineering (R0)