{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T16:27:01Z","timestamp":1777652821775,"version":"3.51.4"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T00:00:00Z","timestamp":1721779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T00:00:00Z","timestamp":1721779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"FCT","award":["UIDB\/04152\/2020"],"award-info":[{"award-number":["UIDB\/04152\/2020"]}]},{"name":"FCT","award":["UIDB\/04152\/2020"],"award-info":[{"award-number":["UIDB\/04152\/2020"]}]},{"DOI":"10.13039\/501100005855","name":"Universidade Nova de Lisboa","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005855","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Population-Based Bio-Inspired Algorithms (PBBIAs) are computational methods that simulate natural biological processes, such as evolution or social behaviors, to solve optimization problems. Traditionally, PBBIAs use a population of static size, set beforehand through a specific parameter. Nevertheless, for several decades now, the idea of employing populations of dynamic size, capable of adjusting during the course of a single run, has gained ground. Various methods have been introduced, ranging from simpler ones that use a predefined function to determine the population size variation, to more sophisticated methods where the population size in different phases of the evolutionary process depends on the dynamics of the evolution itself and events occurring within the population during the run. The common underlying idea in many of these approaches, is similar: to save a significant amount of computational effort in phases where the evolution is functioning well, and therefore a large population is not needed. This allows for reusing the previously saved computational effort when optimization becomes more challenging, and hence a greater computational effort is required. Numerous past contributions have demonstrated a notable advantage of using dynamically sized populations, often resulting in comparable results to those obtained by the standard\u00a0PBBIAs but with a significant saving of computational effort. However, despite the numerous successes that have been presented, to date, there is still no comprehensive collection of past contributions on the use of dynamic populations that allows for their categorization and critical analysis. This article aims to bridge this gap by presenting a systematic literature review regarding the use of dynamic populations in\u00a0PBBIAs, as well as identifying gaps in the research that can lead the path to future works.<\/jats:p>","DOI":"10.1007\/s10710-024-09492-4","type":"journal-article","created":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T14:03:11Z","timestamp":1721829791000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A survey on dynamic populations in bio-inspired algorithms"],"prefix":"10.1007","volume":"25","author":[{"given":"Davide","family":"Farinati","sequence":"first","affiliation":[]},{"given":"Leonardo","family":"Vanneschi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,24]]},"reference":[{"key":"9492_CR1","doi-asserted-by":"crossref","unstructured":"X.-S. Yang, X. He, In: Yang, X.-S. (ed.) Swarm Intelligence and Evolutionary Computation: Overview and Analysis, 1\u201323. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-13826-8_1"},{"key":"9492_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2016.05.003","volume":"32","author":"AP Piotrowski","year":"2017","unstructured":"A.P. Piotrowski, Review of differential evolution population size. Swarm Evol. Comput. 32, 1\u201324 (2017). https:\/\/doi.org\/10.1016\/j.swevo.2016.05.003","journal-title":"Swarm Evol. Comput."},{"key":"9492_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100718","volume":"58","author":"AP Piotrowski","year":"2020","unstructured":"A.P. Piotrowski, J.J. Napiorkowski, A.E. Piotrowska, Population size in particle swarm optimization. Swarm Evol. Comput. 58, 100718 (2020). https:\/\/doi.org\/10.1016\/j.swevo.2020.100718","journal-title":"Swarm Evol. Comput."},{"key":"9492_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100721","volume":"58","author":"CM Fernandes","year":"2020","unstructured":"C.M. Fernandes, N. Fachada, J.L.J. Laredo, J.J. Merelo, A.C. Rosa, Population sizing of cellular evolutionary algorithms. Swarm Evol. Comput. 58, 100721 (2020). https:\/\/doi.org\/10.1016\/j.swevo.2020.100721","journal-title":"Swarm Evol. Comput."},{"key":"9492_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-36599-0_29","volume-title":"Genetic Programming","author":"F Fernandez","year":"2003","unstructured":"F. Fernandez, L. Vanneschi, M. Tomassini, The effect of plagues in genetic programming: a study of variable-size populations, in Genetic Programming. ed. by C. Ryan, T. Soule, M. Keijzer, E. Tsang, R. Poli, E. Costa (Springer, Berlin, Heidelberg, 2003), pp.317\u2013326"},{"key":"9492_CR6","doi-asserted-by":"publisher","unstructured":"F. Fernandez, M. Tomassini, L. Vanneschi, Saving computational effort in genetic programming by means of plagues. In: The 2003 Congress on Evolutionary Computation, 2003. CEC \u201903., 3, 2042\u201320493 (2003). https:\/\/doi.org\/10.1109\/CEC.2003.1299924","DOI":"10.1109\/CEC.2003.1299924"},{"key":"9492_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-31989-4_5","volume-title":"Genetic Programming","author":"D Rochat","year":"2005","unstructured":"D. Rochat, M. Tomassini, L. Vanneschi, Dynamic size populations in distributed genetic programming, in Genetic Programming. ed. by M. Keijzer, A. Tettamanzi, P. Collet, J. Hemert, M. Tomassini (Springer, Berlin, Heidelberg, 2005), pp.50\u201361"},{"key":"9492_CR8","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1016\/j.ins.2008.12.009","volume":"179","author":"P Kouchakpour","year":"2009","unstructured":"P. Kouchakpour, A. Zaknich, T. Braunl, Dynamic population variation in genetic programming. Inf. Sci. 179, 1078\u20131091 (2009). https:\/\/doi.org\/10.1016\/j.ins.2008.12.009","journal-title":"Inf. Sci."},{"key":"9492_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s12204-012-1251-7","author":"Y-Y Tao","year":"2012","unstructured":"Y.-Y. Tao, J. Cao, M.-L. Li, Genetic programming using dynamic population variation for computational efforts reduction in system modeling. J. Shanghai Jiaotong Univ. (Sci.) (2012). https:\/\/doi.org\/10.1007\/s12204-012-1251-7","journal-title":"J. Shanghai Jiaotong Univ. (Sci.)"},{"key":"9492_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119513","author":"D Farinati","year":"2023","unstructured":"D. Farinati, I. Bakurov, L. Vanneschi, A study of dynamic populations in geometric semantic genetic programming. Inform. Sci. (2023). https:\/\/doi.org\/10.1016\/j.ins.2023.119513","journal-title":"Inform. Sci."},{"issue":"5","key":"9492_CR11","doi-asserted-by":"publisher","first-page":"5907","DOI":"10.1007\/s40747-023-01042-2","volume":"9","author":"J Liang","year":"2023","unstructured":"J. Liang, Z. Chen, Y. Wang, X. Ban, K. Qiao, K. Yu, A dual-population constrained multi-objective evolutionary algorithm with variable auxiliary population size. Complex Intell. Syst. 9(5), 5907\u20135922 (2023). https:\/\/doi.org\/10.1007\/s40747-023-01042-2","journal-title":"Complex Intell. Syst."},{"key":"9492_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101104","volume":"73","author":"W Bingchuan","year":"2022","unstructured":"W. Bingchuan, Z.-Y. Shui, Y. Feng, Z. Ma, Evolutionary algorithm with dynamic population size for constrained multiobjective optimization. Swarm Evol. Comput. 73, 101104 (2022). https:\/\/doi.org\/10.1016\/j.swevo.2022.101104","journal-title":"Swarm Evol. Comput."},{"key":"9492_CR13","unstructured":"O. Montiel\u00a0Ross, O. Castillo, P. Melin, R. Sep\u00falveda, Intelligent control of dynamic population size for evolutionary algorithms., 551\u2013557 (2006)"},{"key":"9492_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.05.044","author":"L Cui","year":"2017","unstructured":"L. Cui, G. Li, Z. Zhu, Q. Lin, Z. Wen, N. Lu, K.-C. Wong, J. Chen, A novel artificial bee colony algorithm with an adaptive population size for numerical function optimization. Inform. Sci. (2017). https:\/\/doi.org\/10.1016\/j.ins.2017.05.044","journal-title":"Inform. Sci."},{"key":"9492_CR15","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1109\/4235.974840","volume":"5","author":"KC Tan","year":"2002","unstructured":"K.C. Tan, T.H. Lee, E.F. Khor, Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization. IEEE Transact. Evolut. Comput. 5, 565\u2013588 (2002). https:\/\/doi.org\/10.1109\/4235.974840","journal-title":"IEEE Transact. Evolut. Comput."},{"key":"9492_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2017.09.009","author":"N Awad","year":"2017","unstructured":"N. Awad, M. Ali, P. Suganthan, Ensemble of parameters in a sinusoidal differential evolution with niching-based population reduction. Swarm Evolut. Comput. (2017). https:\/\/doi.org\/10.1016\/j.swevo.2017.09.009","journal-title":"Swarm Evolut. Comput."},{"key":"9492_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-30217-9_5","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"AE Eiben","year":"2004","unstructured":"A.E. Eiben, E. Marchiori, V.A. Valk\u00f3, Evolutionary algorithms with on-the-fly population size adjustment, in Parallel Problem Solving from Nature - PPSN VIII. ed. by X. Yao, E.K. Burke, J.A. Lozano, J. Smith, J.J. Merelo-Guerv\u00f3s, J.A. Bullinaria, J.E. Rowe, P. Ti\u0148o, A. Kab\u00e1n, H.-P. Schwefel (Springer, Berlin, Heidelberg, 2004), pp.41\u201350"},{"issue":"1","key":"9492_CR18","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1093\/jcde\/qwac139","volume":"10","author":"X Shu","year":"2022","unstructured":"X. Shu, Y. Liu, J. Liu, M. Yang, Q. Zhang, Multi-objective particle swarm optimization with dynamic population size. J. Comput. Design Eng. 10(1), 446\u2013467 (2022). https:\/\/doi.org\/10.1093\/jcde\/qwac139","journal-title":"J. Comput. Design Eng."},{"key":"9492_CR19","doi-asserted-by":"publisher","unstructured":"L. Vanneschi, G. Cuccu, Reconstructing Dynamic Target Functions by Means of Genetic Programming Using Variable Population Size 343, 121\u2013134 (2011). https:\/\/doi.org\/10.1007\/978-3-642-20206-3_8","DOI":"10.1007\/978-3-642-20206-3_8"},{"key":"9492_CR20","doi-asserted-by":"publisher","unstructured":"C. Fernandes, V. Ramos, A. Rosa, Varying the population size of artificial foraging swarms on time varying landscapes, 311\u2013316 (2005). https:\/\/doi.org\/10.1007\/11550822_49","DOI":"10.1007\/11550822_49"},{"key":"9492_CR21","doi-asserted-by":"crossref","unstructured":"J. Branke, Evolutionary Optimization in Dynamic Environments. Springer, ??? (2002)","DOI":"10.1007\/978-1-4615-0911-0"},{"key":"9492_CR22","unstructured":"J.J. Grefenstette, Genetic algorithms for changing environments. In: Proceedings of Parallel Problem Solving from Nature, 137\u2013144 (1992)"},{"issue":"2","key":"9492_CR23","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"A.E. Eiben, R. Hinterding, Z. Michalewicz, Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 3(2), 124\u2013141 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"9492_CR24","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","volume":"9","author":"Y Jin","year":"2005","unstructured":"Y. Jin, J. Branke, Evolutionary optimization in uncertain environments-a survey. IEEE Trans. Evol. Comput. 9(3), 303\u2013317 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9492_CR25","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-45356-3_31","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"T B\u00e4ck","year":"2000","unstructured":"T. B\u00e4ck, A.E. Eiben, N.A.L. Vaart, An emperical study on gas without parameters, in Parallel Problem Solving from Nature PPSN VI. ed. by M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J.J. Merelo, H.-P. Schwefel (Springer, Berlin, Heidelberg, 2000), pp.315\u2013324"},{"key":"9492_CR26","doi-asserted-by":"publisher","unstructured":"A. Zamuda, J. Brest, E. Mezura-Montes, Structured population size reduction differential evolution with multiple mutation strategies on cec 2013 real parameter optimization. In: 2013 IEEE Congress on Evolutionary Computation, 1925\u20131931 (2013). https:\/\/doi.org\/10.1109\/CEC.2013.6557794","DOI":"10.1109\/CEC.2013.6557794"},{"key":"9492_CR27","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.aasri.2013.10.043","volume":"4","author":"A George","year":"2013","unstructured":"A. George, B.R. Rajakumar, Apoga: an adaptive population pool size based genetic algorithm. AASRI Procedia 4, 288\u2013296 (2013). https:\/\/doi.org\/10.1016\/j.aasri.2013.10.043","journal-title":"AASRI Procedia"},{"issue":"7","key":"9492_CR28","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s00500-008-0344-6","volume":"13","author":"NS Teng","year":"2009","unstructured":"N.S. Teng, J. Teo, M.H.A. Hijazi, Self-adaptive population sizing for a tune-free differential evolution. Soft Comput. 13(7), 709\u2013724 (2009). https:\/\/doi.org\/10.1007\/s00500-008-0344-6","journal-title":"Soft Comput."},{"key":"9492_CR29","doi-asserted-by":"publisher","first-page":"247263031769031","DOI":"10.1177\/2472630317690318","volume":"22","author":"I Wong","year":"2017","unstructured":"I. Wong, W. Liu, C.-M. Ho, X. Ding, Continuous adaptive population reduction (capr) for differential evolution optimization. SLAS Technol. 22, 2472630317690318 (2017). https:\/\/doi.org\/10.1177\/2472630317690318","journal-title":"SLAS Technol."},{"issue":"2","key":"9492_CR30","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2015","unstructured":"G. Karafotias, M. Hoogendoorn, A.E. Eiben, Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evol. Comput. 19(2), 167\u2013187 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"9492_CR31","first-page":"1396","volume":"185","author":"JE Smith","year":"2008","unstructured":"J.E. Smith, Self-adaptation in evolutionary algorithms for combinatorial optimization. Eur. J. Oper. Res. 185(3), 1396\u20131414 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9492_CR32","unstructured":"P.J. Angeline, Adaptive and self-adaptive evolutionary computations. In: Computational Intelligence: A Dynamic Systems Perspective, 152\u2013163. IEEE Press, ??? (1995)"},{"key":"9492_CR33","doi-asserted-by":"crossref","unstructured":"\u00c1. Fialho, M. Schoenauer, M. Sebag, Toward comparison-based adaptive operator selection. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, 767\u2013774 (2010)","DOI":"10.1145\/1830483.1830619"},{"issue":"11","key":"9492_CR34","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s00500-004-0422-3","volume":"9","author":"S Yang","year":"2005","unstructured":"S. Yang, X. Yao, Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft. Comput. 9(11), 815\u2013834 (2005)","journal-title":"Soft. Comput."},{"key":"9492_CR35","doi-asserted-by":"publisher","unstructured":"E.C. Shi, F.H.F. Leung, B.N.F. Law, Differential evolution with adaptive population size. In: 2014 19th International Conference on Digital Signal Processing, 876\u2013881 (2014). https:\/\/doi.org\/10.1109\/ICDSP.2014.6900794","DOI":"10.1109\/ICDSP.2014.6900794"},{"key":"9492_CR36","doi-asserted-by":"publisher","unstructured":"G.G. Yen, H. Lu, Dynamic population strategy assisted particle swarm optimization. In: Proceedings of the 2003 IEEE International Symposium on Intelligent Control, 697\u2013702 (2003). https:\/\/doi.org\/10.1109\/ISIC.2003.1254720","DOI":"10.1109\/ISIC.2003.1254720"},{"issue":"5","key":"9492_CR37","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1109\/TSMCB.2008.925757","volume":"38","author":"W-F Leong","year":"2008","unstructured":"W.-F. Leong, G.G. Yen, Pso-based multiobjective optimization with dynamic population size and adaptive local archives. IEEE Transact. Syst. Man Cybernet Part B (Cybernet.) 38(5), 1270\u20131293 (2008). https:\/\/doi.org\/10.1109\/TSMCB.2008.925757","journal-title":"IEEE Transact. Syst. Man Cybernet Part B (Cybernet.)"},{"key":"9492_CR38","doi-asserted-by":"publisher","unstructured":"X. Zhang, Z.-H. Zhan, J. Zhang, Adaptive population differential evolution with dual control strategy for large-scale global optimization problems. In: 2020 IEEE Congress on Evolutionary Computation (CEC), 1\u20137 (2020). https:\/\/doi.org\/10.1109\/CEC48606.2020.9185854","DOI":"10.1109\/CEC48606.2020.9185854"},{"key":"9492_CR39","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.ins.2012.09.019","volume":"223","author":"W Zhu","year":"2013","unstructured":"W. Zhu, Y. Tang, J.-A. Fang, W. Zhang, Adaptive population tuning scheme for differential evolution. Inf. Sci. 223, 164\u2013191 (2013). https:\/\/doi.org\/10.1016\/j.ins.2012.09.019","journal-title":"Inf. Sci."},{"key":"9492_CR40","doi-asserted-by":"publisher","unstructured":"J. Brest, M.S. Mau\u010dec, B. Bo\u0161kovi\u0107, Self-adaptive differential evolution algorithm with population size reduction for single objective bound-constrained optimization: algorithm j21. In: 2021 IEEE Congress on Evolutionary Computation (CEC), 817\u2013824 (2021). https:\/\/doi.org\/10.1109\/CEC45853.2021.9504782","DOI":"10.1109\/CEC45853.2021.9504782"},{"key":"9492_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.05.044","author":"L Cui","year":"2017","unstructured":"L. Cui, G. Li, Z. Zhu, Q. Lin, Z. Wen, N. Lu, K.-C. Wong, J. Chen, A novel artificial bee colony algorithm with an adaptive population size for numerical function optimization. Inform. Sci. (2017). https:\/\/doi.org\/10.1016\/j.ins.2017.05.044","journal-title":"Inform. Sci."},{"key":"9492_CR42","doi-asserted-by":"publisher","unstructured":"I. Gon\u00e7alves, S. Silva, C.M. Fonseca, M. Castelli, Unsure when to stop? In: Proceedings of the Genetic and Evolutionary Computation Conference. ACM, ??? (2017). https:\/\/doi.org\/10.1145\/3071178.3071328","DOI":"10.1145\/3071178.3071328"},{"key":"9492_CR43","doi-asserted-by":"publisher","unstructured":"R. Pol\u00e1kov\u00e1, P. Bujok, Adaptation of population size in differential evolution algorithm: an experimental comparison. In: 2018 25th International Conference on Systems, Signals and Image Processing (IWSSIP), 1\u20135 (2018). https:\/\/doi.org\/10.1109\/IWSSIP.2018.8439374","DOI":"10.1109\/IWSSIP.2018.8439374"},{"key":"9492_CR44","doi-asserted-by":"publisher","unstructured":"E.A. Merch\u00e1n-Cruz, G. Urriolagoitia-Sosa, J. Ram\u00edrez-Gordillo, R. Rodr\u00edguez-Ca\u00f1izo, I.Y. Campos-Padilla, J.J. Mu\u00f1oz-C\u00e9sar, E. Lugo-Gonz\u00e1lez, Ga based trajectory planner for robot manipulators sharing a common workspace with adaptive population size. In: 2008 Electronics, Robotics and Automotive Mechanics Conference (CERMA \u201908), 520\u2013525 (2008). https:\/\/doi.org\/10.1109\/CERMA.2008.65","DOI":"10.1109\/CERMA.2008.65"},{"key":"9492_CR45","doi-asserted-by":"publisher","unstructured":"T.-Y. Huang, Y.-Y. Chen, Parental population sizing in evolutionary strategies. In: Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), 2, 1351\u201313582 (2001). https:\/\/doi.org\/10.1109\/CEC.2001.934348","DOI":"10.1109\/CEC.2001.934348"},{"key":"9492_CR46","doi-asserted-by":"publisher","unstructured":"J. Yu, H. Takagi, Accelerating fireworks algorithm with dynamic population size strategy. In: 2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems (SCIS-ISIS), 1\u20136 (2020). https:\/\/doi.org\/10.1109\/SCISISIS50064.2020.9322693","DOI":"10.1109\/SCISISIS50064.2020.9322693"},{"issue":"6","key":"9492_CR47","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.1109\/TSMCB.2009.2015956","volume":"39","author":"Z-H Zhan","year":"2009","unstructured":"Z.-H. Zhan, J. Zhang, Y. Li, H.S.-H. Chung, Adaptive particle swarm optimization. IEEE Transact. Syst. Man Cybernet. Part B (Cybernet.) 39(6), 1362\u20131381 (2009). https:\/\/doi.org\/10.1109\/TSMCB.2009.2015956","journal-title":"IEEE Transact. Syst. Man Cybernet. Part B (Cybernet.)"},{"key":"9492_CR48","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.3390\/math10091511","volume":"10","author":"L Zheng","year":"2022","unstructured":"L. Zheng, S. Luo, Adaptive differential evolution algorithm based on fitness landscape characteristic. Mathematics 10, 1511 (2022). https:\/\/doi.org\/10.3390\/math10091511","journal-title":"Mathematics"},{"key":"9492_CR49","doi-asserted-by":"publisher","unstructured":"J.C. Costa, R. Tavares, A. Rosa, An experimental study on dynamic random variation of population size. In: IEEE SMC\u201999 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028), 1, 607\u20136121 (1999). https:\/\/doi.org\/10.1109\/ICSMC.1999.814161","DOI":"10.1109\/ICSMC.1999.814161"},{"key":"9492_CR50","doi-asserted-by":"publisher","unstructured":"W.-F. Leong, G.G. Yen, Dynamic population size in pso-based multiobjective optimization. In: 2006 IEEE International Conference on Evolutionary Computation, 1718\u20131725 (2006). https:\/\/doi.org\/10.1109\/CEC.2006.1688515","DOI":"10.1109\/CEC.2006.1688515"},{"key":"9492_CR51","doi-asserted-by":"publisher","unstructured":"L.S. Lima, H.S. Bernardino, H.J.C. Barbosa, Designing combinational circuits using a multi-objective cartesian genetic programming with adaptive population size. In: Machine Learning, Optimization, and Data Science: 5th International Conference, LOD 2019, Siena, Italy, September 10-13, 2019, Proceedings, 592\u2013604. Springer, Berlin, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-37599-7_49","DOI":"10.1007\/978-3-030-37599-7_49"},{"key":"9492_CR52","doi-asserted-by":"publisher","unstructured":"J. Arabas, Z. Michalewicz, J. Mulawka, Gavaps-a genetic algorithm with varying population size. In: Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, 73\u2013781 (1994). https:\/\/doi.org\/10.1109\/ICEC.1994.350039","DOI":"10.1109\/ICEC.1994.350039"},{"key":"9492_CR53","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1007\/3-540-45110-2_65","volume-title":"Genetic and Evolutionary Computation\u2014GECCO 2003","author":"S Luke","year":"2003","unstructured":"S. Luke, G.C. Balan, L. Panait, Population implosion in genetic programming, in Genetic and Evolutionary Computation\u2014GECCO 2003. ed. by E. Cant\u00fa-Paz, J.A. Foster, K. Deb, L.D. Davis, R. Roy, U.-M. O\u2019Reilly, H.-G. Beyer, R. Standish, G. Kendall, S. Wilson, M. Harman, J. Wegener, D. Dasgupta, M.A. Potter, A.C. Schultz, K.A. Dowsland, N. Jonoska, J. Miller (Springer, Berlin, Heidelberg, 2003), pp.1729\u20131739"},{"key":"9492_CR54","doi-asserted-by":"publisher","unstructured":"V. Cutello, D. Lee, S. Leone, G. Nicosia, M. Pavone, Clonal selection algorithm with dynamic population size for bimodal search spaces 4221, 949\u2013958 (2006). https:\/\/doi.org\/10.1007\/11881070_125","DOI":"10.1007\/11881070_125"},{"key":"9492_CR55","doi-asserted-by":"publisher","unstructured":"Z. Ma, A. Krings, Dynamic populations in genetic algorithms 12, 1807\u20131811 (2008). https:\/\/doi.org\/10.1145\/1363686.1364119","DOI":"10.1145\/1363686.1364119"},{"key":"9492_CR56","doi-asserted-by":"publisher","first-page":"71","DOI":"10.3390\/a11050071","volume":"11","author":"H Hu","year":"2018","unstructured":"H. Hu, Z. Cai, S. Hu, Y. Cai, J. Chen, S. Huang, Improving monarch butterfly optimization algorithm with self-adaptive population. Algorithms 11, 71 (2018). https:\/\/doi.org\/10.3390\/a11050071","journal-title":"Algorithms"},{"key":"9492_CR57","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105752","author":"E Li","year":"2019","unstructured":"E. Li, An adaptive surrogate assisted differential evolutionary algorithm for high dimensional constrained problems. Appl. Soft Comput. (2019). https:\/\/doi.org\/10.1016\/j.asoc.2019.105752","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"9492_CR58","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"D.H. Wolpert, W.G. Macready, No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997). https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9492_CR59","doi-asserted-by":"publisher","unstructured":"Y. Hong, Q. Ren, J. Zeng, Adaptive population size for univariate marginal distribution algorithm. In: 2005 IEEE Congress on Evolutionary Computation, 2, 1396\u201314022 (2005). https:\/\/doi.org\/10.1109\/CEC.2005.1554853","DOI":"10.1109\/CEC.2005.1554853"},{"key":"9492_CR60","doi-asserted-by":"publisher","unstructured":"T. Hu, Y.P. Chen, W. Banzhaf, Wimax network planning using adaptive-population-size genetic algorithm. EvoCOMNET\u201910, 31\u201340. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12242-2_4","DOI":"10.1007\/978-3-642-12242-2_4"},{"key":"9492_CR61","doi-asserted-by":"publisher","DOI":"10.1166\/jctn.2015.3895","author":"TJ Choi","year":"2015","unstructured":"T.J. Choi, C.W. Ahn, An adaptive population resizing scheme for differential evolution in numerical optimization. J. Comput. Theor. Nanosci. (2015). https:\/\/doi.org\/10.1166\/jctn.2015.3895","journal-title":"J. Comput. Theor. Nanosci."},{"key":"9492_CR62","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-211-27389-1_58","volume-title":"Adaptive and Natural Computing Algorithms","author":"S Silva","year":"2005","unstructured":"S. Silva, P.J.N. Silva, E. Costa, Resource-limited genetic programming: replacing tree depth limits, in Adaptive and Natural Computing Algorithms. ed. by B. Ribeiro, R.F. Albrecht, A. Dobnikar, D.W. Pearson, N.C. Steele (Springer, Vienna, 2005), pp.243\u2013246"},{"key":"9492_CR63","doi-asserted-by":"publisher","unstructured":"S. Silva, E. Costa, Resource-limited genetic programming: the dynamic approach. In: Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation. GECCO \u201905, 1673\u20131680. Association for Computing Machinery, New York, NY, USA (2005). https:\/\/doi.org\/10.1145\/1068009.1068290","DOI":"10.1145\/1068009.1068290"},{"key":"9492_CR64","doi-asserted-by":"publisher","unstructured":"R. Tanabe, A.S. Fukunaga, Improving the search performance of shade using linear population size reduction. In: 2014 IEEE Congress on Evolutionary Computation (CEC), 1658\u20131665 (2014). https:\/\/doi.org\/10.1109\/CEC.2014.6900380","DOI":"10.1109\/CEC.2014.6900380"},{"key":"9492_CR65","doi-asserted-by":"publisher","unstructured":"A. Piotrowski, L-shade optimization algorithms with population-wide inertia. Information Sciences 468 (2018) https:\/\/doi.org\/10.1016\/j.ins.2018.08.030","DOI":"10.1016\/j.ins.2018.08.030"},{"key":"9492_CR66","doi-asserted-by":"publisher","unstructured":"R. Tanabe, A. Fukunaga, Success-history based parameter adaptation for differential evolution. In: 2013 IEEE Congress on Evolutionary Computation, 71\u201378 (2013). https:\/\/doi.org\/10.1109\/CEC.2013.6557555","DOI":"10.1109\/CEC.2013.6557555"},{"key":"9492_CR67","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.asoc.2008.03.001","volume":"9","author":"D Chen","year":"2009","unstructured":"D. Chen, C. Zhao, Particle swarm optimization with adaptive population size and its application. Appl. Soft Comput. 9, 39\u201348 (2009). https:\/\/doi.org\/10.1016\/j.asoc.2008.03.001","journal-title":"Appl. Soft Comput."},{"key":"9492_CR68","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.03.014","author":"R Polakova","year":"2019","unstructured":"R. Polakova, J. Tvrdik, P. Bujok, Differential evolution with adaptive mechanism of population size according to current population diversity. Swarm Evolut. Comput. (2019). https:\/\/doi.org\/10.1016\/j.swevo.2019.03.014","journal-title":"Swarm Evolut. Comput."}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-024-09492-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10710-024-09492-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-024-09492-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T13:10:45Z","timestamp":1732540245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10710-024-09492-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,24]]},"references-count":68,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["9492"],"URL":"https:\/\/doi.org\/10.1007\/s10710-024-09492-4","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,24]]},"assertion":[{"value":"10 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2024","order":4,"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 through the submission of this document that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Confict of interest"}}],"article-number":"19"}}