{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T00:06:55Z","timestamp":1774397215918,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583131.3590488","type":"proceedings-article","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T19:40:19Z","timestamp":1689190819000},"page":"1602-1610","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1669-9253","authenticated-orcid":false,"given":"Joost","family":"Jorritsma","sequence":"first","affiliation":[{"name":"TU Eindhoven, Eindhoven, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0004-7629","authenticated-orcid":false,"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6020-1646","authenticated-orcid":false,"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[{"name":"University of Passau, Passau, Germany"}]}],"member":"320","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321838"},{"key":"e_1_3_2_1_2_1","first-page":"87","article-title":"Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081)","volume":"12","author":"Auger Anne","year":"2022","unstructured":"Anne Auger , Carlos M. Fonseca , Tobias Friedrich , Johannes Lengler , and Armand Gissler . 2022 . Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081) . Dagstuhl Reports 12 , 2 (2022), 87 -- 102 . Anne Auger, Carlos M. Fonseca, Tobias Friedrich, Johannes Lengler, and Armand Gissler. 2022. Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081). Dagstuhl Reports 12, 2 (2022), 87--102.","journal-title":"Dagstuhl Reports"},{"key":"e_1_3_2_1_3_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 Parallel Problem Solving from Nature (PPSN 2014). Springer , 892--901. Golnaz Badkobeh, Per Kristian Lehre, and Dirk Sudholt. 2014. Unbiased Black-Box Complexity of Parallel Search. In Parallel Problem Solving from Nature (PPSN 2014). Springer, 892--901."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450218.3477309"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00881-0"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17457"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459398"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.09.024"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389823"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00780-w"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9585-3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463569"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00195"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14721-0_41"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0214-z"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389277"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450218.3477306"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459338"},{"key":"e_1_3_2_1_21_1","volume-title":"Hard Problems Are Easier for Success-Based Parameter Control. In Genetic and Evolutionary Computation Conference (GECCO","author":"Hevia Fajardo Mario Alejandro","year":"2022","unstructured":"Mario Alejandro Hevia Fajardo and Dirk Sudholt . 2022 . Hard Problems Are Easier for Success-Based Parameter Control. In Genetic and Evolutionary Computation Conference (GECCO 2022). 796--804. Mario Alejandro Hevia Fajardo and Dirk Sudholt. 2022. Hard Problems Are Easier for Success-Based Parameter Control. In Genetic and Evolutionary Computation Conference (GECCO 2022). 796--804."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCI.2007.372143"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_24_1","volume-title":"Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima. arXiv preprint arXiv:2304.09712","author":"Jorritsma Joost","year":"2023","unstructured":"Joost Jorritsma , Johannes Lengler , and Dirk Sudholt . 2023. Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima. arXiv preprint arXiv:2304.09712 ( 2023 ). Joost Jorritsma, Johannes Lengler, and Dirk Sudholt. 2023. Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima. arXiv preprint arXiv:2304.09712 (2023)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14721-0_40"},{"key":"e_1_3_2_1_26_1","volume-title":"One-Max Is Not the Easiest Function for Fitness Improvements. In 23rd European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP","author":"Kaufmann Marc","year":"2023","unstructured":"Marc Kaufmann , Maxime Larcher , Johannes Lengler , and Xun Zou . 2023 . One-Max Is Not the Easiest Function for Fitness Improvements. In 23rd European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2023). Springer, 162--178. Marc Kaufmann, Maxime Larcher, Johannes Lengler, and Xun Zou. 2023. One-Max Is Not the Easiest Function for Fitness Improvements. In 23rd European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2023). Springer, 162--178."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967671"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15844-5_25"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001855"},{"key":"e_1_3_2_1_30_1","volume-title":"More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments. Algorithmica","author":"Lehre Per Kristian","year":"2022","unstructured":"Per Kristian Lehre and Xiaoyu Qin . 2022. More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments. Algorithmica ( 2022 ), 1--46. Per Kristian Lehre and Xiaoyu Qin. 2022. More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments. Algorithmica (2022), 1--46."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2954234"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548320000565"},{"key":"e_1_3_2_1_33_1","volume-title":"Theory of Evolutionary Computation","author":"Lengler Johannes","unstructured":"Johannes Lengler . 2020. Drift analysis . In Theory of Evolutionary Computation . Springer , 89--131. Johannes Lengler. 2020. Drift analysis. In Theory of Evolutionary Computation. Springer, 89--131."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.036"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2202241"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"}],"event":{"name":"GECCO '23: Genetic and Evolutionary Computation Conference","location":"Lisbon Portugal","acronym":"GECCO '23","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590488","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583131.3590488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:04Z","timestamp":1750178824000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590488"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,12]]},"references-count":36,"alternative-id":["10.1145\/3583131.3590488","10.1145\/3583131"],"URL":"https:\/\/doi.org\/10.1145\/3583131.3590488","relation":{},"subject":[],"published":{"date-parts":[[2023,7,12]]},"assertion":[{"value":"2023-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}