×

Artificial bee colony algorithm based on adaptive neighborhood topologies. (English) Zbl 07825492

Summary: During the past few years, many neighborhood-based ABC variants have been developed to utilize the valuable information of neighbors for guiding searches instead of using the best individual or elite individuals. However, neighbor selection is determined by the neighborhood topology, and different neighborhood topologies are suitable for different problems. Unfortunately, previous neighborhood-based ABC variants have often used a single type of neighborhood topology, which significantly affects algorithm performance. Hence, to take advantage of different neighborhood topologies, we propose a new neighborhood-based ABC variant using adaptive neighborhood topologies, called ABC-ANT. In ABC-ANT, to determine which type of neighborhood topology should be selected, the fitness distance correlation technique is first used to identify the feature of the fitness landscape for a given problem. Then, according to the identified feature, the most suitable neighborhood topology is adaptively selected, which is beneficial to adapt the search to the fitness landscape. Moreover, in ABC-ANT, the scout bee phase is modified by developing a dual-elite search strategy to save the search experience. Extensive experiments are conducted on two test suites, i.e., CEC2013 and CEC2017, and one real-world optimization problem, i.e., the dynamic economic dispatch problem. Seven ABC variants and six non-ABC variants are included in the performance comparison. The results verify that ABC-ANT has very competitive performance.

MSC:

68-XX Computer science

Software:

CEC 13
Full Text: DOI

References:

