{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:59:20Z","timestamp":1783749560208,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"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":["ANR11IDEX000302,ANR11LABEX0045DIGICOSME, ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR11IDEX000302,ANR11LABEX0045DIGICOSME, 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":[[2017,7]]},"DOI":"10.1145\/3071178.3071301","type":"proceedings-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T17:59:28Z","timestamp":1498845568000},"page":"777-784","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":191,"title":["Fast genetic algorithms"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huu Phuoc","family":"Le","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R\u00e9gis","family":"Makhmara","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ta Duy","family":"Nguyen","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Anne Auger and Benjamin Doerr. 2011. Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific.   Anne Auger and Benjamin Doerr. 2011. Theory of Randomized Search Heuristics: Foundations and Recent Developments . World Scientific.","DOI":"10.1142\/7438"},{"key":"e_1_3_2_1_2_1","unstructured":"Thomas B\u00e4ck. 1993. Optimal mutation rates in genetic search. In ICGA. Morgan Kaufmann 2--8.   Thomas B\u00e4ck. 1993. Optimal mutation rates in genetic search. In ICGA . Morgan Kaufmann 2--8."},{"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 XIII. 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 XIII. Springer, 892--901."},{"key":"e_1_3_2_1_4_1","volume-title":"PPSN (1) (Lecture Notes in Computer Science)","author":"B\u00f6ttcher S\u00fcntje","unstructured":"S\u00fcntje B\u00f6ttcher , Benjamin Doerr , and Frank Neumann . 2010. Optimal fixed and adaptive mutation rates for the LeadingOnes problem . In PPSN (1) (Lecture Notes in Computer Science) , 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 PPSN (1) (Lecture Notes in Computer Science), Vol. 6238. Springer, 1--10."},{"key":"e_1_3_2_1_5_1","volume-title":"Pietro Simone Oliveto, Dirk Sudholt, and Andrew M. Sutton.","author":"Dang Duc-Cuong","year":"2016","unstructured":"Duc-Cuong Dang , Tobias Friedrich , Timo K\u00f6tzing , Martin S. Krejca , Per Kristian Lehre , Pietro Simone Oliveto, Dirk Sudholt, and Andrew M. Sutton. 2016 . Emergence of diversity and its benefits for crossover in genetic algorithms. In PPSN (Lecture Notes in Computer Science), Vol. 9921 . Springer , 890--900. Duc-Cuong Dang, Tobias Friedrich, Timo K\u00f6tzing, Martin S. Krejca, Per Kristian Lehre, Pietro Simone Oliveto, Dirk Sudholt, and Andrew M. Sutton. 2016. Emergence of diversity and its benefits for crossover in genetic algorithms. In PPSN (Lecture Notes in Computer Science), Vol. 9921. Springer, 890--900."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908956"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0103-x"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071279"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.10.035"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.10.059"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.03.015"},{"key":"e_1_3_2_1_13_1","volume-title":"R\u00e9gis Makhmara, and Ta Duy Nguyen.","author":"Doerr Benjamin","year":"2017","unstructured":"Benjamin Doerr , Huu Phuoc Le , R\u00e9gis Makhmara, and Ta Duy Nguyen. 2017 . Fast genetic algorithms. ArXiv e-prints (March 2017). arXiv:1703.03334 Benjamin Doerr, Huu Phuoc Le, R\u00e9gis Makhmara, and Ta Duy Nguyen. 2017. Fast genetic algorithms. ArXiv e-prints (March 2017). arXiv:1703.03334"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.04.002"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00003"},{"key":"e_1_3_2_1_17_1","volume-title":"STACS (Lecture Notes in Computer Science)","author":"Giel Oliver","unstructured":"Oliver Giel and Ingo Wegener . 2003. Evolutionary algorithms and the maximum matching problem . In STACS (Lecture Notes in Computer Science) , Vol. 2607 . Springer , 415--426. Oliver Giel and Ingo Wegener. 2003. Evolutionary algorithms and the maximum matching problem. In STACS (Lecture Notes in Computer Science), Vol. 2607. Springer, 415--426."},{"key":"e_1_3_2_1_18_1","volume-title":"Searching randomly for maximum matchings. Electronic Colloquium on Computational Complexity (ECCC) 076","author":"Giel Oliver","year":"2004","unstructured":"Oliver Giel and Ingo Wegener . 2004. Searching randomly for maximum matchings. Electronic Colloquium on Computational Complexity (ECCC) 076 ( 2004 ). Oliver Giel and Ingo Wegener. 2004. Searching randomly for maximum matchings. Electronic Colloquium on Computational Complexity (ECCC) 076 (2004)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754738"},{"key":"e_1_3_2_1_20_1","unstructured":"GitHub. 2017. Fast genetic algorithms. (2017). https:\/\/github.com\/FastGA\/fast-genetic-algorithms.  GitHub. 2017. Fast genetic algorithms. (2017). https:\/\/github.com\/FastGA\/fast-genetic-algorithms."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_7"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.02.019"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.01.002"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001711"},{"key":"e_1_3_2_1_26_1","volume-title":"How genetic algorithms really work: Mutation and hillclimbing","author":"M\u00fchlenbein Heinz","unstructured":"Heinz M\u00fchlenbein . 1992. How genetic algorithms really work: Mutation and hillclimbing . In PPSN. Elsevier , 15--26. Heinz M\u00fchlenbein. 1992. How genetic algorithms really work: Mutation and hillclimbing. In PPSN. Elsevier, 15--26."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_28_1","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 Berlin Heidelberg . Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Springer Berlin Heidelberg."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1570256.1570322"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830761.1830791"},{"key":"e_1_3_2_1_31_1","unstructured":"G\u00fcnter Rudolph. 1997. Convergence Properties of Evolutionary Algorithms. Kovac.  G\u00fcnter Rudolph. 1997. Convergence Properties of Evolutionary Algorithms . Kovac."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001692"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.047"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068202"},{"key":"e_1_3_2_1_36_1","volume-title":"Hartley","author":"Szu Harold H.","year":"1987","unstructured":"Harold H. Szu and Ralph L . Hartley . 1987 . Fast simulated annealing. Physics Letters A 122 (June 1987), 157--162. Harold H. Szu and Ralph L. Hartley. 1987. Fast simulated annealing. Physics Letters A 122 (June 1987), 157--162."},{"key":"e_1_3_2_1_37_1","volume-title":"ICALP (Lecture Notes in Computer Science)","author":"Wegener Ingo","unstructured":"Ingo Wegener . 2001. Theoretical aspects of evolutionary algorithms . In ICALP (Lecture Notes in Computer Science) , Vol. 2076 . Springer , 64--78. Ingo Wegener. 2001. Theoretical aspects of evolutionary algorithms. In ICALP (Lecture Notes in Computer Science), Vol. 2076. Springer, 64--78."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365606776022751"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"},{"key":"e_1_3_2_1_41_1","volume-title":"Evolutionary Programming (Lecture Notes in Computer Science)","author":"Yao Xin","unstructured":"Xin Yao and Yong Liu . 1997. Fast evolution strategies . In Evolutionary Programming (Lecture Notes in Computer Science) , Vol. 1213 . Springer , 151--162. Xin Yao and Yong Liu. 1997. Fast evolution strategies. In Evolutionary Programming (Lecture Notes in Computer Science), Vol. 1213. Springer, 151--162."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771163"}],"event":{"name":"GECCO '17: Genetic and Evolutionary Computation Conference","location":"Berlin Germany","acronym":"GECCO '17","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\/3071178.3071301","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:05Z","timestamp":1750217405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":42,"alternative-id":["10.1145\/3071178.3071301","10.1145\/3071178"],"URL":"https:\/\/doi.org\/10.1145\/3071178.3071301","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"2017-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}