{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:48:36Z","timestamp":1766137716687,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","award":["739621"],"award-info":[{"award-number":["739621"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,26]]},"DOI":"10.1145\/3449639.3459338","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T17:51:58Z","timestamp":1624297918000},"page":"1151-1159","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Self-adjusting population sizes for non-elitist evolutionary algorithms"],"prefix":"10.1145","author":[{"given":"Mario Alejandro","family":"Hevia Fajardo","sequence":"first","affiliation":[{"name":"University of Sheffield, Sheffield, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[{"name":"University of Passau, Passau, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Per Kristian Lehre, and Dirk Sudholt","author":"Badkobeh Golnaz","year":"2014","unstructured":"Golnaz Badkobeh , Per Kristian Lehre, and Dirk Sudholt . 2014 . Unbiased Black-Box Complexity of Parallel Search. In Proc. of Parallel Problem Solving from Nature - PPSN XIII. Springer , 892--901. Golnaz Badkobeh, Per Kristian Lehre, and Dirk Sudholt. 2014. Unbiased Black-Box Complexity of Parallel Search. In Proc. of Parallel Problem Solving from Nature - PPSN XIII. Springer, 892--901."},{"volume-title":"Proc. of Parallel Problem Solving from Nature - PPSN XI","author":"B\u00f6ttcher S\u00fcntje","key":"e_1_3_2_1_2_1","unstructured":"S\u00fcntje B\u00f6ttcher , Benjamin Doerr , and Frank Neumann . 2010. Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem . In Proc. of Parallel Problem Solving from Nature - PPSN XI , Vol. 6238 . Springer , 1--10. S\u00fcntje B\u00f6ttcher, Benjamin Doerr, and Frank Neumann. 2010. Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. In Proc. of Parallel Problem Solving from Nature - PPSN XI, Vol. 6238. Springer, 1--10."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2985450"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"volume-title":"Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices","author":"Doerr Benjamin","key":"e_1_3_2_1_5_1","unstructured":"Benjamin Doerr and Carola Doerr . 2020. Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices . Springer , 271--321. Benjamin Doerr and Carola Doerr. 2020. Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices. Springer, 271--321."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"volume-title":"Proc. of Parallel Problem Solving from","author":"Doerr Benjamin","key":"e_1_3_2_1_7_1","unstructured":"Benjamin Doerr , Carola Doerr , and Timo K\u00f6tzing . 2016. Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables . In Proc. of Parallel Problem Solving from Nature - PPSN XIV. Springer , 782--791. Benjamin Doerr, Carola Doerr, and Timo K\u00f6tzing. 2016. Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables. In Proc. of Parallel Problem Solving from Nature - PPSN XIV. Springer, 782--791."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321733"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.06.014"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0502-x"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205611"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205569"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023417.31393.c7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390200"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459338"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2010.18.1.18101"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023416.59689.4e"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967671"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"volume-title":"Runtime Analysis of the (&mu","author":"Lengler Johannes","key":"e_1_3_2_1_20_1","unstructured":"Johannes Lengler and Simone Riedi . 2021. Runtime Analysis of the (&mu ; + 1)-EA on the Dynamic BinVal Function. In Evolutionary Computation in Combinatorial Optimization. Springer , 84--99. Johannes Lengler and Simone Riedi. 2021. Runtime Analysis of the (μ + 1)-EA on the Dynamic BinVal Function. In Evolutionary Computation in Combinatorial Optimization. Springer, 84--99."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340309"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5617"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012322"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00258"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00153"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9387-z"},{"key":"e_1_3_2_1_27_1","volume-title":"Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. ArXiv e-prints","author":"Oliveto P. S.","year":"2012","unstructured":"P. S. Oliveto and C. Witt . 2012 . Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. ArXiv e-prints (2012). arXiv:1211.7184 P. S. Oliveto and C. Witt. 2012. Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. ArXiv e-prints (2012). arXiv:1211.7184"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.002"},{"volume-title":"Proc. of Parallel Problem Solving from","author":"Rajabi Amirhossein","key":"e_1_3_2_1_29_1","unstructured":"Amirhossein Rajabi and Carsten Witt . 2020. Evolutionary Algorithms with Self-adjusting Asymmetric Mutation . In Proc. of Parallel Problem Solving from Nature - PPSN XVI. Springer , 664--677. Amirhossein Rajabi and Carsten Witt. 2020. Evolutionary Algorithms with Self-adjusting Asymmetric Mutation. In Proc. of Parallel Problem Solving from Nature - PPSN XVI. Springer, 664--677."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389833"},{"volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Rajabi Amirhossein","key":"e_1_3_2_1_31_1","unstructured":"Amirhossein Rajabi and Carsten Witt . 2021. Stagnation Detection with Randomized Local Search . In Evolutionary Computation in Combinatorial Optimization . Springer , 152--168. Full version available at http:\/\/arxiv.org\/abs\/2101.12054. Amirhossein Rajabi and Carsten Witt. 2021. Stagnation Detection with Randomized Local Search. In Evolutionary Computation in Combinatorial Optimization. Springer, 152--168. Full version available at http:\/\/arxiv.org\/abs\/2101.12054."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.036"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731235"}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lille France","acronym":"GECCO '21"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459338","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449639.3459338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:09Z","timestamp":1750195689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459338"}},"subtitle":["why success rates matter"],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":33,"alternative-id":["10.1145\/3449639.3459338","10.1145\/3449639"],"URL":"https:\/\/doi.org\/10.1145\/3449639.3459338","relation":{},"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"2021-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}