{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:53:28Z","timestamp":1769925208978,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":51,"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":[{"DOI":"10.13039\/501100004836","name":"Danmarks Frie Forskningsfond","doi-asserted-by":"publisher","award":["DFF-FNU 8021-00260B"],"award-info":[{"award-number":["DFF-FNU 8021-00260B"]}],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583131.3590390","type":"proceedings-article","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T19:40:19Z","timestamp":1689190819000},"page":"1000-1008","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["How Well Does the Metropolis Algorithm Cope With Local Optima?"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5283-4208","authenticated-orcid":false,"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3048-2247","authenticated-orcid":false,"given":"Taha","family":"El Ghazi El Houssaini","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0898-5003","authenticated-orcid":false,"given":"Amirhossein","family":"Rajabi","sequence":"additional","affiliation":[{"name":"Technical University of Denmark, Kgs. Lyngby, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6105-7700","authenticated-orcid":false,"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[{"name":"Technical University of Denmark, Kgs. Lyngby, Denmark"}],"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.1145\/3377930.3390148"},{"key":"e_1_3_2_1_2_1","volume-title":"Evolutionary Programming, Genetic Algorithms","author":"B\u00e4ck Thomas","unstructured":"Thomas B\u00e4ck . 1996. Evolutionary Algorithms in Theory and Practice - Evolution Strategies , Evolutionary Programming, Genetic Algorithms . Oxford University Press . Thomas B\u00e4ck. 1996. Evolutionary Algorithms in Theory and Practice - Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459367"},{"key":"e_1_3_2_1_4_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 . 2023 . Stochastic population update can provably be helpful in multi-objective evolutionary algorithms . In International Joint Conference on Artificial Intelligence, IJCAI 2023. To appear. Chao Bian, Yawen Zhou, Miqing Li, and Chao Qian. 2023. 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_5_1","volume-title":"Escaping Local Optima with Non-Elitist Evolutionary Algorithms. In AAAI Conference on Artificial Intelligence, AAAI","author":"Dang Duc-Cuong","year":"2021","unstructured":"Duc-Cuong Dang , Anton V. Eremeev , and Per Kristian Lehre . 2021 . Escaping Local Optima with Non-Elitist Evolutionary Algorithms. In AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI Press, 12275--12283. Duc-Cuong Dang, Anton V. Eremeev, and Per Kristian Lehre. 2021. Escaping Local Optima with Non-Elitist Evolutionary Algorithms. In AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI Press, 12275--12283."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2724201"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00896-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.06.014"},{"key":"e_1_3_2_1_9_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","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 . In Genetic and Evolutionary Computation Conference, GECCO 2023. ACM. To appear. 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. In Genetic and Evolutionary Computation Conference, GECCO 2023. ACM. To appear."},{"key":"e_1_3_2_1_10_1","volume-title":"Amirhossein Rajabi, and Carsten Witt.","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? CoRR ( 2023). Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, and Carsten Witt. 2023. How Well Does the Metropolis Algorithm Cope With Local Optima? CoRR (2023)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3250552"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26462"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26461"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.12.020"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3462719"},{"key":"e_1_3_2_1_18_1","volume-title":"Thompson","author":"Dowsland Kathryn A.","year":"2012","unstructured":"Kathryn A. Dowsland and Jonathan M . Thompson . 2012 . Simulated annealing. In Handbook of Natural Computing, Grzegorz Rozenberg, Thomas B\u00e4ck, and Joost N. Kok (Eds.). Springer , 1623--1655. Kathryn A. Dowsland and Jonathan M. Thompson. 2012. Simulated annealing. In Handbook of Natural Computing, Grzegorz Rozenberg, Thomas B\u00e4ck, and Joost N. Kok (Eds.). Springer, 1623--1655."},{"key":"e_1_3_2_1_19_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. 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_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14721-0_31"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36494-3_37"},{"key":"e_1_3_2_1_23_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. 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_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCI.2007.372143"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725507"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0940-2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.06.003"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00133-9"},{"key":"e_1_3_2_1_29_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. 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_30_1","volume-title":"PPSN","author":"Lehre Per Kristian","year":"2010","unstructured":"Per Kristian Lehre . 2010 . Negative drift in populations. In Parallel Problem Solving from Nature , PPSN 2010. Springer, 244--253. Per Kristian Lehre. 2010. Negative drift in populations. In Parallel Problem Solving from Nature, PPSN 2010. Springer, 244--253."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001855"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340316"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460249"},{"key":"e_1_3_2_1_34_1","volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"Lengler Johannes","unstructured":"Johannes Lengler . 2020. Drift analysis . In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization , Benjamin Doerr and Frank Neumann (Eds.). Springer , 89--131. Also available at https:\/\/arxiv.org\/abs\/1712.00964. Johannes Lengler. 2020. Drift analysis. In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, Benjamin Doerr and Frank Neumann (Eds.). Springer, 89--131. Also available at https:\/\/arxiv.org\/abs\/1712.00964."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103804"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"e_1_3_2_1_37_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Ochoa Gabriela","year":"2002","unstructured":"Gabriela Ochoa . 2002 . Setting the mutation rate: scope and limitations of the 1\/L heuristic . In Genetic and Evolutionary Computation Conference, GECCO 2002. Morgan Kaufmann, 495--502. Gabriela Ochoa. 2002. Setting the mutation rate: scope and limitations of the 1\/L heuristic. In Genetic and Evolutionary Computation Conference, GECCO 2002. Morgan Kaufmann, 495--502."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0369-2"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0212-1"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459336"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-00933-z"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00313"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340305"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.036"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.46160"},{"key":"e_1_3_2_1_46_1","volume-title":"Aarts","author":"van Laarhoven Peter J. M.","year":"1987","unstructured":"Peter J. M. van Laarhoven and Emile H. L . Aarts . 1987 . Simulated Annealing : Theory and Applications. Mathematics and Its Applications, Vol. 37 . Springer . Peter J. M. van Laarhoven and Emile H. L. Aarts. 1987. Simulated Annealing: Theory and Applications. Mathematics and Its Applications, Vol. 37. Springer."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/234"},{"key":"e_1_3_2_1_48_1","volume-title":"Automata","author":"Wegener Ingo","year":"2001","unstructured":"Ingo Wegener . 2001. Theoretical aspects of evolutionary algorithms . In Automata , Languages and Programming, ICALP 2001 . Springer , 64--78. Ingo Wegener. 2001. Theoretical aspects of evolutionary algorithms. In Automata, Languages and Programming, ICALP 2001. Springer, 64--78."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"},{"key":"e_1_3_2_1_50_1","first-page":"1","article-title":"On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms. In Foundations of Genetic Algorithms, FOGA 2021","volume":"2","author":"Witt Carsten","year":"2021","unstructured":"Carsten Witt . 2021 . On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms. In Foundations of Genetic Algorithms, FOGA 2021 . ACM , 2 : 1 -- 2 :15. Carsten Witt. 2021. On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms. In Foundations of Genetic Algorithms, FOGA 2021. ACM, 2:1--2:15.","journal-title":"ACM"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.08.014"}],"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.3590390","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583131.3590390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:49Z","timestamp":1750182529000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,12]]},"references-count":51,"alternative-id":["10.1145\/3583131.3590390","10.1145\/3583131"],"URL":"https:\/\/doi.org\/10.1145\/3583131.3590390","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"}}]}}