{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T04:30:37Z","timestamp":1780720237694,"version":"3.54.1"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002386","name":"Cairo University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002386","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>To develop new meta-heuristic algorithms and evaluate on the benchmark functions is the most challenging task. In this paper, performance of the various developed meta-heuristic algorithms are evaluated on the recently developed CEC 2021 benchmark functions. The objective functions are parametrized by inclusion of the operators, such as bias, shift and rotation. The different combinations of the binary operators are applied to the objective functions which leads to the CEC2021 benchmark functions. Therefore, different meta-heuristic algorithms are considered which solve the benchmark functions with different dimensions. The performance of some basic, advanced meta-heuristics algorithms and the algorithms that participated in the CEC2021 competition have been experimentally investigated and many observations, recommendations, conclusions have been reached. The experimental results show the performance of meta-heuristic algorithms on the different combinations of binary parameterized operators.<\/jats:p>","DOI":"10.1007\/s00521-022-07788-z","type":"journal-article","created":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T12:02:47Z","timestamp":1664366567000},"page":"1493-1517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":55,"title":["Evaluating the performance of meta-heuristic algorithms on CEC 2021 benchmark problems"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5895-2632","authenticated-orcid":false,"given":"Ali Wagdy","family":"Mohamed","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karam M.","family":"Sallam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prachi","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anas A.","family":"Hadi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali Khater","family":"Mohamed","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"issue":"4","key":"7788_CR1","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/0360-8352(96)00037-X","volume":"30","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z, Dasgupta D, Le Riche RG, Schoenauer M (1996) Evolutionary algorithms for constrained engineering problems. Comput Ind Eng 30(4):851\u2013870","journal-title":"Comput Ind Eng"},{"issue":"1","key":"7788_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2507\/IJSIMM14(1)4.277","volume":"14","author":"L Gusel","year":"2015","unstructured":"Gusel L, Rudolf R, Brezocnik M (2015) Genetic based approach to predicting the elongation of drawn alloy. Int J Simul Modell 14(1):39\u201347","journal-title":"Int J Simul Modell"},{"issue":"4","key":"7788_CR3","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/MCI.2011.942584","volume":"6","author":"J Zhang","year":"2011","unstructured":"Zhang J, Zhan Z-H, Lin Y, Chen N, Gong Y-J, Zhong J-H, Chung HS, Li Y, Shi Y-H (2011) Evolutionary computation meets machine learning: a survey. IEEE Comput Intell Mag 6(4):68\u201375","journal-title":"IEEE Comput Intell Mag"},{"key":"7788_CR4","unstructured":"Collange G, Delattre N, Hansen N, Quinquis I, Schoenauer M (2010) Multidisciplinary optimization in the design of future space launchers"},{"key":"7788_CR5","unstructured":"Mora AM, Squillero G (2015) Applications of evolutionary computation. In: Proceedings 18th European Conference, EvoApplications 2015, Copenhagen, Denmark, April 8-10, 2015,. Springer, vol. 9028"},{"key":"7788_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107241","volume":"228","author":"A Forestiero","year":"2021","unstructured":"Forestiero A (2021) Metaheuristic algorithm for anomaly detection in internet of things leveraging on a neural-driven multiagent system. Knowl-Based Syst 228:107241","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"7788_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2897373","volume":"11","author":"F Cicirelli","year":"2016","unstructured":"Cicirelli F, Forestiero A, Giordano A, Mastroianni C (2016) Transparent and efficient parallelization of swarm algorithms. ACM Trans Autonom Adap Syst (TAAS) 11(2):1\u201326","journal-title":"ACM Trans Autonom Adap Syst (TAAS)"},{"issue":"1","key":"7788_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1162\/EVCO_a_00134","volume":"23","author":"O Mersmann","year":"2015","unstructured":"Mersmann O, Preuss M, Trautmann H, Bischl B, Weihs C (2015) Analyzing the bbob results by means of benchmarking concepts. Evol Comput 23(1):161\u2013185","journal-title":"Evol Comput"},{"key":"7788_CR9","doi-asserted-by":"crossref","unstructured":"Hansen N, Auger A, Ros R, Finck S, Po\u0161\u00edk P (2010) Comparing results of 31 algorithms from the black-box optimization benchmarking bbob-2009. In: Proceedings of the 12th annual conference companion on Genetic and evolutionary computation, pp. 1689\u20131696","DOI":"10.1145\/1830761.1830790"},{"key":"7788_CR10","unstructured":"Hansen N, Auger A, Finck S, Ros R (2012) Real-parameter black-box optimization benchmarking: experimental setup,\u201d Orsay, France: Universit\u00e9 Paris Sud, Institut National de Recherche en Informatique et en Automatique (INRIA) Futurs, \u00c9quipe TAO. Tech, Rep"},{"key":"7788_CR11","unstructured":"Hansen N, Auger A, Mersmann O, Tusar T, Brockhoff D (2016) Coco: a platform for comparing continuous optimizers in a black-box setting. arXiv preprint arXiv:1603.08785"},{"issue":"2005","key":"7788_CR12","first-page":"2005","volume":"2005005","author":"PN Suganthan","year":"2005","unstructured":"Suganthan PN, Hansen N, Liang JJ, Deb K, Chen Y-P, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the cec 2005 special session on real-parameter optimization. KanGAL Rep 2005005(2005):2005","journal-title":"KanGAL Rep"},{"key":"7788_CR13","unstructured":"Liang J, Qu B, Suganthan P, Hern\u00e1ndez-D\u00edaz AG (2013) Problem definitions and evaluation criteria for the cec, (2013) special session and competition on real-parameter optimization. Technical Report 201212"},{"key":"7788_CR14","unstructured":"Liang J-J, Suganthan PN, Deb K (2005) Novel composition test functions for numerical global optimization. In: Proceedings, (2005) IEEE swarm intelligence symposium. SIS 2005. IEEE 2005:68\u201375"},{"key":"7788_CR15","unstructured":"Liang JJ, Qu BY, Suganthan PN (2013) Problem definitions and evaluation criteria for the cec, (2014) special session and competition on single objective real-parameter numerical optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore 635"},{"key":"7788_CR16","unstructured":"Wu G, Mallipeddi R, Suganthan PN (2017) Problem definitions and evaluation criteria for the cec 2017 competition on constrained real-parameter optimization. National University of Defense Technology, Changsha, Hunan, PR China and Kyungpook National University, Daegu, South Korea and Nanyang Technological University, Singapore, Technical Report"},{"key":"7788_CR17","unstructured":"Yue C, Price K, Suganthan P, Liang J, Ali M, Qu B, Awad N, Biswas P (2019) Problem definitions and evaluation criteria for the cec 2020 special session and competition on single objective bound constrained numerical optimization. Comput Intell Lab, Zhengzhou Univ., Zhengzhou, China, Tech. Rep, vol. 201911"},{"key":"7788_CR18","unstructured":"Mohamed A, Hadi A, Mohamed A, Agrawal P, Kumar A, Suganthan P (2020) Problem definitions and evaluation criteria for the cec 2021 special session and competition on single objective bound constrained numerical optimization. In: Tech. Rep"},{"issue":"6","key":"7788_CR19","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the cec\u20192005 special session on real parameter optimization. J Heurist 15(6):617","journal-title":"J Heurist"},{"issue":"4","key":"7788_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341\u2013359","journal-title":"J Global Optim"},{"key":"7788_CR21","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1007\/s13042-019-01053-x","volume":"11","author":"AW Mohamed","year":"2020","unstructured":"Mohamed AW, Hadi AA, Mohamed AK (2020) Gaining-sharing knowledge based algorithm for solving optimization problems: a novel nature-inspired algorithm. Int J Mach Learn Cybern 11:1501\u20131529","journal-title":"Int J Mach Learn Cybern"},{"key":"7788_CR22","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"7788_CR23","doi-asserted-by":"crossref","unstructured":"J. Kennedy and R. C. Eberhart (1997) A discrete binary version of the particle swarm algorithm. In: IEEE International conference on systems, man, and cybernetics. Computational cybernetics and simulation, 1997, vol. 5. IEEE, pp. 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"issue":"1","key":"7788_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2011.08.006","volume":"183","author":"RV Rao","year":"2012","unstructured":"Rao RV, Savsani VJ, Vakharia D (2012) Teaching-learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf Sci 183(1):1\u201315","journal-title":"Inf Sci"},{"key":"7788_CR25","doi-asserted-by":"crossref","unstructured":"Tanabe R, Fukunaga AS (2014) Improving the search performance of shade using linear population size reduction. In: IEEE congress on evolutionary computation (CEC). IEEE, 2014, pp. 1658\u20131665","DOI":"10.1109\/CEC.2014.6900380"},{"key":"7788_CR26","doi-asserted-by":"crossref","unstructured":"Mohamed AW, Hadi AA, Mohamed AK, Awad NH (2020) Evaluating the performance of adaptive gaining sharing knowledge based algorithm on cec, (2020) benchmark problems. in: 2020 IEEE congress on evolutionary computation (CEC). IEEE, pp. 1\u20138","DOI":"10.1109\/CEC48606.2020.9185901"},{"key":"7788_CR27","doi-asserted-by":"crossref","unstructured":"Kumar A, Misra RK, Singh D (2017) Improving the local search capability of effective butterfly optimizer using covariance matrix adapted retreat phase. In: IEEE congress on evolutionary computation (CEC). IEEE, 2017, pp. 1835\u20131842","DOI":"10.1109\/CEC.2017.7969524"},{"key":"7788_CR28","doi-asserted-by":"crossref","unstructured":"Sallam KM, Elsayed SM, Chakrabortty RK, Ryan MJ (2020) Improved multi-operator differential evolution algorithm for solving unconstrained problems. In: IEEE congress on evolutionary computation (CEC). IEEE, 2020, pp. 1\u20138","DOI":"10.1109\/CEC48606.2020.9185577"},{"key":"7788_CR29","doi-asserted-by":"crossref","unstructured":"Hadi AA, Mohamed AW, Jambi KM (2021) Single-objective real-parameter optimization: enhanced lshade-spacma algorithm. In: Heuristics for optimization and learning. Springer, pp. 103\u2013121","DOI":"10.1007\/978-3-030-58930-1_7"},{"key":"7788_CR30","doi-asserted-by":"crossref","unstructured":"Kadavy T, Pluhacek M, Viktorin A, Senkerik R (2021) Soma-clp for competition on bound constrained single objective numerical optimization benchmark: a competition entry on bound constrained single objective numerical optimization at the genetic and evolutionary computation conference (gecco) 2021. In: Proceedings of the genetic and evolutionary computation conference companion, pp. 11\u201312","DOI":"10.1145\/3449726.3463286"},{"key":"7788_CR31","doi-asserted-by":"crossref","unstructured":"Stanovov V, Akhmedova S, Semenkin E (2021) Nl-shade-rsp algorithm with adaptive archive and selective pressure for cec, (2021) numerical optimization. In: IEEE congress on evolutionary computation (CEC). IEEE, 2021, pp. 809\u2013816","DOI":"10.1109\/CEC45853.2021.9504959"},{"key":"7788_CR32","doi-asserted-by":"crossref","unstructured":"Brest J, Mau\u010dec MS, Bo\u0161kovi\u0107 B (2021) Self-adaptive differential evolution algorithm with population size reduction for single objective bound-constrained optimization: algorithm j21. In: IEEE congress on evolutionary computation (CEC). IEEE, 2021, pp. 817\u2013824","DOI":"10.1109\/CEC45853.2021.9504782"},{"key":"7788_CR33","doi-asserted-by":"crossref","unstructured":"Warchulski E, Arabas J (2021) A new step-size adaptation rule for cma-es based on the population midpoint fitness. In: IEEE congress on evolutionary computation (CEC). IEEE, 2021, pp. 825\u2013831","DOI":"10.1109\/CEC45853.2021.9504829"},{"key":"7788_CR34","doi-asserted-by":"crossref","unstructured":"Biswas S, Saha D, De S, Cobb AD, Das S, Jalaian BA (2021) Improving differential evolution through Bayesian hyperparameter optimization. In: IEEE congress on evolutionary computation (CEC). IEEE, 2021, pp. 832\u2013840","DOI":"10.1109\/CEC45853.2021.9504792"},{"key":"7788_CR35","doi-asserted-by":"crossref","unstructured":"Mohamed AW, Hadi AA, Agrawal P, Sallam KM, Mohamed AK (2021) Gaining-sharing knowledge based algorithm with adaptive parameters hybrid with imode algorithm for solving cec, (2021) benchmark problems. In: 2021 IEEE congress on evolutionary computation (CEC). IEEE, pp. 841\u2013848","DOI":"10.1109\/CEC45853.2021.9504814"},{"key":"7788_CR36","doi-asserted-by":"crossref","unstructured":"Bujok P, Kolenovsky P (2021) Differential evolution with distance-based mutation-selection applied to cec, (2021) single objective numerical optimisation. In: 2021 IEEE congress on evolutionary computation (CEC). IEEE, pp. 849\u2013856","DOI":"10.1109\/CEC45853.2021.9504795"},{"key":"7788_CR37","doi-asserted-by":"crossref","unstructured":"Opara KR, Hadi AA, Mohamed AW (2020) Parametrized benchmarking: an outline of the idea and a feasibility study. In: Proceedings of the 2020 genetic and evolutionary computation conference companion, pp. 197\u2013198","DOI":"10.1145\/3377929.3389944"},{"key":"7788_CR38","doi-asserted-by":"crossref","unstructured":"Mersmann O, Preuss M, Trautmann H (2010) Benchmarking evolutionary algorithms: towards exploratory landscape analysis. In: International conference on parallel problem solving from nature. Springer, pp. 73\u201382","DOI":"10.1007\/978-3-642-15844-5_8"},{"key":"7788_CR39","unstructured":"Hansen N, Finck S, Ros R, Auger A (2009) Real-parameter black-box optimization benchmarking 2009: noiseless functions definitions"},{"key":"7788_CR40","volume-title":"The elements of statistical learning","author":"J Friedman","year":"2001","unstructured":"Friedman J, Hastie T, Tibshirani R (2001) The elements of statistical learning, vol 1. Springer, New York"},{"key":"7788_CR41","first-page":"344","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"2009","unstructured":"Kaufman L, Rousseeuw PJ (2009) Finding groups in data: an introduction to cluster analysis. Wiley, New York, p 344"},{"key":"7788_CR42","doi-asserted-by":"crossref","unstructured":"Mersmann O, Bischl B, Trautmann H, Preuss M, Weihs C, Rudolph G (2011) Exploratory landscape analysis. In: Proceedings of the 13th annual conference on genetic and evolutionary computation, pp. 829\u2013836","DOI":"10.1145\/2001576.2001690"},{"issue":"3","key":"7788_CR43","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume N, Naujoks B, Emmerich M (2007) Sms-emoa: Multiobjective selection based on dominated hypervolume. Eur J Oper Res 181(3):1653\u20131669","journal-title":"Eur J Oper Res"},{"key":"7788_CR44","unstructured":"Auger A, Finck S, Hansen N, Ros R (2010) Bbob 2009: comparison tables of all algorithms on all noiseless functions"},{"key":"7788_CR45","unstructured":"Borda Jd (1784) \u201cM\u00e9moire sur les \u00e9lections au scrutin,\u201d Histoire de l\u2019Academie Royale des Sciences pour 1781 (Paris, 1784)"},{"key":"7788_CR46","doi-asserted-by":"crossref","unstructured":"Morgan R, Gallagher M (2012) Length scale for characterising continuous optimization problems. In: International conference on parallel problem solving from nature. Springer, pp. 407\u2013416","DOI":"10.1007\/978-3-642-32937-1_41"},{"key":"7788_CR47","doi-asserted-by":"crossref","unstructured":"Opara K, Arabas J (2011) Benchmarking procedures for continuous optimization algorithms. J Telecommun Inf Technol pp. 73\u201380","DOI":"10.26636\/jtit.2011.4.1180"},{"issue":"4","key":"7788_CR48","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s11081-017-9366-1","volume":"18","author":"V Beiranvand","year":"2017","unstructured":"Beiranvand V, Hare W, Lucet Y (2017) Best practices for comparing optimization algorithms. Optim Eng 18(4):815\u2013848","journal-title":"Optim Eng"},{"key":"7788_CR49","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.ins.2015.05.010","volume":"317","author":"MA Mu\u00f1oz","year":"2015","unstructured":"Mu\u00f1oz MA, Sun Y, Kirley M, Halgamuge SK (2015) Algorithm selection for black-box continuous optimization problems: a survey on methods and challenges. Inf Sci 317:224\u2013245","journal-title":"Inf Sci"},{"key":"7788_CR50","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice JR (1976) The algorithm selection problem. Adv Comput 15:65\u2013118","journal-title":"Adv Comput"},{"issue":"11","key":"7788_CR51","doi-asserted-by":"publisher","first-page":"5989","DOI":"10.1007\/s00521-020-05375-8","volume":"33","author":"P Agrawal","year":"2021","unstructured":"Agrawal P, Ganesh T, Mohamed AW (2021) A novel binary gaining-sharing knowledge-based optimization algorithm for feature selection. Neural Comput Appl 33(11):5989\u20136008","journal-title":"Neural Comput Appl"},{"key":"7788_CR52","doi-asserted-by":"publisher","first-page":"9505","DOI":"10.1007\/s00500-021-05874-3","volume":"25","author":"P Agrawal","year":"2021","unstructured":"Agrawal P, Ganesh T, Mohamed AW (2021) Chaotic gaining sharing knowledge-based optimization algorithm: an improved metaheuristic algorithm for feature selection. Soft Comput 25:9505\u20139528","journal-title":"Soft Comput"},{"key":"7788_CR53","doi-asserted-by":"crossref","unstructured":"Agrawal P, Ganesh T, Oliva D, Mohamed AW (2021) S-shaped and v-shaped gaining-sharing knowledge-based algorithm for feature selection. Appl Intell pp. 1\u201332","DOI":"10.1007\/s10489-021-02233-5"},{"key":"7788_CR54","doi-asserted-by":"crossref","unstructured":"Tanabe R, Fukunaga A (2013) Success-history based parameter adaptation for differential evolution. In: IEEE congress on evolutionary computation. IEEE, pp. 71\u201378","DOI":"10.1109\/CEC.2013.6557555"},{"key":"7788_CR55","doi-asserted-by":"crossref","unstructured":"Montgomery J, Chen S (2010) An analysis of the operation of differential evolution at high and low crossover rates. In: IEEE congress on evolutionary computation. IEEE, pp. 1\u20138","DOI":"10.1109\/CEC.2010.5586128"},{"key":"7788_CR56","doi-asserted-by":"crossref","unstructured":"Mohamed AW, Hadi AA, Fattouh AM, Jambi KM (2017) Lshade with semi-parameter adaptation hybrid with cma-es for solving cec, (2017) benchmark problems. In: 2017 IEEE congress on evolutionary computation (CEC). IEEE, pp. 145\u2013152","DOI":"10.1109\/CEC.2017.7969307"},{"key":"7788_CR57","doi-asserted-by":"crossref","unstructured":"Mohamed AW, Abutarboush HF, Hadi AA, Mohamed AK (2021) Gaining-sharing knowledge based algorithm with adaptive parameters for engineering optimization. IEEE Access, 9: 934\u2013946","DOI":"10.1109\/ACCESS.2021.3076091"},{"key":"7788_CR58","doi-asserted-by":"crossref","unstructured":"Kadavy T, Pluhacek M, Viktorin A, Senkerik R (2020) Self-organizing migrating algorithm with clustering-aided migration. In: Proceedings of the 2020 genetic and evolutionary computation conference companion, pp. 1441\u20131447","DOI":"10.1145\/3377929.3398129"},{"key":"7788_CR59","unstructured":"Mousavirad SJ, Moghadam MH, Saadatmand M, Chakrabortty RK (2021) An ordered and roulette-wheel-based mutation incorporated l-shade algorithm for solving cec2021 single objective numerical optimisation problems. In: Proceedings of the genetic and evolutionary computation conference companion, pp. 1\u20132"},{"key":"7788_CR60","doi-asserted-by":"crossref","unstructured":"Awad NH, Ali MZ, Suganthan PN, Reynolds RG (2016) An ensemble sinusoidal parameter adaptation incorporated with l-shade for solving cec2014 benchmark problems. In: IEEE congress on evolutionary computation (CEC). IEEE, 2016, pp. 2958\u20132965","DOI":"10.1109\/CEC.2016.7744163"},{"key":"7788_CR61","doi-asserted-by":"crossref","unstructured":"BrestJ, Mau\u010dec MS, Bo\u0161kovi\u0107 B (2019) The 100-digit challenge: algorithm jde100. In: 2019 IEEE congress on evolutionary computation (CEC). IEEE, pp. 19\u201326","DOI":"10.1109\/CEC.2019.8789904"},{"key":"7788_CR62","doi-asserted-by":"crossref","unstructured":"Brest J, Mau\u010dec MS, Bo\u0161kovi\u0107 B (2020) Differential evolution algorithm for single objective bound-constrained optimization: Algorithm j2020. In: IEEE congress on evolutionary computation (CEC). IEEE, 2020, pp. 1\u20138","DOI":"10.1109\/CEC48606.2020.9185551"},{"key":"7788_CR63","doi-asserted-by":"crossref","unstructured":"Bujok P (2016) Improving the convergence of differential evolution. In: International conference on numerical analysis and its applications. Springer, pp. 252\u2013260","DOI":"10.1007\/978-3-319-57099-0_26"},{"key":"7788_CR64","unstructured":"Awad N, Ali M, Liang JJ, Qu B, Suganthan P (2016) Problem definitions and evaluation criteria for the cec 2017 special session and competition on single objective real-parameter numerical optimization. In: Technical Reports"},{"issue":"1","key":"7788_CR65","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s11047-005-1625-y","volume":"5","author":"JJ Liang","year":"2006","unstructured":"Liang JJ, Baskar S, Suganthan PN, Qin AK (2006) Performance evaluation of multiagent genetic algorithm. Nat Comput 5(1):83\u201396","journal-title":"Nat Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07788-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07788-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07788-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T21:15:31Z","timestamp":1728076531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07788-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,28]]},"references-count":65,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["7788"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07788-z","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,28]]},"assertion":[{"value":"13 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}