×

Enhancing artificial bee colony algorithm with multi-elite guidance. (English) Zbl 1475.68364

Summary: Artificial bee colony (ABC) algorithm is a relatively new paradigm of swarm intelligence based optimization technique, which has attracted a lot of attention for its simple structure and good performance. For some complex optimization problems, however, the performance of ABC is challenged due to its solution search equation that has strong explorative ability but poor exploitative ability. To solve this defect, in this work, we propose an improved ABC algorithm by using multi-elite guidance, which has the benefits of utilizing valuable information from elite individuals to guide search while without losing population diversity. First, we construct an elite group by selecting some elite individuals, and then introduce two improved solution search equations into the employed bee phase and onlooker bee phase based on the elite group, respectively. Last, we develop a modified neighborhood search operator by utilizing the elite group as well, which aims to achieve a better tradeoff between explorative and exploitative abilities. To verify our approach, 50 well-known test functions and one real-world optimization problem are used in the experiments, including 22 scalable basic test functions and 28 complex CEC2013 test functions. Seven different well-established ABC variants are involved in the comparison and the results show that our approach can achieve better or at least comparable performance on most of the test functions.

MSC:

68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90C59 Approximation methods and heuristics in mathematical programming

Software:

ElementRank; ABC; CEC 13
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Karafotias, G.; Hoogendoorn, M.; Eiben, Á. E., Parameter control in evolutionary algorithms: trends and challenges, IEEE Trans. Evol. Comput., 19, 2, 167-187 (2014)
[2] Wang, Z.-J.; Zhan, Z.-H.; Zhang, J., Solving the energy efficient coverage problem in wireless sensor networks: a distributed genetic algorithm approach with hierarchical fitness evaluation, Energies, 11, 12, 3526 (2018)
[3] Ma, Y.-N.; Gong, Y.-J.; Xiao, C.-F.; Gao, Y.; Zhang, J., Path planning for autonomous underwater vehicles: an ant colony algorithm incorporating alarm pheromone, IEEE Trans. Veh. Technol., 68, 1, 141-154 (2018)
[4] Yang, Z.; Qiu, H.; Gao, L.; Cai, X.; Jiang, C.; Chen, L., Surrogate-assisted classification-collaboration differential evolution for expensive constrained optimization problems, Inf. Sci., 508, 50-63 (2020) · Zbl 1456.90161
[5] Peng, H.; Guo, Z.; Deng, C.; Wu, Z., Enhancing differential evolution with random neighbors based strategy, J. Comput. Sci., 26, 501-511 (2018)
[6] Peng, H.; Wu, Z., Heterozygous differential evolution with taguchi local search, Soft. Comput., 19, 11, 3273-3291 (2015)
[7] Liu, W.; Wang, Z.; Liu, X.; Zeng, N.; Bell, D., A novel particle swarm optimization approach for patient clustering from emergency departments, IEEE Trans. Evol. Comput., 23, 4, 632-644 (2018)
[8] Wang, F.; Zhang, H.; Li, K.; Lin, Z.; Yang, J.; Shen, X.-L., A hybrid particle swarm optimization algorithm using adaptive learning strategy, Inf. Sci., 436, 162-177 (2018)
[9] Wang, H.; Zhou, X.; Sun, H.; Yu, X.; Zhao, J.; Zhang, H.; Cui, L., Firefly algorithm with adaptive control parameters, Soft Comput., 21, 17, 5091-5102 (2017)
[10] Wang, H.; Wang, W.; Zhou, X.; Sun, H.; Zhao, J.; Yu, X.; Cui, Z., Firefly algorithm with neighborhood attraction, Inf. Sci., 382, 374-387 (2017)
[11] Karaboga, D.; Gorkemli, B.; Ozturk, C.; Karaboga, N., A comprehensive survey: artificial bee colony (abc) algorithm and applications, Artif. Intell. Rev., 42, 1, 21-57 (2014)
[12] Karaboga, D.; Basturk, B., A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm, J. Global Optim., 39, 3, 459-471 (2007) · Zbl 1149.90186
[13] Karaboga, D.; Basturk, B., On the performance of artificial bee colony (ABC) algorithm, Appl. Soft Comput., 8, 1, 687-697 (2008)
[14] F. Wang, Y. Li, A. Zhou, K. Tang, An estimation of distribution algorithm for mixed-variable newsvendor problems, IEEE Trans. Evol. Comput.
[15] Wang, F.; Li, Y.; Zhang, H.; Hu, T.; Shen, X.-L., An adaptive weight vector guided evolutionary algorithm for preference-based multi-objective optimization, Swarm Evol. Comput., 49, 220-233 (2019)
[16] Xu, F.; Li, H.; Pun, C.-M.; Hu, H.; Li, Y.; Song, Y.; Gao, H., A new global best guided artificial bee colony algorithm with application in robot path planning, Appl. Soft Comput., 1-31 (2020)
[17] Gao, W.; Sheng, H.; Wang, J.; Wang, S., Artificial bee colony algorithm based on novel mechanism for fuzzy portfolio selection, IEEE Trans. Fuzzy Syst., 27, 5, 966-978 (2018)
[18] Sundar, S.; Suganthan, P. N.; Jin, C. T.; Xiang, C. T.; Soon, C. C., A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint, Soft. Comput., 21, 5, 1193-1202 (2017)
[19] Bose, D.; Biswas, S.; Vasilakos, A. V.; Laha, S., Optimal filter design using an improved artificial bee colony algorithm, Inf. Sci., 281, 443-461 (2014)
[20] Zhou, J.; Yao, X.; Chan, F. T.; Lin, Y.; Jin, H.; Gao, L.; Wang, X., An individual dependent multi-colony artificial bee colony algorithm, Inf. Sci., 485, 114-140 (2019)
[21] Aslan, S.; Badem, H.; Karaboga, D., Improved quick artificial bee colony (iqabc) algorithm for global optimization, Soft. Comput., 23, 24, 13161-13182 (2019)
[22] Lin, Q.; Zhu, M.; Li, G.; Wang, W.; Cui, L.; Chen, J.; Lu, J., A novel artificial bee colony algorithm with local and global information interaction, Appl. Soft Comput., 62, 702-735 (2018)
[23] Zhang, M.; Tian, N.; Palade, V.; Ji, Z.; Wang, Y., Cellular artificial bee colony algorithm with gaussian distribution, Inf. Sci., 462, 374-401 (2018) · Zbl 1440.68350
[24] Bajer, D.; Zorić, B., An effective refined artificial bee colony algorithm for numerical optimisation, Inf. Sci., 504, 221-275 (2019) · Zbl 1453.90187
[25] Kumar, D.; Mishra, K., Co-variance guided artificial bee colony, Appl. Soft Comput., 70, 86-107 (2018)
[26] Xue, Y.; Jiang, J.; Zhao, B.; Ma, T., A self-adaptive artificial bee colony algorithm based on global best for global optimization, Soft. Comput., 22, 9, 2935-2952 (2018)
[27] Cui, L.; Li, G.; Zhu, Z.; Lin, Q.; Wen, Z.; Lu, N.; Wong, K.-C.; Chen, J., A novel artificial bee colony algorithm with an adaptive population size for numerical function optimization, Inf. Sci., 414, 53-67 (2017) · Zbl 1435.90153
[28] Zhu, G.; Kwong, S., Gbest-guided artificial bee colony algorithm for numerical function optimization, Appl. Math. Comput., 217, 7, 3166-3173 (2010) · Zbl 1204.65074
[29] Akay, B.; Karaboga, D., A modified artificial bee colony algorithm for real-parameter optimization, Inf. Sci., 192, 120-142 (2012)
[30] Zhou, X.; Wu, Z.; Wang, H.; Rahnamayan, S., Gaussian bare-bones artificial bee colony algorithm, Soft. Comput., 20, 3, 907-924 (2016)
[31] Yu, W.-J.; Zhan, Z.-H.; Zhang, J., Artificial bee colony algorithm with an adaptive greedy position update strategy, Soft. Comput., 22, 2, 437-451 (2018)
[32] Gao, W.; Liu, S., A modified artificial bee colony algorithm, Comput. Oper. Res., 39, 3, 687-697 (2012) · Zbl 1251.90006
[33] Wang, H.; Wu, Z.; Rahnamayan, S.; Sun, H.; Liu, Y.; Pan, J.-S., Multi-strategy ensemble artificial bee colony algorithm, Inf. Sci., 279, 587-603 (2014) · Zbl 1354.68242
[34] Kiran, M. S.; Hakli, H.; Gunduz, M.; Uguz, H., Artificial bee colony algorithm with variable search strategy for continuous optimization, Inf. Sci., 300, 140-157 (2015)
[35] 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, 1012-1044 (2016)
[36] Zhou, X.; Wang, H.; Wang, M.; Wan, J., Enhancing the modified artificial bee colony algorithm with neighborhood search, Soft. Comput., 21, 10, 2733-2743 (2017)
[37] Lu, J.; Zhou, X.; Ma, Y.; Wang, M., An elite group guided artificial bee colony algorithm with a modified neighborhood search, in, (The 15th Pacific Rim International Conference on Artificial Intelligence (2018), Springer), 387-394
[38] Gao, W.; Liu, S.; Huang, L., A novel artificial bee colony algorithm based on modified search equation and orthogonal learning, IEEE Trans. Cybern., 43, 3, 1011-1024 (2013)
[39] Wang, H.; Sun, H.; Li, C.; Rahnamayan, S.; Pan, J.-S., Diversity enhanced particle swarm optimization with neighborhood search, Inf. Sci., 223, 119-135 (2013)
[40] J. Liang, B. Qu, P. Suganthan, A.G. Hernández-Díaz, Problem definitions and evaluation criteria for the cec 2013 special session on real-parameter optimization, Tech. Rep. 34, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Nanyang Technological University, Singapore, Technical Report, 2013.
[41] Das, S.; Suganthan, P., Problem Definitions and Evaluation Criteria for CEC 2011 Competition on Testing Evolutionary Algorithms on Real World Optimization Problems (2011), Jadavpur University and Nanyang Technological University, (Tech. rep.)
[42] 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)
[43] Pan, W.; Li, B.; Liu, J.; Ma, Y.; Hu, B., Analyzing the structure of java software systems by weighted k-core decomposition, Future Gen. Comput. Syst., 83, 431-444 (2018)
[44] W. Pan, H. Ming, C. Chang, Z. Yang, D.-K. Kim, Elementrank: ranking java software classes and packages using a multilayer complex network-based approach, IEEE Trans. Software Eng.
[45] Pan, W.; Song, B.; Li, K.; Zhang, K., Identifying key classes in object-oriented software using generalized k-core decomposition, Future Gen. Comput. Syst., 81, 188-202 (2018)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.