{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:59Z","timestamp":1759638659971,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7,8]]},"DOI":"10.1145\/3512290.3528720","type":"proceedings-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T13:59:57Z","timestamp":1658152797000},"page":"1390-1398","source":"Crossref","is-referenced-by-count":6,"title":["Towards a stronger theory for permutation-based evolutionary algorithms"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yassine","family":"Ghannane","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marouane Ibn","family":"Brahim","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/3377930.3390172"},{"key":"e_1_3_2_1_2_1","volume-title":"PPSN","author":"Antipov Denis","year":"2020","unstructured":"Denis Antipov , Maxim Buzdalov , and Benjamin Doerr . 2020 . First steps towards a runtime analysis when starting with a good solution. In Parallel Problem Solving From Nature , PPSN 2020, Part II. Springer, 560--573. Denis Antipov, Maxim Buzdalov, and Benjamin Doerr. 2020. First steps towards a runtime analysis when starting with a good solution. In Parallel Problem Solving From Nature, PPSN 2020, Part II. Springer, 560--573."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/3449639.3459377"},{"key":"e_1_3_2_1_4_1","volume-title":"PPSN","author":"Antipov Denis","year":"2020","unstructured":"Denis Antipov and Benjamin Doerr . 2020 . Runtime analysis of a heavy-tailed (1 + (\u03bb, \u03bb)) genetic algorithm on jump functions. In Parallel Problem Solving From Nature , PPSN 2020, Part II. Springer, 545--559. Denis Antipov and Benjamin Doerr. 2020. Runtime analysis of a heavy-tailed (1 + (\u03bb, \u03bb)) genetic algorithm on jump functions. In Parallel Problem Solving From Nature, PPSN 2020, Part II. Springer, 545--559."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/3377930.3390148"},{"doi-asserted-by":"crossref","unstructured":"Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics. World Scientific Publishing.  Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics. World Scientific Publishing.","key":"e_1_3_2_1_6_1","DOI":"10.1142\/7438"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/3377929.3398148"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/3449639.3459350"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/TEVC.2017.2753538"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1162\/EVCO_a_00147"},{"key":"e_1_3_2_1_11_1","first-page":"1","article-title":"Automatic adaptation of hypermutation rates for multimodal optimisation. In Foundations of Genetic Algorithms, FOGA 2021","volume":"4","author":"Corus Dogan","year":"2021","unstructured":"Dogan Corus , Pietro S. Oliveto , and Donya Yazdani . 2021 . Automatic adaptation of hypermutation rates for multimodal optimisation. In Foundations of Genetic Algorithms, FOGA 2021 . ACM , 4 : 1 -- 4 :12. Dogan Corus, Pietro S. Oliveto, and Donya Yazdani. 2021. Automatic adaptation of hypermutation rates for multimodal optimisation. In Foundations of Genetic Algorithms, FOGA 2021. ACM, 4:1--4:12.","journal-title":"ACM"},{"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. 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."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/TEVC.2017.2724201"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/3377930.3389844"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/3449639.3459313"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/3377930.3389823"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1007\/s00453-020-00780-w"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1162\/EVCO_a_00158"},{"key":"e_1_3_2_1_19_1","volume-title":"Towards a Stronger Theory for Permutation-based Evolutionary Algorithms. CoRR","author":"Doerr Benjamin","year":"2022","unstructured":"Benjamin Doerr , Yassine Ghannane , and Marouane Ibn Brahim . 2022. Towards a Stronger Theory for Permutation-based Evolutionary Algorithms. CoRR ( 2022 ). Benjamin Doerr, Yassine Ghannane, and Marouane Ibn Brahim. 2022. Towards a Stronger Theory for Permutation-based Evolutionary Algorithms. CoRR (2022)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1109\/CEC.2008.4631286"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1162\/evco.2007.15.4.401"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1276958.1277192"},{"key":"e_1_3_2_1_23_1","volume-title":"FOCI","author":"Doerr Benjamin","year":"2007","unstructured":"Benjamin Doerr , Christian Klein , and Tobias Storch . 2007 . Faster evolutionary algorithms by superior graph representation. In Foundations of Computational Intelligence , FOCI 2007. IEEE, 245--250. Benjamin Doerr, Christian Klein, and Tobias Storch. 2007. Faster evolutionary algorithms by superior graph representation. In Foundations of Computational Intelligence, FOCI 2007. IEEE, 245--250."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/3071178.3071301"},{"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 https:\/\/cs.adelaide.edu.au\/~frank\/papers\/TheoryBook2019-selfarchived.pdf.  Benjamin Doerr and Frank Neumann (Eds.). 2020. Theory of Evolutionary Computation---Recent Developments in Discrete Optimization. Springer. Also available at https:\/\/cs.adelaide.edu.au\/~frank\/papers\/TheoryBook2019-selfarchived.pdf.","key":"e_1_3_2_1_25_1","DOI":"10.1007\/978-3-030-29414-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/978-3-031-04148-8_13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/3449726.3462719"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1016\/S0304-3975(01)00182-7"},{"doi-asserted-by":"crossref","unstructured":"A. E. Eiben and J. E. Smith. 2015. Introduction to Evolutionary Computing (2nd ed.). Springer.  A. E. Eiben and J. E. Smith. 2015. Introduction to Evolutionary Computing (2nd ed.). Springer.","key":"e_1_3_2_1_29_1","DOI":"10.1007\/978-3-662-44874-8"},{"key":"e_1_3_2_1_30_1","volume-title":"PPSN","author":"Friedrich Tobias","year":"2018","unstructured":"Tobias Friedrich , Andreas G\u00f6bel , Francesco Quinzan , and Markus Wagner . 2018 . Heavy-tailed mutation operators in single-objective combinatorial optimization. In Parallel Problem Solving from Nature , PPSN 2018, Part I. Springer, 134--145. Tobias Friedrich, Andreas G\u00f6bel, Francesco Quinzan, and Markus Wagner. 2018. Heavy-tailed mutation operators in single-objective combinatorial optimization. In Parallel Problem Solving from Nature, PPSN 2018, Part I. Springer, 134--145."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/3205455.3205515"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1007\/s00453-018-0429-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/3205455.3205608"},{"volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","unstructured":"Thomas Jansen . 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective . Springer . Thomas Jansen. 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer.","key":"e_1_3_2_1_34_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1007\/s00453-002-0940-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1007\/s11047-021-09856-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1162\/evco_a_00199"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1016\/j.cor.2006.12.009"},{"volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"Neumann Frank","unstructured":"Frank Neumann and Carsten Witt . 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity . Springer . Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer.","key":"e_1_3_2_1_39_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1007\/s11047-021-09841-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1145\/3377930.3389833"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1145\/3449639.3459336"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1145\/3299904.3340305"},{"volume-title":"Convergence Properties of Evolutionary Algorithms","author":"Rudolph G\u00fcnter","unstructured":"G\u00fcnter Rudolph . 1997. Convergence Properties of Evolutionary Algorithms . Verlag Dr . Kov\u00e2c. G\u00fcnter Rudolph. 1997. Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kov\u00e2c.","key":"e_1_3_2_1_44_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_46_1","volume-title":"AAAI Conference on Artificial Intelligence, AAAI","author":"Andrew","year":"2012","unstructured":"Andrew M. Sutton and Frank Neumann. 2012. A parameterized runtime analysis of evolutionary algorithms for the Euclidean traveling salesperson problem . In AAAI Conference on Artificial Intelligence, AAAI 2012 . AAAI Press, 1105--1111. Andrew M. Sutton and Frank Neumann. 2012. A parameterized runtime analysis of evolutionary algorithms for the Euclidean traveling salesperson problem. In AAAI Conference on Artificial Intelligence, AAAI 2012. AAAI Press, 1105--1111."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.1162\/EVCO_a_00119"},{"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","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. 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_50_1","volume-title":"ICIC","author":"Wu Mengxi","year":"2018","unstructured":"Mengxi Wu , Chao Qian , and Ke Tang . 2018 . Dynamic mutation based Pareto optimization for subset selection. In Intelligent Computing Methodologies , ICIC 2018, Part III. Springer, 25--35. Mengxi Wu, Chao Qian, and Ke Tang. 2018. Dynamic mutation based Pareto optimization for subset selection. In Intelligent Computing Methodologies, ICIC 2018, Part III. Springer, 25--35."}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '22","name":"GECCO '22: Genetic and Evolutionary Computation Conference","location":"Boston Massachusetts"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528720","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:29Z","timestamp":1750186829000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":50,"alternative-id":["10.1145\/3512290.3528720","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528720","relation":{},"subject":[],"published":{"date-parts":[[2022,7,8]]}}}