International Journal of Modern Education and Computer Science (IJMECS)
IJMECS Vol. 6, No. 1, 8 Jan. 2014
Cover page and Table of Contents: PDF (size: 562KB)
Improvised Scout Bee Movements in Artificial Bee Colony
Full Text (PDF, 562KB), PP.1-16
Views: 0 Downloads: 0
Author(s)
Index Terms
ABC, Artificial Bee Colony, Quadratic Interpolation, Gaussian distribution
Abstract
In the basic Artificial Bee Colony (ABC) algorithm, if the fitness value associated with a food source is not improved for a certain number of specified trials then the corresponding bee becomes a scout to which a random value is assigned for finding the new food source. Basically, it is a mechanism of pulling out the candidate solution which may be entrapped in some local optimizer due to which its value is not improving. In the present study, we propose two new mechanisms for the movements of scout bees. In the first method, the scout bee follows a non-linear interpolated path while in the second one, scout bee follows Gaussian movement. Numerical results and statistical analysis of benchmark unconstrained, constrained and real life engineering design problems indicate that the proposed modifications enhance the performance of ABC.
Cite This Paper
Tarun Kumar Sharma, Millie Pant, "Improvised Scout Bee Movements in Artificial Bee Colony", International Journal of Modern Education and Computer Science (IJMECS), vol.6, no.1, pp.1-16, 2014. DOI:10.5815/ijmecs.2014.01.01
Reference
[1]Karaboga D, (2005). An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Kayseri, Turkey: Erciyes University.
[2]Karaboga D, Basturk B. (2007). A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization; 39:171–459.
[3]Karaboga D, Basturk B. (2008). On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing; 8:687–97.
[4]Singh A. (2009) an artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Applied Soft Computing; 9:625–31.
[5]Kang F, et al. (2009). Structural inverse analysis by hybrid simplex artificial bee colony algorithms. Computers & Structures; 87:861–70.
[6]Sam rat L, et al.(2010). Artificial bee colony algorithm for small signal model parameter extraction of MESFET. Engineering Applications of Artificial Intelligence; 11:1573–2916.
[7]Sharma TK, Pant M and Singh M. (2013). Nature Inspired Metaheuristic Techniques as Powerful Optimizers in Paper Industry, Materials and Manufacturing Processes, Taylor and Francis, 28(7), pp. 788 - 802.
[8]Sharma TK and Pant Mille (2013). Enhancing the Food Locations in an Artificial Bee Colony Algorithm, Soft Computing, Springer, 17(10), pp. 1939 - 1965.
[9]Storn R, Price K. (2010). Differential evolution–A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization; 23:689–94.
[10]Storn R. and Price K. V. (1997). Differential Evolution —a simple and efficient heuristic for global optimization over continuous spaces, J. Global Optimization, vol. 11, pp. 341–359, (1997).
[11]Eberhart, R., Kennedy, J. (1995). Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, November, pp.1114–1121.
[12]Zhu GP, Kwong S. (2010). Gbest-guided artificial bee colony algorithm for numerical function optimization. Applied Mathematics and Computation, doi:10.1016/j.amc.2010.08.049.
[13]Akay, D. Karaboga, D. (2010). A modified Artificial Bee Colony algorithm for real-parameter optimization, Information Science, doi:10.1016/j.ins.2010.07.015.
[14]Alatas B. (2010). Chaotic bee colony algorithms for global numerical optimization. Expert Systems with Applications, 37:5682–7.
[15]Sharma, T.K. and Pant, M. (2011). Enhancing Scout Bee Movements in Artificial Bee Colony Algorithm. In Proc. of SocProS - 2011, December 20-22, 2011 Advances in Intelligent and Soft Computing, Springer Berlin Heidelberg Volume 130, 2012, pp 601-610.Roorkee, India.
[16]Subotic, Milos. (2011). Artificial bee colony algorithm with multiple onlookers for constrained optimization problems. In Proceedings of the European Computing Conference, pp: 251-256.
[17]Michalewicz, Z., Schopenhauer, M. (1996). Evolutionary algorithms for constrained parameter optimization problems, Evolutionary Computation. Vol. 4, No. 1, pp. 1–32.
[18]Karin Zielinski and Rainer Laur. (2006). Constrained Single-Objective Optimization Using Particle Swarm Optimization. IEEE Congress on Evolutionary Computation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-21, pp. 443 – 450.
[19]Angel E. Mu˜noz-Zavala, Arturo Hern´andez-Aguirre, Enrique R. Villa-Diharce and Salvador Botello-Rionda. (2006). ―PESO+ for Constrained Optimization‖ IEEE Congress on Evolutionary Computation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-21, pp. 231 – 238.
[20]Beightler C., Phillips D. (1976). Applied geometric programming. John Wiley and Sons, New York.
[21]Prasad B., Saini J. (1991). Optimal thermo hydraulic performance of artificially roughened solar air heater. Journal Solar Energy, 47: 91– 96.
[22]Babu B. (2004).New optimization techniques in engineering. Springer-Verlag, Berlin Heidelberg.
[23]Chakraborthy U., Das S., Konar A. (2006). Differential evolution with local neighbourhood. IEEE Congress on Evolutionary Computation, Canada, pp. 2042 – 2049.