Abstract
Solving optimization problems can be achieved by many optimization algorithms. Swarm algorithms are part of these optimizations algorithms which based on community-based thinking. Bio-inspired algorithms are these algorithms that are artificially inspired from natural biological systems. Artificial Bee colony algorithm is a modern swarm intelligence algorithm inspired by real bees foraging behavior, and real bees’ community communication techniques. This chapter discusses Artificial bee colony algorithm (ABC) and other algorithms that are driven from it such as “Adaptive Artificial Bee Colony” (AABC), “Fast mutation artificial bee colony” (FMABC), and “Integrated algorithm based on ABC and PSO” (IABAP). Comparisons between these algorithms and previous experiments results are mentioned.
The chapter presents some case studies of ABC like traveling salesman problem, job scheduling problems, and software testing. The study discusses the conceptual modeling of ABC in these case studies.
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
Barvinok, A., Tamir, A., Fekete, S.P., Woeginger, G.J., Johnson, D.S., Woodroofe, R.: The Geometric Maximum Traveling Salesman Problem. Journal of the ACM 50(5), 641–664 (2003)
Rekaby, A., Youssif, A.A., Sharaf Eldin, A.: Introducing Adaptive Artificial Bee Colony Algorithm and Using It in Solving Traveling Salesman Problem. In: An International Conference of Science and Information (SAI), London, UK. IEEE (October 2013)
Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing 8, 687–697 (2008)
Karaboga, D., Akay, B.: A Comparative Study of Artificial Bee Colony Algorithm. Applied Mathematics and Computation Journal, 108–132 (2009)
Jones, K.O., Bouffet, A.: Comparison of Bees Algorithm, Ant Colony Optimisation and Particle Swarm Optimisation for Pid Controller Tuning. In: International Conference on Computer Systems and Technologies, CompSysTech 2008 (2008)
Wang, L., Zhou, G., Xu, Y., Wang, S., Liu, M.: An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int. J. Adv. Manuf. Technol. (September 2011)
Wong, L.-P., Low, M.Y.H., Chong, C.S.: A Bee Colony Optimization Algorithm for Traveling Salesman Problem. In: Second Asia International Conference on Modelling & Simulation, pp. 818–823. IEEE (2008)
Fatih Tasgetiren, M., Suganthan, P.N., Pan, Q.-K.: A Discrete Particle Swarm Optimi-zation Algorithm for the Generalized Traveling Salesman Problem. In: GECCO 2007. ACM (2007)
Brown, P.: http://www.scilogs.com/from_the_lab_bench/super-hero-experiment-2-the-waggle-dance/ (October 19, 2013)
Arora, S.: Polynomial Time Approximation Schemes for Euclidean Traveling Sa-lesman and Other Geometric Problems. Journal of the ACM 45(5), 753–782 (1998)
Dahiya, S.S., Chhabra, J.K., Kumar, S.: Application of Artificial Bee Colony Algorithm to Software Testing. In: 21st Australian Software Engineering Conference. IEEE (2010)
Bi, X., Wang, Y.: An Improved Artificial Bee Colony Algorithm. In: 3rd International Conference on Computer Research and Development (ICCRD). IEEE (2011)
Shi, X., Li, Y., Li, H., Guan, R., Wang, L., Liang, Y.: An Integrated Algorithm Based on Artificial Bee Colony and Particle Swarm Optimization. In: Sixth International Conference on Natural Computation (ICNC 2010) (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Rekaby, A. (2014). Different Artificial Bee Colony Algorithms and Relevant Case Studies. In: Chen, L., Kapoor, S., Bhatia, R. (eds) Intelligent Systems for Science and Information. Studies in Computational Intelligence, vol 542. Springer, Cham. https://doi.org/10.1007/978-3-319-04702-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-04702-7_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04701-0
Online ISBN: 978-3-319-04702-7
eBook Packages: EngineeringEngineering (R0)