{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:59:38Z","timestamp":1767988778264,"version":"3.49.0"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_40","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"569-585","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Self-adjusting Population Sizes for\u00a0the\u00a0$$(1, \\lambda )$$-EA on\u00a0Monotone Functions"],"prefix":"10.1007","author":[{"given":"Marc","family":"Kaufmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Larcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xun","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"issue":"3","key":"40_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2996355","volume":"49","author":"A Aleti","year":"2016","unstructured":"Aleti, A., Moser, I.: A systematic literature review of adaptive parameter control methods for evolutionary algorithms. ACM Comput. Surv. (CSUR) 49(3), 1\u201335 (2016)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B., Yang, Q.: The efficiency threshold for the offspring population size of the $$(\\mu , \\lambda )$$ EA. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1461\u20131469 (2019)","DOI":"10.1145\/3321707.3321838"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Auger, A.: Benchmarking the (1+ 1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 2447\u20132452 (2009)","DOI":"10.1145\/1570256.1570342"},{"key":"40_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1007\/978-3-319-10762-2_88","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"G Badkobeh","year":"2014","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of\u00a0parallel\u00a0search. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 892\u2013901. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_88"},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15844-5_1","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S B\u00f6ttcher","year":"2010","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal Fixed and adaptive mutation rates for the leadingones problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 1\u201310. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_1"},{"issue":"4","key":"40_CR6","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1109\/TEVC.2020.2985450","volume":"24","author":"B Case","year":"2020","unstructured":"Case, B., Lehre, P.K.: Self-adaptation in nonelitist evolutionary algorithms on discrete problems with unknown structure. IEEE Trans. Evol. Comput. 24(4), 650\u2013663 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Colin, S., Doerr, B., F\u00e9rey, G.: Monotonic functions in EC: anything but monotone! In: Genetic and Evolutionary Computation Conference (GECCO), pp. 753\u2013760 (2014)","DOI":"10.1145\/2576768.2598338"},{"key":"40_CR8","unstructured":"Devroye, L.: The compound random search. Ph.D. dissertation, Purdue Univ., West Lafayette, IN (1972)"},{"issue":"5","key":"40_CR9","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1007\/s00453-017-0354-9","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C.: Optimal static and self-adjusting parameter choices for the $$(1+(\\lambda,\\lambda ))$$ Genetic Algorithm. Algorithmica 80(5), 1658\u20131709 (2018)","journal-title":"Algorithmica"},{"key":"40_CR10","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-030-29414-4_6","volume-title":"Theory of Evolutionary Computation","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Doerr, C.: Theory of Parameter control for discrete black-box optimization: provable performance gains through dynamic parameter choices. In: Theory of Evolutionary Computation. NCS, pp. 271\u2013321. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_6"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., Ebel, F.: From black-box complexity to designing new genetic algorithms. Theoret. Comput. Sci. 567, 87\u2013104 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1007\/978-3-319-45823-6_73","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"B Doerr","year":"2016","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Provably optimal self-adjusting step sizes for multi-valued decision variables. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 782\u2013791. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_73"},{"issue":"5","key":"40_CR13","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1007\/s00453-017-0341-1","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Static and self-adjusting mutation strengths for multi-valued decision variables. Algorithmica 80(5), 1732\u20131768 (2018)","journal-title":"Algorithmica"},{"issue":"10","key":"40_CR14","doi-asserted-by":"publisher","first-page":"3108","DOI":"10.1007\/s00453-021-00854-3","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Doerr, C., Lengler, J.: Self-adjusting mutation rates with provably optimal success rules. Algorithmica 83(10), 3108\u20133147 (2021)","journal-title":"Algorithmica"},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2019.06.014","volume":"801","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Doerr, C., Yang, J.: Optimal parameter choices via precise black-box analysis. Theoret. Comput. Sci. 801, 1\u201334 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"40_CR16","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00453-018-0502-x","volume":"81","author":"B Doerr","year":"2019","unstructured":"Doerr, B., Gie\u00dfen, C., Witt, C., Yang, J.: The $$(1+\\lambda )$$ evolutionary algorithm with self-adjusting mutation rate. Algorithmica 81(2), 593\u2013631 (2019)","journal-title":"Algorithmica"},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-15844-5_5","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"B Doerr","year":"2010","unstructured":"Doerr, B., Jansen, T., Sudholt, D., Winzen, C., Zarges, C.: Optimizing\u00a0monotone\u00a0functions\u00a0can\u00a0be\u00a0difficult. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 42\u201351. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_5"},{"issue":"1","key":"40_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/EVCO_a_00055","volume":"21","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Jansen, T., Sudholt, D., Winzen, C., Zarges, C.: Mutation rate matters even when optimizing monotonic functions. Evol. Comput. 21(1), 1\u201327 (2013)","journal-title":"Evol. Comput."},{"key":"40_CR19","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64, 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"40_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2014.03.015","volume":"561","author":"B Doerr","year":"2015","unstructured":"Doerr, B., K\u00fcnnemann, M.: Optimizing linear functions with the (1+ $$\\lambda $$) evolutionary algorithm-different asymptotic runtimes for different instances. Theoret. Comput. Sci. 561, 3\u201323 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"Doerr, B., Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the runtime analysis of selection hyper-heuristics with adaptive learning periods. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1015\u20131022 (2018)","DOI":"10.1145\/3205455.3205611"},{"issue":"4","key":"40_CR22","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1007\/s00453-020-00726-2","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Witt, C., Yang, J.: Runtime analysis for self-adaptive mutation rates. Algorithmica 83(4), 1012\u20131053 (2021)","journal-title":"Algorithmica"},{"key":"40_CR23","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 3, 124\u2013141 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"40_CR24","doi-asserted-by":"publisher","unstructured":"Grimmett, G.R., et al.: Percolation, vol. 321. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-03981-6","DOI":"10.1007\/978-3-662-03981-6"},{"key":"40_CR25","doi-asserted-by":"crossref","unstructured":"Hevia Fajardo, M.A., Sudholt, D.: On the choice of the parameter control mechanism in the (1+($$\\lambda $$, $$\\lambda $$)) genetic algorithm. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 832\u2013840 (2020)","DOI":"10.1145\/3377930.3390200"},{"key":"40_CR26","doi-asserted-by":"crossref","unstructured":"Hevia Fajardo, M.A., Sudholt, D.: Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. arXiv preprint arXiv:2104.05624 (2021)","DOI":"10.1145\/3449639.3459338"},{"key":"40_CR27","doi-asserted-by":"crossref","unstructured":"Hevia Fajardo, M.A., Sudholt, D.: Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1151\u20131159 (2021)","DOI":"10.1145\/3449639.3459338"},{"key":"40_CR28","doi-asserted-by":"crossref","unstructured":"Jagerskupper, J., Storch, T.: When the plus strategy outperforms the comma strategy and when not. In: 2007 IEEE Symposium on Foundations of Computational Intelligence, pp. 25\u201332. IEEE (2007)","DOI":"10.1109\/FOCI.2007.372143"},{"key":"40_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-73482-6_4","volume-title":"Foundations of Genetic Algorithms","author":"T Jansen","year":"2007","unstructured":"Jansen, T.: On the brittleness of evolutionary algorithms. In: Stephens, C.R., Toussaint, M., Whitley, D., Stadler, P.F. (eds.) FOGA 2007. LNCS, vol. 4436, pp. 54\u201369. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73482-6_4"},{"issue":"2","key":"40_CR30","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2014","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, \u00c1.E.: Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evol. Comput. 19(2), 167\u2013187 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"40_CR31","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: OneMax is not the easiest function for fitness improvements (2022). https:\/\/arxiv.org\/abs\/2204.07017"},{"key":"40_CR32","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: Self-adjusting population sizes for the $$(1, \\lambda )$$-EA on monotone functions (2022). https:\/\/arxiv.org\/abs\/2204.00531","DOI":"10.1007\/978-3-031-14721-0_40"},{"issue":"1","key":"40_CR33","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/B:NACO.0000023416.59689.4e","volume":"3","author":"S Kern","year":"2004","unstructured":"Kern, S., M\u00fcller, S.D., Hansen, N., B\u00fcche, D., Ocenasek, J., Koumoutsakos, P.: Learning probability distributions in continuous evolutionary algorithms-a comparative review. Nat. Comput. 3(1), 77\u2013112 (2004)","journal-title":"Nat. Comput."},{"issue":"3","key":"40_CR34","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s00453-015-0048-0","volume":"75","author":"T K\u00f6tzing","year":"2016","unstructured":"K\u00f6tzing, T.: Concentration of first hitting times under additive drift. Algorithmica 75(3), 490\u2013506 (2016)","journal-title":"Algorithmica"},{"key":"40_CR35","doi-asserted-by":"crossref","unstructured":"L\u00e4ssig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: Foundations of Genetic Algorithms (FOGA), pp. 181\u2013192 (2011)","DOI":"10.1145\/1967654.1967671"},{"key":"40_CR36","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","volume":"64","author":"PK Lehre","year":"2012","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica 64, 623\u2013642 (2012)","journal-title":"Algorithmica"},{"issue":"6","key":"40_CR37","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/TEVC.2019.2917014","volume":"24","author":"J Lengler","year":"2019","unstructured":"Lengler, J.: A general dichotomy of evolutionary algorithms on monotone functions. IEEE Trans. Evol. Comput. 24(6), 995\u20131009 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"40_CR38","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-29414-4_2","volume-title":"Theory of Evolutionary Computation","author":"J Lengler","year":"2020","unstructured":"Lengler, J.: Drift analysis. In: Theory of Evolutionary Computation. NCS, pp. 89\u2013131. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_2"},{"key":"40_CR39","doi-asserted-by":"crossref","unstructured":"Lengler, J., Martinsson, A., Steger, A.: When does hillclimbing fail on monotone functions: an entropy compression argument. In: Analytic Algorithmics and Combinatorics (ANALCO), pp. 94\u2013102. SIAM (2019)","DOI":"10.1137\/1.9781611975505.10"},{"key":"40_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/978-3-030-58112-1_42","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"J Lengler","year":"2020","unstructured":"Lengler, J., Meier, J.: Large population sizes and crossover help in dynamic environments. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 610\u2013622. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_42"},{"key":"40_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-030-72904-2_6","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J Lengler","year":"2021","unstructured":"Lengler, J., Riedi, S.: Runtime analysis of the $$(\\mu + 1)$$-EA on the dynamic BinVal function. In: Zarges, C., Verel, S. (eds.) EvoCOP 2021. LNCS, vol. 12692, pp. 84\u201399. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72904-2_6"},{"key":"40_CR42","doi-asserted-by":"crossref","unstructured":"Lengler, J., Schaller, U.: The $$(1+1)$$-EA on noisy linear functions with random positive weights. In: Symposium Series on Computational Intelligence (SSCI), pp. 712\u2013719. IEEE (2018)","DOI":"10.1109\/SSCI.2018.8628785"},{"issue":"4","key":"40_CR43","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1017\/S0963548318000275","volume":"27","author":"J Lengler","year":"2018","unstructured":"Lengler, J., Steger, A.: Drift analysis and evolutionary algorithms revisited. Comb. Probab. Comput. 27(4), 643\u2013666 (2018)","journal-title":"Comb. Probab. Comput."},{"key":"40_CR44","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2021.03.025","volume":"875","author":"J Lengler","year":"2021","unstructured":"Lengler, J., Zou, X.: Exponential slowdown for larger populations: the $$(\\mu + 1)$$-EA on monotone functions. Theoret. Comput. Sci. 875, 28\u201351 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"40_CR45","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Oliveto, P., Warwicker, J.A.: How the duration of the learning period affects the performance of random gradient selection hyper-heuristics. In: AAAI Conference on Artificial Intelligence (AAAI), vol. 34, no. 3, pp. 2376\u20132383 (2020)","DOI":"10.1609\/aaai.v34i03.5617"},{"key":"40_CR46","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the time complexity of algorithm selection hyper-heuristics for multimodal optimisation. In: AAAI Conference on Artificial Intelligence (AAAI), vol. 33, no. 1, pp. 2322\u20132329 (2019)","DOI":"10.1609\/aaai.v33i01.33012322"},{"issue":"3","key":"40_CR47","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1162\/evco_a_00258","volume":"28","author":"A Lissovoi","year":"2020","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: Simple hyper-heuristics control the neighbourhood size of randomised local search optimally for LeadingOnes. Evol. Comput. 28(3), 437\u2013461 (2020)","journal-title":"Evol. Comput."},{"issue":"4","key":"40_CR48","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1162\/EVCO_a_00153","volume":"23","author":"A Mambrini","year":"2015","unstructured":"Mambrini, A., Sudholt, D.: Design and analysis of schemes for adapting migration intervals in parallel evolutionary algorithms. Evol. Comput. 23(4), 559\u2013582 (2015)","journal-title":"Evol. Comput."},{"key":"40_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/978-3-030-58112-1_46","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"A Rajabi","year":"2020","unstructured":"Rajabi, A., Witt, C.: Evolutionary algorithms with self-adjusting asymmetric mutation. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 664\u2013677. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_46"},{"key":"40_CR50","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Self-adjusting evolutionary algorithms for multimodal optimization. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1314\u20131322 (2020)","DOI":"10.1145\/3377930.3389833"},{"key":"40_CR51","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-81283-5_8","volume-title":"Simulationsmethoden in der Medizin und Biologie","author":"I Rechenberg","year":"1978","unstructured":"Rechenberg, I.: Evolutionsstrategien. In: Schneider, B., Ranft, U. (eds.) Simulationsmethoden in der Medizin und Biologie, pp. 83\u2013114. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/978-3-642-81283-5_8"},{"key":"40_CR52","doi-asserted-by":"crossref","unstructured":"Rodionova, A., Antonov, K., Buzdalova, A., Doerr, C.: Offspring population size matters when comparing evolutionary algorithms with self-adjusting mutation rates. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 855\u2013863 (2019)","DOI":"10.1145\/3321707.3321827"},{"key":"40_CR53","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2013.09.036","volume":"545","author":"JE Rowe","year":"2014","unstructured":"Rowe, J.E., Sudholt, D.: The choice of the offspring population size in the (1, $$\\lambda $$) evolutionary algorithm. Theoret. Comput. Sci. 545, 20\u201338 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"40_CR54","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"M Schumer","year":"1968","unstructured":"Schumer, M., Steiglitz, K.: Adaptive step size random search. IEEE Trans. Autom. Control 13(3), 270\u2013276 (1968)","journal-title":"IEEE Trans. Autom. Control"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:03:00Z","timestamp":1710259380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}