[1] Wang, F.; Li, Y.; Zhou, A.; Tang, K., An estimation of distribution algorithm for mixed-variable newsvendor problems, IEEE Transactions on Evolutionary Computation, 24, 3, 479-493 (2019)
[2] Zhan, Z.-H.; Shi, L.; Tan, K. C.; Zhang, J., A survey on evolutionary computation for complex continuous optimization, Artificial Intelligence Review, 55, 1, 59-110 (2022)
[3] D’Angelo, G.; Palmieri, F., Gga: A modified genetic algorithm with gradient-based local search for solving constrained optimization problems, Information Sciences, 547, 136-162 (2021) · Zbl 1475.68477
[4] Zeng, Z.; Zhang, M.; Zhang, H.; Hong, Z., Improved differential evolution algorithm based on the sawtooth-linear population size adaptive method, Information Sciences, 608, 1045-1071 (2022)
[5] Wang, F.; Zhang, H.; Zhou, A., A particle swarm optimization algorithm for mixed-variable optimization problems, Swarm and Evolutionary Computation, 60, Article 100808 pp. (2021)
[6] Zhou, X.; Wu, Y.; Zhong, M.; Wang, M., Artificial bee colony algorithm based on multiple neighborhood topologies, Applied Soft Computing, 111, Article 107697 pp. (2021)
[7] Karaboga, D.; Gorkemli, B.; Ozturk, C.; Karaboga, N., A comprehensive survey: Artificial bee colony (ABC) algorithm and applications, Artificial Intelligence Review, 42, 1, 21-57 (2014)
[8] Zhang, M.; Palade, V.; Wang, Y.; Ji, Z., Attention-based word embeddings using artificial bee colony algorithm for aspect-level sentiment classification, Information Sciences, 545, 713-738 (2021)
[9] Zhou, X.; Liu, Y.; Wan, J.; Wang, M., Modified multi-strategy artificial bee colony algorithm for optimising node coverage problem, International Journal of Wireless and Mobile Computing, 19, 3, 292-301 (2020)
[10] Nekoei, M.; Moghaddas, S. A.; Golafshani, E. M.; Gandomi, A. H., Introduction of ABCEP as an automatic programming method, Information Sciences, 545, 575-594 (2021)
[11] Akay, B.; Karaboga, D.; Gorkemli, B.; Kaya, E., A survey on the artificial bee colony algorithm variants for binary, integer and mixed integer programming problems, Applied Soft Computing, 106, Article 107351 pp. (2021)
[12] Zhou, X.; Lu, J.; Huang, J.; Zhong, M.; Wang, M., Enhancing artificial bee colony algorithm with multi-elite guidance, Information Sciences, 543, 242-258 (2021) · Zbl 1475.68364
[13] Peng, H.; Deng, C.; Wu, Z., Best neighbor-guided artificial bee colony algorithm for continuous optimization problems, Soft Computing, 23, 18, 8723-8740 (2019)
[14] Zhang, M.; Tian, N.; Palade, V.; Ji, Z.; Wang, Y., Cellular artificial bee colony algorithm with gaussian distribution, Information Sciences, 462, 374-401 (2018) · Zbl 1440.68350
[15] Wang, H.; Wang, W.; Xiao, S.; Cui, Z.; Xu, M.; Zhou, X., Improving artificial bee colony algorithm using a new neighborhood selection mechanism, Information Sciences, 527, 227-240 (2020)
[16] Zhu, G.; Kwong, S., Gbest-guided artificial bee colony algorithm for numerical function optimization, Applied Mathematics and Computation, 217, 7, 3166-3173 (2010) · Zbl 1204.65074
[17] Zhou, X.; Wu, Z.; Wang, H.; Rahnamayan, S., Gaussian bare-bones artificial bee colony algorithm, Soft Computing, 20, 3, 907-924 (2016)
[18] Aslan, S.; Badem, H.; Karaboga, D., Improved quick artificial bee colony (iqabc) algorithm for global optimization, Soft Computing, 23, 24, 13161-13182 (2019)
[19] Wang, H.; Wu, Z.; Rahnamayan, S.; Sun, H.; Liu, Y.; Pan, J., Multi-strategy ensemble artificial bee colony algorithm, Information Sciences, 279, 587-603 (2014) · Zbl 1354.68242
[20] Xue, Y.; Jiang, J.; Zhao, B.; Ma, T., A self-adaptive artificial bee colony algorithm based on global best for global optimization, Soft Computing, 22, 9, 2935-2952 (2018)
[21] Chen, X.; Tianfield, H.; Li, K., Self-adaptive differential artificial bee colony algorithm for global optimization problems, Swarm and Evolutionary Computation, 45, 70-91 (2019)
[22] Xiao, S.; Wang, H.; Wang, W.; Huang, Z.; Zhou, X.; Xu, M., Artificial bee colony algorithm based on adaptive neighborhood search and gaussian perturbation, Applied Soft Computing, 100, Article 106955 pp. (2021)
[23] Gao, W.; Liu, S.; Huang, L., A novel artificial bee colony algorithm based on modified search equation and orthogonal learning, IEEE Transaction on Cybernetics, 43, 3, 1011-1024 (2013)
[24] Jadon, S. S.; Tiwari, R.; Sharma, H.; Bansal, J. C., Hybrid artificial bee colony algorithm with differential evolution, Applied Soft Computing, 58, 11-24 (2017)
[25] Zhang, X.; Lou, Y.; Yuen, S. Y.; Wu, Z.; He, Y.; Zhang, X., Hybrid artificial bee colony with covariance matrix adaptation evolution strategy for economic load dispatch, in, (IEEE Congress on Evolutionary Computation (2019), IEEE), 204-209
[26] Gao, W.; Wei, Z.; Luo, Y.; Cao, J., Artificial bee colony algorithm based on parzen window method, Applied Soft Computing, 74, 679-692 (2019)
[27] Malan, K. M.; Engelbrecht, A. P., A survey of techniques for characterising fitness landscapes and some possible ways forward, Information Sciences, 241, 148-163 (2013)
[28] Zhou, X.; Song, J.; Wu, S.; Ni, W.; Wang, M., Fitness landscape analysis: From problem understanding to design of evolutionary algorithms, in, (International Conference on Bio-Inspired Computing: Theories and Applications (2021), Springer), 281-293
[29] Jones, T.; Forrest, S., Fitness distance correlation as a measure of problem difficulty for genetic algorithms, (International Conference on Genetic Algorithms, vol. 95 (1995)), 184-192
[30] Tomassini, M.; Vanneschi, L.; Collard, P.; Clergue, M., A study of fitness distance correlation as a difficulty measure in genetic programming, Evolutionary Computation, 13, 2, 213-239 (2005)
[31] Lu, G.; Li, J.; Yao, X., Fitness-probability cloud and a measure of problem hardness for evolutionary algorithms, (European Conference on Evolutionary Computation in Combinatorial Optimization (2011), Springer), 108-117
[32] Muñoz, M. A.; Sun, Y.; Kirley, M.; Halgamuge, S. K., Algorithm selection for black-box continuous optimization problems: A survey on methods and challenges, Information Sciences, 317, 224-245 (2015)
[33] Zou, F.; Chen, D.; Liu, H.; Cao, S.; Ji, X.; Zhang, Y., A survey of fitness landscape analysis for optimization, Neurocomputing, 503, 129-139 (2022)
[34] Rosé, H.; Ebeling, W.; Asselmeyer, T., The density of states-a measure of the difficulty of optimisation problems, (International Conference on Parallel Problem Solving from Nature (1996), Springer), 208-217
[35] R. Morgan, M. Gallagher, Length scale for characterising continuous optimization problems, in: International Conference on Parallel Problem Solving from Nature, Springer, 2012, pp. 407-416.
[36] 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 (2013).
[37] C.L. Müller, I.F. Sbalzarini, Global characterization of the CEC 2005 fitness landscapes using fitness-distance analysis, in: European Conference on the Applications of Evolutionary Computation, Springer, 2011, pp. 294-303.
[38] N.H. Awad, M.Z. Ali, P.N. Suganthan, J.J. Liang, B.Y. Qu, Problem definitions and evaluation criteria for the CEC 2017 special session and competition on single objective real-parameter numerical optimization, Tech. rep., School of EEE, Nanyang Technological University, Singapore and School of Computer Information Systems, Jordan University of Science and Technology, Jordan and School of Electrical Engineering, Zhengzhou University, Zhengzhou, China (2016).
[39] García, S.; Molina, D.; Lozano, M.; Herrera, F., A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization, Journal of Heuristics, 15, 6, 617-644 (2009) · Zbl 1191.68828
[40] Zhou, X.; Wang, H.; Wang, M.; Wan, J., Enhancing the modified artificial bee colony algorithm with neighborhood search, Soft Computing, 21, 10, 2733-2743 (2017)
[41] Hansen, N.; Ostermeier, A., Completely derandomized self-adaptation in evolution strategies, Evolutionary Computation, 9, 2, 159-195 (2001)
[42] García-Martínez, C.; Lozano, M.; Herrera, F.; Molina, D.; Sánchez, A. M., Global and local real-coded genetic algorithms based on parent-centric crossover operators, European Journal of Operational Research, 185, 3, 1088-1113 (2008) · Zbl 1146.90532
[43] Guo, S.-M.; Yang, C.-C., Enhancing differential evolution utilizing eigenvector-based crossover operator, IEEE Transactions on Evolutionary Computation, 19, 1, 31-49 (2014)
[44] Xia, X.; Gui, L.; Zhang, Y.; Xu, X.; Yu, F.; Wu, H.; Wei, B.; He, G.; Li, Y.; Li, K., A fitness-based adaptive differential evolution algorithm, Information Sciences, 549, 116-141 (2021) · Zbl 1474.68481
[45] Yousri, D.; Allam, D.; Eteiba, M.; Suganthan, P. N., Static and dynamic photovoltaic models’ parameters identification using chaotic heterogeneous comprehensive learning particle swarm optimizer variants, Energy Conversion and Management, 182, 546-563 (2019)
[46] Liu, W.; Wang, Z.; Yuan, Y.; Zeng, N.; Hone, K.; Liu, X., A novel sigmoid-function-based adaptive weighted particle swarm optimizer, IEEE Transactions on Cybernetics, 51, 2, 1085-1093 (2021)
[47] Das, S.; Suganthan, P. N., Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems (2010), Jadavpur University, Nanyang Technological University: Jadavpur University, Nanyang Technological University v, Tech. rep.
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.