Abstract
Artificial bee colony (ABC) algorithm has been shown good performance over many optimization problems. For some complex optimization problems, however, ABC often suffers from a slow convergence speed, because it is good at exploration but poor at exploitation. To achieve a better tradeoff between the exploration and exploitation capabilities, we introduce the breadth-first search (BFS) framework and depth-first search (DFS) framework into different phases of ABC respectively. The BFS framework is combined with the employed bee phase to focus on the exploration, while the DFS framework is integrated into the onlooker bee phase to concentrate on exploitation. After that, an elite neighborhood learning (ENL) strategy is proposed to enhance the information exchange between the employed bee phase and the onlooker bee phase, because in ABC the employed bees cannot well communicate with the onlooker bees which may also cause slow convergence speed. Extensive experiments are conducted on 22 well-known test functions, and six well-established ABC variants are included in the comparison. The results showed that our approach can effectively accelerate the convergence speed and significantly perform better on the majority of test functions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Karaboga D.: An Idea Based on Honey Bee Swarm for Numerical Optimization (2005)
Zhu, G., Kwong, S.: Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl. Math. Comput. 217(7), 3166–3173 (2010)
Gao, W., Liu, S.: A modified artificial bee colony algorithm. Comput. Oper. Res. 39(3), 687–697 (2012)
Yu, W., Zhan, Z., Zhang, J.: Artificial bee colony algorithm with an adaptive greedy position update strategy. Soft. Comput. 22(17), 1–15 (2016)
Zhou, X., Wu, Z., Wang, H., Rahnamayan, S.: Gaussian bare-bones artificial bee colony algorithm. Soft. Comput. 20(3), 907–924 (2016)
Cui, L., Li, G., Lin, Q., Du, Z., Gao, W., Chen, J., Lu, N.: A novel artificial bee colony algorithm with depth-first search framework and elite-guided search equation. Inf. Sci. 367–368, 1012–1044 (2016)
Kong, D., Chang, T., Dai, W., Wang, Q., Sun, H.: An improved artificial bee colony algorithm based on elite group guidance and combined breadth-depth search strategy. Inf. Sci. 54, 442–443 (2018)
Xiang, W.L., Meng, X.L., Li, Y.Z., He, R.C., An, M.Q.: An improved artificial bee colony algorithm based on the gravity model. Inf. Sci. 429, 49–71 (2018)
Wang, H., Sun, H., Li, C., Rahnamayan, S., Pan, J.: Diversity enhanced particle swarm optimization with neighborhood search. Inf. Sci. 223(2), 119–135 (2013)
Zhou, X., Wang, H., Wang, M., Wan, J.: Enhancing the modified artificial bee colony algorithm with neighborhood search. Soft. Comput. 21(10), 1–11 (2017)
Das, S., Abraham, A., Chakraborty, U.K., Konar, A.: Differential evolution using a neighborhood-based mutation operator. IEEE Trans. Evol. Comput. 13(3), 526–553 (2009)
Gao, W., Chan, F.T.S., Huang, L., Liu, S.: Bare bones artificial bee colony algorithm with parameter adaptation and fitness-based neighborhood. Inf. Sci. 316(C), 180–200 (2015)
Acknowledgments
This work is supported by the National Natural Science Foundation of China (Nos. 61603163, 61462045 and 61562042) and the Science and Technology Foundation of Jiangxi Province (No. 20151BAB217007).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhou, X., Liu, Y., Ma, Y., Wang, M., Wan, J. (2018). Accelerating Artificial Bee Colony Algorithm with Elite Neighborhood Learning. In: Vaidya, J., Li, J. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2018. Lecture Notes in Computer Science(), vol 11334. Springer, Cham. https://doi.org/10.1007/978-3-030-05051-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-030-05051-1_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05050-4
Online ISBN: 978-3-030-05051-1
eBook Packages: Computer ScienceComputer Science (R0)