Welcome to the InfoSci Platform
Reference Hub9
Dynamic Swarm Artificial Bee Colony Algorithm

Dynamic Swarm Artificial Bee Colony Algorithm

Harish Sharma, Jagdish Chand Bansal, K. V. Arya, Kusum Deep
Copyright: © 2012 |Volume: 3 |Issue: 4 |Pages: 15
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781466610743|DOI: 10.4018/jaec.2012100102
Cite Article Cite Article

MLA

Sharma, Harish, et al. "Dynamic Swarm Artificial Bee Colony Algorithm." IJAEC vol.3, no.4 2012: pp.19-33. http://doi.org/10.4018/jaec.2012100102

APA

Sharma, H., Bansal, J. C., Arya, K. V., & Deep, K. (2012). Dynamic Swarm Artificial Bee Colony Algorithm. International Journal of Applied Evolutionary Computation (IJAEC), 3(4), 19-33. http://doi.org/10.4018/jaec.2012100102

Chicago

Sharma, Harish, et al. "Dynamic Swarm Artificial Bee Colony Algorithm," International Journal of Applied Evolutionary Computation (IJAEC) 3, no.4: 19-33. http://doi.org/10.4018/jaec.2012100102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Artificial Bee Colony (ABC) optimization algorithm is relatively a simple and recent population based probabilistic approach for global optimization. ABC has been outperformed over some Nature Inspired Algorithms (NIAs) when tested over test problems as well as real world optimization problems. This paper presents an attempt to modify ABC to make it less susceptible to stick at local optima and computationally efficient. In the case of local convergence, addition of some external potential solutions may help the swarm to get out of the local valley and if the algorithm is taking too much time to converge then deletion of some swarm members may help to speed up the convergence. Therefore, in this paper a dynamic swarm size strategy in ABC is proposed. The proposed strategy is named as Dynamic Swarm Artificial Bee Colony algorithm (DSABC). To show the performance of DSABC, it is tested over 16 global optimization problems of different complexities and a popular real world optimization problem namely Lennard-Jones potential energy minimization problem. The simulation results show that the proposed strategies outperformed than the basic ABC and three recent variants of ABC, namely, the Gbest-Guided ABC, Best-So-Far ABC and Modified ABC.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.