{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T05:00:27Z","timestamp":1780290027456,"version":"3.54.0"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":55,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Artif Intell"],"DOI":"10.1007\/s44163-026-01186-3","type":"journal-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T06:38:49Z","timestamp":1775543929000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive search space scaling in self-adaptive genetic algorithms for high-dimensional global black-box optimization problems"],"prefix":"10.1007","volume":"6","author":[{"given":"Ivan P.","family":"Malashin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evgenii","family":"Sopov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vladimir","family":"Nelyub","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aleksei","family":"Borodulin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrei","family":"Gantimurov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vadim","family":"Tynchenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,7]]},"reference":[{"key":"1186_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106619","volume":"166","author":"N Nezami","year":"2024","unstructured":"Nezami N, Anahideh H. Dynamic exploration-exploitation pareto approach for high-dimensional expensive black-box optimization. Comput Oper Res. 2024;166:106619.","journal-title":"Comput Oper Res"},{"key":"1186_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105444","volume":"137","author":"H Anahideh","year":"2022","unstructured":"Anahideh H, Rosenberger J, Chen V. High-dimensional black-box optimization under uncertainty. Comput Oper Res. 2022;137:105444.","journal-title":"Comput Oper Res"},{"key":"1186_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3670683","volume":"4","author":"ML Santoni","year":"2024","unstructured":"Santoni ML, Raponi E, Leone RD, Doerr C. Comparison of high-dimensional bayesian optimization algorithms on bbob. ACM Trans Evolutionary Learn. 2024;4:1\u201333.","journal-title":"ACM Trans Evolutionary Learn"},{"key":"1186_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1109\/TEVC.2015.2444793","volume":"20","author":"J He","year":"2015","unstructured":"He J, Lin G. Average convergence rate of evolutionary algorithms. IEEE Trans Evol Comput. 2015;20:316\u201321.","journal-title":"IEEE Trans Evol Comput"},{"key":"1186_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H-G Beyer","year":"2002","unstructured":"Beyer H-G, Schwefel H-P. Evolution strategies-a comprehensive introduction. Nat Comput. 2002;1:3\u201352.","journal-title":"Nat Comput"},{"key":"1186_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1038\/s41587-023-01763-2","volume":"42","author":"BL Hie","year":"2024","unstructured":"Hie BL, et al. Efficient evolution of human antibodies from general protein language models. Nat Biotechnol. 2024;42:275\u201383.","journal-title":"Nat Biotechnol"},{"key":"1186_CR7","first-page":"949","volume":"15","author":"D Wierstra","year":"2014","unstructured":"Wierstra D, et al. Natural evolution strategies. J Mach Learn Res. 2014;15:949\u201380.","journal-title":"J Mach Learn Res"},{"key":"1186_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103479","volume":"90","author":"M Pant","year":"2020","unstructured":"Pant M, Zaheer H, Garcia-Hernandez L, Abraham A, et al. Differential evolution: a review of more than two decades of research. Eng Appl Artif Intell. 2020;90:103479.","journal-title":"Eng Appl Artif Intell"},{"key":"1186_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2010","unstructured":"Das S, Suganthan PN. Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput. 2010;15:4\u201331.","journal-title":"IEEE Trans Evol Comput"},{"key":"1186_CR10","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.3390\/app8101945","volume":"8","author":"T Eltaeib","year":"2018","unstructured":"Eltaeib T, Mahmood A. Differential evolution: a survey and analysis. Appl Sci. 2018;8:1945.","journal-title":"Appl Sci"},{"key":"1186_CR11","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R. Particle swarm optimization. In: Proceedings of ICNN\u201995-international conference on neural networks. IEEE; 1995. vol. 4, pp. 1942\u20131948.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"1186_CR12","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00500-016-2474-6","volume":"22","author":"D Wang","year":"2018","unstructured":"Wang D, Tan D, Liu L. Particle swarm optimization algorithm: an overview. Soft Comput. 2018;22:387\u2013408.","journal-title":"Soft Comput"},{"key":"1186_CR13","doi-asserted-by":"publisher","first-page":"10031","DOI":"10.1109\/ACCESS.2022.3142859","volume":"10","author":"TM Shami","year":"2022","unstructured":"Shami TM, et al. Particle swarm optimization: A comprehensive survey. Ieee Access. 2022;10:10031\u201361.","journal-title":"Ieee Access"},{"key":"1186_CR14","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.3390\/electronics10121452","volume":"10","author":"CM Castiblanco-P\u00e9rez","year":"2021","unstructured":"Castiblanco-P\u00e9rez CM, Toro-Rodr\u00edguez DE, Montoya OD, Giral-Ram\u00edrez DA. Optimal placement and sizing of d-statcom in radial and meshed distribution networks using a discrete-continuous version of the genetic algorithm. Electronics. 2021;10:1452.","journal-title":"Electronics"},{"key":"1186_CR15","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1007\/s12065-023-00822-6","volume":"17","author":"B Alhijawi","year":"2024","unstructured":"Alhijawi B, Awajan A. Genetic algorithms: Theory, genetic operators, solutions, and applications. Evol Intel. 2024;17:1245\u201356.","journal-title":"Evol Intel"},{"key":"1186_CR16","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0303088","volume":"19","author":"G Feng","year":"2024","unstructured":"Feng G. Feature selection algorithm based on optimized genetic algorithm and the application in high-dimensional data processing. PLoS ONE. 2024;19:e0303088.","journal-title":"PLoS ONE"},{"key":"1186_CR17","doi-asserted-by":"crossref","unstructured":"Lehre PK, Qin X. Self-adaptation can improve the noise-tolerance of evolutionary algorithms. In: Proceedings of the 17th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms. 2023. pp. 105\u2013116.","DOI":"10.1145\/3594805.3607128"},{"key":"1186_CR18","doi-asserted-by":"crossref","unstructured":"Semenkin E, Semenkina M. Self-configuring genetic algorithm with modified uniform crossover operator. In: International Conference in Swarm Intelligence. Springer Berlin Heidelberg, Berlin, Heidelberg; 2012. pp. 414\u2013421.","DOI":"10.1007\/978-3-642-30976-2_50"},{"key":"1186_CR19","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1613\/jair.1776","volume":"24","author":"N Samaras","year":"2005","unstructured":"Samaras N, Stergiou K. Binary encodings of non-binary constraint satisfaction problems: Algorithms and experimental results. J Artif Intell Res. 2005;24:641\u201384.","journal-title":"J Artif Intell Res"},{"key":"1186_CR20","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.ins.2010.10.001","volume":"181","author":"Y Wen","year":"2011","unstructured":"Wen Y, Xu H, Yang J. A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system. Inf Sci. 2011;181:567\u201381.","journal-title":"Inf Sci"},{"key":"1186_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s11081-010-9125-z","volume":"12","author":"X Tang","year":"2011","unstructured":"Tang X, Bassir DH, Zhang W. Shape, sizing optimization and material selection based on mixed variables and genetic algorithm. Optim Eng. 2011;12:111\u201328.","journal-title":"Optim Eng"},{"key":"1186_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100808","volume":"60","author":"F Wang","year":"2021","unstructured":"Wang F, Zhang H, Zhou A. A particle swarm optimization algorithm for mixed-variable optimization problems. Swarm Evol Comput. 2021;60:100808.","journal-title":"Swarm Evol Comput"},{"key":"1186_CR23","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TEVC.2010.2040183","volume":"14","author":"F Peng","year":"2010","unstructured":"Peng F, Tang K, Chen G, Yao X. Population-based algorithm portfolios for numerical optimization. IEEE Trans Evol Comput. 2010;14:782\u2013800.","journal-title":"IEEE Trans Evol Comput"},{"key":"1186_CR24","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.3390\/electronics9081243","volume":"9","author":"R Cecchetti","year":"2020","unstructured":"Cecchetti R, de Paulis F, Olivieri C, Orlandi A, Buecker M. Effective pcb decoupling optimization by combining an iterative genetic algorithm and machine learning. Electronics. 2020;9:1243.","journal-title":"Electronics"},{"key":"1186_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124518","volume":"255","author":"JDS Bohrer","year":"2024","unstructured":"Bohrer JDS, Dorn M. Enhancing classification with hybrid feature selection: A multi-objective genetic algorithm for high-dimensional data. Expert Syst Appl. 2024;255:124518.","journal-title":"Expert Syst Appl"},{"key":"1186_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12293-015-0173-y","volume":"8","author":"B Tran","year":"2016","unstructured":"Tran B, Xue B, Zhang M. Genetic programming for feature construction and selection in classification on high-dimensional data. Memetic Comput. 2016;8:3\u201315.","journal-title":"Memetic Comput"},{"key":"1186_CR27","doi-asserted-by":"publisher","first-page":"11415","DOI":"10.1007\/s10462-023-10412-8","volume":"56","author":"B Xu","year":"2023","unstructured":"Xu B, Heidari AA, Cai Z, Chen H. Dimensional decision covariance colony predation algorithm: global optimization and high- dimensional feature selection. Artif Intell Rev. 2023;56:11415\u201371.","journal-title":"Artif Intell Rev"},{"key":"1186_CR28","doi-asserted-by":"crossref","unstructured":"Haldar KL, Li H, Agrawal DP. A cluster-aware soft frequency reuse scheme for inter-cell interference mitigation in lte based femtocell networks. In: 2013 IEEE 14th international symposium on\" a world of wireless, mobile and multimedia networks\"(WoWMoM). IEEE; 2013. pp. 1\u20136.","DOI":"10.1109\/WoWMoM.2013.6583436"},{"key":"1186_CR29","doi-asserted-by":"crossref","unstructured":"Ko W, Suk H-I. Eeg-oriented self-supervised learning and cluster-aware adaptation. In: Proceedings of the 31st ACM international conference on information & knowledge management. 2022. pp. 4143\u20134147 .","DOI":"10.1145\/3511808.3557589"},{"key":"1186_CR30","doi-asserted-by":"publisher","first-page":"55204","DOI":"10.52202\/079017-1752","volume":"37","author":"Q Chen","year":"2024","unstructured":"Chen Q, Chen L. Decrl: A deep evolutionary clustering jointed temporal knowledge graph representation learning approach. Adv Neural Inf Process Syst. 2024;37:55204\u201327.","journal-title":"Adv Neural Inf Process Syst"},{"key":"1186_CR31","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/j.procs.2017.11.331","volume":"120","author":"A Amirjanov","year":"2017","unstructured":"Amirjanov A, Sadikoglu F. Linear adjustment of a search space in genetic algorithm. Procd Comput Sci. 2017;120:953\u201360.","journal-title":"Procd Comput Sci"},{"key":"1186_CR32","doi-asserted-by":"crossref","unstructured":"Banerjee A, Louis SJ. A recursive clustering methodology using a genetic algorithm. In: 2007 IEEE congress on evolutionary computation. IEEE; 2007. pp. 2165\u20132172.","DOI":"10.1109\/CEC.2007.4424740"},{"key":"1186_CR33","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.3390\/electronics9081295","volume":"9","author":"M Ahmed","year":"2020","unstructured":"Ahmed M, Seraj R, Islam SMS. The k-means algorithm: A comprehensive survey and performance evaluation. Electronics. 2020;9:1295.","journal-title":"Electronics"},{"key":"1186_CR34","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ins.2022.11.139","volume":"622","author":"AM Ikotun","year":"2023","unstructured":"Ikotun AM, Ezugwu AE, Abualigah L, Abuhaija B, Heming J. K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data. Inf Sci. 2023;622:178\u2013210.","journal-title":"Inf Sci"},{"key":"1186_CR35","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0255(01)00087-1","volume":"133","author":"S Tsutsui","year":"2001","unstructured":"Tsutsui S, Goldberg DE. Search space boundary extension method in real-coded genetic algorithms. Inf Sci. 2001;133:229\u201347.","journal-title":"Inf Sci"},{"key":"1186_CR36","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.eswa.2017.11.048","volume":"96","author":"A Baykaso\u011flu","year":"2018","unstructured":"Baykaso\u011flu A, Ozsoydan FB. Dynamic optimization in binary search spaces via weighted superposition attraction algorithm. Expert Syst Appl. 2018;96:157\u201374.","journal-title":"Expert Syst Appl"},{"key":"1186_CR37","doi-asserted-by":"crossref","unstructured":"Hevia\u00a0Fajardo MA, Sudholt D. Self-adjusting offspring population sizes outperform fixed parameters on the cliff function. In: Proceedings of the 16th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms. 2021. pp. 1\u201315 .","DOI":"10.1145\/3450218.3477306"},{"key":"1186_CR38","doi-asserted-by":"crossref","unstructured":"Rodzin S, Kureichik V, Rodzina L. Co-evolutionary self-adjusting optimization algorithm based on patterns of individual and collective behavior of agents. In: Computer science on-line conference. Springer; 2022. pp. 254\u2013266.","DOI":"10.1007\/978-3-031-09073-8_22"},{"key":"1186_CR39","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1109\/TEVC.2006.880727","volume":"11","author":"J Zhang","year":"2007","unstructured":"Zhang J, Chung HS-H, Lo W-L. Clustering-based adaptive crossover and mutation probabilities for genetic algorithms. IEEE Trans Evol Comput. 2007;11:326\u201335.","journal-title":"IEEE Trans Evol Comput"},{"key":"1186_CR40","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ins.2013.01.005","volume":"233","author":"OA Abdul-Rahman","year":"2013","unstructured":"Abdul-Rahman OA, Munetomo M, Akama K. An adaptive parameter binary-real coded genetic algorithm for constraint optimization problems: Performance analysis and estimation of optimal control parameters. Inf Sci. 2013;233:54\u201386.","journal-title":"Inf Sci"},{"key":"1186_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101354","volume":"82","author":"R Shang","year":"2023","unstructured":"Shang R, et al. Evolutionary architecture search via adaptive parameter control and gene potential contribution. Swarm Evol Comput. 2023;82:101354.","journal-title":"Swarm Evol Comput"},{"key":"1186_CR42","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10462-024-11058-w","volume":"58","author":"S Salmani Pour Avval","year":"2025","unstructured":"Salmani Pour Avval S, Eskue ND, Groves RM, Yaghoubi V. Systematic review on neural architecture search. Artif Intell Rev. 2025;58:3.","journal-title":"Artif Intell Rev"},{"key":"1186_CR43","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/TNNLS.2021.3100554","volume":"34","author":"Y Liu","year":"2021","unstructured":"Liu Y, et al. A survey on evolutionary neural architecture search. IEEE Trans Neural Netw Learn Syst. 2021;34:550\u201370.","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1186_CR44","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.ins.2019.10.016","volume":"512","author":"Y Su","year":"2020","unstructured":"Su Y, Guo N, Tian Y, Zhang X. A non-revisiting genetic algorithm based on a novel binary space partition tree. Inf Sci. 2020;512:661\u201374.","journal-title":"Inf Sci"},{"key":"1186_CR45","doi-asserted-by":"crossref","unstructured":"Wang L, et\u00a0al. Improved binary space partition method of airspace sectorization considering multiple scenarios. In: 2022 IEEE 4th international conference on civil aviation safety and information technology (ICCASIT). IEEE; 2022. pp. 456\u2013460.","DOI":"10.1109\/ICCASIT55263.2022.9986566"},{"key":"1186_CR46","doi-asserted-by":"crossref","unstructured":"Putra PA, Tarigan JT, Zamzami EM. Procedural 2d dungeon generation using binary space partition algorithm and l-systems. In: 2023 international conference on computer, control, informatics and its applications (IC3INA). IEEE; 2023. pp. 365\u2013369.","DOI":"10.1109\/IC3INA60834.2023.10285811"},{"key":"1186_CR47","first-page":"77","volume":"2","author":"J Zhang","year":"2017","unstructured":"Zhang J, Zhou A, Zhang G, Zhang H. A clustering based mate selection for evolutionary optimization. Big Data Inf Anal. 2017;2:77\u201385.","journal-title":"Big Data Inf Anal"},{"key":"1186_CR48","doi-asserted-by":"crossref","unstructured":"Zhang H, Song S, Zhou A, Gao X-Z. A clustering based multiobjective evolutionary algorithm. In: 2014 IEEE congress on evolutionary computation (CEC). IEEE; 2014. pp. 723\u2013730.","DOI":"10.1109\/CEC.2014.6900519"},{"key":"1186_CR49","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/JAS.2022.105437","volume":"10","author":"Y Tian","year":"2022","unstructured":"Tian Y, Feng Y, Zhang X, Sun C. A fast clustering based evolutionary algorithm for super-large-scale sparse multi-objective optimization. IEEE\/CAA J Autom Sinica. 2022;10:1048\u201363.","journal-title":"IEEE\/CAA J Autom Sinica"},{"key":"1186_CR50","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1021\/acs.jctc.6b01119","volume":"13","author":"MS J\u00f8rgensen","year":"2017","unstructured":"J\u00f8rgensen MS, Groves MN, Hammer B. Combining evolutionary algorithms with clustering toward rational global structure optimization at the atomic scale. J Chem Theory Comput. 2017;13:1486\u201393.","journal-title":"J Chem Theory Comput"},{"key":"1186_CR51","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.amc.2014.02.093","volume":"235","author":"M Thakur","year":"2014","unstructured":"Thakur M, Meghwani SS, Jalota H. A modified real coded genetic algorithm for constrained optimization. Appl Math Comput. 2014;235:292\u2013317.","journal-title":"Appl Math Comput"},{"key":"1186_CR52","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1007\/s12652-023-04734-2","volume":"15","author":"STM Nasab","year":"2024","unstructured":"Nasab STM, Abualigah L. Improve harris hawkes optimizer algorithm via laplace crossover. J Ambient Intell Humaniz Comput. 2024;15:2057\u201372.","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"1186_CR53","doi-asserted-by":"publisher","first-page":"122872","DOI":"10.1109\/ACCESS.2021.3109247","volume":"9","author":"M Mahdavi","year":"2021","unstructured":"Mahdavi M, Alhelou HH, Bagheri A, Djokic SZ, Ramos RAV. A comprehensive review of metaheuristic methods for the reconfiguration of electric power distribution systems and comparison with a novel approach based on efficient genetic algorithm. IEEE Access. 2021;9:122872\u2013906.","journal-title":"IEEE Access"},{"key":"1186_CR54","doi-asserted-by":"crossref","unstructured":"Dang D-C, Opris A, Salehi B, Sudholt D. A proof that using crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation. In: Proceedings of the AAAI conference on artificial intelligence. 2023. vol. 37, pp. 12390\u20138.","DOI":"10.1609\/aaai.v37i10.26460"},{"key":"1186_CR55","doi-asserted-by":"publisher","first-page":"6688","DOI":"10.1109\/TPAMI.2024.3385920","volume":"46","author":"R Yamasaki","year":"2024","unstructured":"Yamasaki R, Tanaka T. Convergence analysis of mean shift. IEEE Trans Pattern Anal Mach Intell. 2024;46:6688\u201398.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1186_CR56","unstructured":"Wu G, Mallipeddi R, Suganthan PN. 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. 2017. p. 9."},{"key":"1186_CR57","doi-asserted-by":"crossref","unstructured":"Mohamed AW, Hadi AA, Fattouh AM, Jambi KM. Lshade with semi-parameter adaptation hybrid with cma-es for solving cec 2017 benchmark problems. In: 2017 IEEE congress on evolutionary computation (CEC). IEEE; 2017. pp. 145\u2013152.","DOI":"10.1109\/CEC.2017.7969307"},{"key":"1186_CR58","doi-asserted-by":"crossref","unstructured":"Emiola I, Adem R. Comparison of minimization methods for rosenbrock functions. In: 2021 29th mediterranean conference on control and automation (MED). IEEE; 2021. pp. 837\u2013842.","DOI":"10.1109\/MED51440.2021.9480200"},{"key":"1186_CR59","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0898-1221(00)00071-7","volume":"39","author":"EJ Kansa","year":"2000","unstructured":"Kansa EJ, Hon Y-C. Circumventing the ill-conditioning problem with multiquadric radial basis functions: Applications to elliptic partial differential equations. Comput Math Appl. 2000;39:123\u201337.","journal-title":"Comput Math Appl"},{"key":"1186_CR60","doi-asserted-by":"crossref","unstructured":"Omeradzic A, Beyer H-G. Convergence properties of the (\u03bc\/\u03bci, \u03bb)-es on the rastrigin function. In: Proceedings of the 17th ACM\/SIGEVO conference on foundations of genetic algorithms. 2023. pp. 117\u2013128.","DOI":"10.1145\/3594805.3607126"},{"key":"1186_CR61","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.asoc.2014.08.025","volume":"24","author":"HM Pandey","year":"2014","unstructured":"Pandey HM, Chaudhary A, Mehrotra D. A comparative review of approaches to prevent premature convergence in genetic algorithms. Appl Soft Comput. 2014;24:1047\u201377.","journal-title":"Appl Soft Comput"},{"key":"1186_CR62","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1162\/EVCO_a_00006","volume":"18","author":"M Serpell","year":"2010","unstructured":"Serpell M, Smith JE. Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms. Evol Comput. 2010;18:491\u2013514.","journal-title":"Evol Comput"},{"key":"1186_CR63","doi-asserted-by":"crossref","unstructured":"Badran KMS, Rockett PI. The roles of diversity preservation and mutation in preventing population collapse in multiobjective genetic programming. In: Proceedings of the 9th annual conference on genetic and evolutionary computation. 2007. pp. 1551\u20131558.","DOI":"10.1145\/1276958.1277272"},{"key":"1186_CR64","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1109\/TEVC.2010.2043362","volume":"14","author":"T Park","year":"2010","unstructured":"Park T, Ryu KR. A dual-population genetic algorithm for adaptive diversity control. IEEE Trans Evol Comput. 2010;14:865\u201384.","journal-title":"IEEE Trans Evol Comput"},{"key":"1186_CR65","first-page":"2579","volume":"9","author":"L van der Maaten","year":"2008","unstructured":"van der Maaten L, Hinton G. Visualizing data using t-sne. J Mach Learn Res. 2008;9:2579\u2013605.","journal-title":"J Mach Learn Res"},{"key":"1186_CR66","unstructured":"Mahdavi M, Jin Y, Suganthan PN. Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization. Technical Report. 2007."},{"key":"1186_CR67","first-page":"910","volume":"24","author":"R Mallipeddi","year":"2010","unstructured":"Mallipeddi R, Suganthan PN. Problem definitions and evaluation criteria for the CEC 2010 competition on constrained real-parameter optimization. Nanyang Technol Univ Singapore. 2010;24:910.","journal-title":"Nanyang Technol Univ Singapore"},{"key":"1186_CR68","doi-asserted-by":"crossref","unstructured":"Mohamed AW, Hadi AA, Mohamed AK, Awad NH. Evaluating the performance of adaptive gainingsharing knowledge based algorithm on cec 2020 benchmark problems. In: 2020 IEEE congress on evolutionary computation (CEC), IEEE; 2020. pp. 1\u20138.","DOI":"10.1109\/CEC48606.2020.9185901"},{"key":"1186_CR69","doi-asserted-by":"publisher","first-page":"138086","DOI":"10.1109\/ACCESS.2024.3461798","volume":"12","author":"I Shafi","year":"2024","unstructured":"Shafi I, et al. A review of approaches for rapid data clustering: Challenges, opportunities, and future directions. IEEE Access. 2024;12:138086\u2013120.","journal-title":"IEEE Access"},{"key":"1186_CR70","doi-asserted-by":"crossref","unstructured":"Iorio AW, Li X. Solving rotated multi-objective optimization problems using differential evolution. In: Australasian joint conference on artificial intelligence. Springer Berlin Heidelberg, Berlin, Heidelberg; 2004. pp. 861\u2013872.","DOI":"10.1007\/978-3-540-30549-1_74"},{"key":"1186_CR71","doi-asserted-by":"crossref","unstructured":"Kronberger G. Local optimization often is ill-conditioned in genetic programming for symbolic regression. In: 2022 24th International symposium on symbolic and numeric algorithms for scientific computing (SYNASC). IEEE; 2022. pp. 304\u2013310.","DOI":"10.1109\/SYNASC57785.2022.00055"},{"key":"1186_CR72","doi-asserted-by":"publisher","first-page":"20220053","DOI":"10.1098\/rstb.2022.0053","volume":"378","author":"J Diaz-Colunga","year":"2023","unstructured":"Diaz-Colunga J, et al. Global epistasis on fitness landscapes. Philos Trans R Soc B. 2023;378:20220053.","journal-title":"Philos Trans R Soc B"},{"key":"1186_CR73","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1022624728869","volume":"9","author":"NN Schraudolph","year":"1992","unstructured":"Schraudolph NN, Belew RK. Dynamic parameter encoding for genetic algorithms. Mach Learn. 1992;9:9\u201321.","journal-title":"Mach Learn"},{"key":"1186_CR74","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107218","volume":"227","author":"Y Xue","year":"2021","unstructured":"Xue Y, Zhu H, Liang J, S\u0142owik A. Adaptive crossover operator based multi-objective binary genetic algorithm for feature selection in classification. Knowl-Based Syst. 2021;227:107218.","journal-title":"Knowl-Based Syst"},{"key":"1186_CR75","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.338","volume":"7","author":"A G\u00fclc\u00fc","year":"2021","unstructured":"G\u00fclc\u00fc A, Ku\u015f Z. Multi-objective simulated annealing for hyper-parameter optimization in convolutional neural networks. PeerJ Comput Sci. 2021;7:e338.","journal-title":"PeerJ Comput Sci"},{"key":"1186_CR76","doi-asserted-by":"crossref","unstructured":"Fontaine MC, Togelius J, Nikolaidis S, Hoover AK. Covariance matrix adaptation for the rapid illumination of behavior space. In: Proceedings of the 2020 genetic and evolutionary computation conference. 2020. pp. 94\u2013102.","DOI":"10.1145\/3377930.3390232"},{"key":"1186_CR77","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1109\/TMAG.2006.871568","volume":"42","author":"J-H Seo","year":"2006","unstructured":"Seo J-H, et al. Multimodal function optimization based on particle swarm optimization. IEEE Trans Magn. 2006;42:1095\u20138.","journal-title":"IEEE Trans Magn"},{"key":"1186_CR78","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0146-664X(80)90054-4","volume":"14","author":"P-E Danielsson","year":"1980","unstructured":"Danielsson P-E. Euclidean distance mapping. Comput Graphics Image Process. 1980;14:227\u201348.","journal-title":"Comput Graphics Image Process"},{"key":"1186_CR79","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111630","volume":"293","author":"JM-T Wu","year":"2024","unstructured":"Wu JM-T, Lin W-Y, Huang K-W, Wu M-E. On the design of searching algorithm for parameter plateau in quantitative trading strategies using particle swarm optimization. Knowl-Based Syst. 2024;293:111630.","journal-title":"Knowl-Based Syst"}],"container-title":["Discover Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44163-026-01186-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44163-026-01186-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44163-026-01186-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T04:02:52Z","timestamp":1780286572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44163-026-01186-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,7]]},"references-count":79,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["1186"],"URL":"https:\/\/doi.org\/10.1007\/s44163-026-01186-3","relation":{},"ISSN":["2731-0809"],"issn-type":[{"value":"2731-0809","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,7]]},"assertion":[{"value":"30 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable, as the research does not involve human participants.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"All authors have read and approved the final manuscript and consent to its publication.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"491"}}