{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:29Z","timestamp":1759847549607,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":57,"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"}],"funder":[{"name":"Agence National de Recherche","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583131.3590509","type":"proceedings-article","created":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T06:46:05Z","timestamp":1708238765000},"page":"990-999","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5283-4208","authenticated-orcid":false,"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"Ecole Polytechnique, Palaiseau, France"},{"name":"Laboratoire d'Informatique (LIX), Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3498-1280","authenticated-orcid":false,"given":"Arthur","family":"Dremaux","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9512-7917","authenticated-orcid":false,"given":"Johannes","family":"Lutzeyer","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9032-8531","authenticated-orcid":false,"given":"Aurelien","family":"Stumpf","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900602"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459377"},{"key":"e_1_3_2_1_3_1","volume-title":"PPSN","author":"Antipov Denis","year":"2020","unstructured":"Denis Antipov and Benjamin Doerr. 2020. Runtime analysis of a heavy-tailed (1 + (\u039b, \u039b)) genetic algorithm on jump functions. In Parallel Problem Solving From Nature, PPSN 2020, Part II. Springer, 545--559."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00907-7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics. World Scientific Publishing.","DOI":"10.1142\/7438"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459367"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459350"},{"key":"e_1_3_2_1_8_1","volume-title":"International Joint Conference on Artificial Intelligence, IJCAI","author":"Bian Chao","year":"2023","unstructured":"Chao Bian, Yawen Zhou, Miqing Li, and Chao Qian. [n. d.]. Stochastic population update can provably be helpful in multi-objective evolutionary algorithms. In International Joint Conference on Artificial Intelligence, IJCAI 2023. to appear."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.71"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00185"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.03.002"},{"key":"e_1_3_2_1_12_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Dang Duc-Cuong","year":"2016","unstructured":"Duc-Cuong Dang, Tobias Friedrich, Timo K\u00f6tzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, and Andrew M. Sutton. 2016. Escaping local optima with diversity mechanisms and crossover. In Genetic and Evolutionary Computation Conference, GECCO 2016. ACM, 645--652."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2724201"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00780-w"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00896-7"},{"volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"Doerr Benjamin","key":"e_1_3_2_1_16_1","unstructured":"Benjamin Doerr and Carola Doerr. 2020. Theory of parameter control for discrete black-box optimization: provable performance gains through dynamic parameter choices. In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, Benjamin Doerr and Frank Neumann (Eds.). Springer, 271--321. Also available at https:\/\/arxiv.org\/abs\/1804.05650."},{"key":"e_1_3_2_1_17_1","volume-title":"How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs. CoRR abs\/2304.10414","author":"Doerr Benjamin","year":"2023","unstructured":"Benjamin Doerr, Arthur Dremaux, Johannes Lutzeyer, and Aur\u00e9lien Stumpf. 2023. How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs. CoRR abs\/2304.10414 (2023). arXiv:2304.10414"},{"key":"e_1_3_2_1_18_1","volume-title":"Krejca","author":"Doerr Benjamin","year":"2023","unstructured":"Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, and Martin S. Krejca. 2023. Lasting Diversity and Superior Runtime Guarantees for the (\u03bc +1) Genetic Algorithm. CoRR abs\/2302.12570 (2023). arXiv:2302.12570"},{"key":"e_1_3_2_1_19_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Doerr Benjamin","year":"2023","unstructured":"Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, and Carsten Witt. 2023. How well does the Metropolis algorithm cope with local optima?. In Genetic and Evolutionary Computation Conference, GECCO 2023. ACM. To appear."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205611"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Benjamin Doerr and Frank Neumann (Eds.). 2020. Theory of Evolutionary Computation---Recent Developments in Discrete Optimization. Springer. Also available at http:\/\/www.lix.polytechnique.fr\/Labo\/Benjamin.Doerr\/doerr_neumann_book.html.","DOI":"10.1007\/978-3-030-29414-4"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3250552"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26462"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26461"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.12.020"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3462719"},{"key":"e_1_3_2_1_29_1","volume-title":"Foundations of Genetic Algorithms, FOGA","author":"Droste Stefan","year":"2000","unstructured":"Stefan Droste, Thomas Jansen, and Ingo Wegener. 2000. Dynamic parameter control in simple evolutionary algorithms. In Foundations of Genetic Algorithms, FOGA 2000. Morgan Kaufmann, 275--294."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908884"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14721-0_31"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36494-3_37"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205608"},{"key":"e_1_3_2_1_35_1","first-page":"1","article-title":"Self-adjusting offspring population sizes outperform fixed parameters on the cliff function. In Foundations of Genetic Algorithms, FOGA 2021","volume":"5","author":"Hevia Fajardo Mario Alejandro","year":"2021","unstructured":"Mario Alejandro Hevia Fajardo and Dirk Sudholt. 2021. Self-adjusting offspring population sizes outperform fixed parameters on the cliff function. In Foundations of Genetic Algorithms, FOGA 2021. ACM, 5:1--5:15.","journal-title":"ACM"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCI.2007.372143"},{"volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","key":"e_1_3_2_1_37_1","unstructured":"Thomas Jansen. 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725507"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.974841"},{"key":"e_1_3_2_1_40_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","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. In Genetic and Evolutionary Computation Conference, GECCO 2023. ACM. To appear."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001711"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460249"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012322"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5617"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00258"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103804"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528776"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"Neumann Frank","key":"e_1_3_2_1_49_1","unstructured":"Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0212-1"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459336"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-00933-z"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00313"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340305"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731235"},{"key":"e_1_3_2_1_56_1","volume-title":"PPSN","author":"Whitley Darrell","year":"2018","unstructured":"Darrell Whitley, Swetha Varadarajan, Rachel Hirsch, and Anirban Mukhopadhyay. 2018. Exploration and exploitation without mutation: solving the jump function in \u0398(n) time. In Parallel Problem Solving from Nature, PPSN 2018, Part II. Springer, 55--66."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.08.014"}],"event":{"name":"GECCO '23: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590509","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583131.3590509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:44Z","timestamp":1750178264000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,12]]},"references-count":57,"alternative-id":["10.1145\/3583131.3590509","10.1145\/3583131"],"URL":"https:\/\/doi.org\/10.1145\/3583131.3590509","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"}}]}}