{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:31Z","timestamp":1759847971945,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100009094","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["17-71-20178"],"award-info":[{"award-number":["17-71-20178"]}],"id":[{"id":"10.13039\/100009094","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3377929.3398148","type":"proceedings-article","created":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T21:02:12Z","timestamp":1594242132000},"page":"1669-1677","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["The (1 + (\n            <i>\u03bb, \u03bb<\/i>\n            )) genetic algorithm for permutations"],"prefix":"10.1145","author":[{"given":"Anton","family":"Bassin","sequence":"first","affiliation":[{"name":"ITMO University, Saint Petersburg, Russia"}]},{"given":"Maxim","family":"Buzdalov","sequence":"additional","affiliation":[{"name":"ITMO University, Saint Petersburg, Russia"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Denis Antipov Benjamin Doerr and Vitalii Karavaev. 2019. A tight runtime analysis for the (1 + (\u03bb \u03bb)) GA on LeadingOnes. In Foundations of Genetic Algorithms. 169--182.  Denis Antipov Benjamin Doerr and Vitalii Karavaev. 2019. A tight runtime analysis for the (1 + ( \u03bb \u03bb )) GA on LeadingOnes. In Foundations of Genetic Algorithms. 169--182.","key":"e_1_3_2_1_1_1","DOI":"10.1145\/3299904.3340317"},{"doi-asserted-by":"crossref","unstructured":"Thomas B\u00e4ck David B. Fogel and Zbigniew Michalewicz (Eds.). 2000. Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing.  Thomas B\u00e4ck David B. Fogel and Zbigniew Michalewicz (Eds.). 2000. Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing.","key":"e_1_3_2_1_2_1","DOI":"10.1201\/9781420034349"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/3319619.3322067"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/3071178.3071297"},{"unstructured":"Eduardo Carvalho Pinto and Carola Doerr. 2018. Towards a more practice-aware runtime analysis of evolutionary algorithms. https:\/\/arxiv.org\/abs\/1812.00493  Eduardo Carvalho Pinto and Carola Doerr. 2018. Towards a more practice-aware runtime analysis of evolutionary algorithms. https:\/\/arxiv.org\/abs\/1812.00493","key":"e_1_3_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1162\/evco_a_00219"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/3071178.3071285"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/TEVC.2017.2753538"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/TEVC.2017.2745715"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/3321707.3321783"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/s00453-017-0354-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1016\/j.tcs.2014.11.028"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1967654.1967669"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/s00453-012-9622-x"},{"volume-title":"Proceedings of Genetic and Evolutionary Computation Conference. 1415--1422","author":"Doerr Benjamin","unstructured":"Benjamin Doerr , Frank Neumann , and Andrew M. Sutton . 2015. Improved runtime bounds for the (1+1) EA on random 3-CNF formulas based on fitness-distance correlation . In Proceedings of Genetic and Evolutionary Computation Conference. 1415--1422 . Benjamin Doerr, Frank Neumann, and Andrew M. Sutton. 2015. Improved runtime bounds for the (1+1) EA on random 3-CNF formulas based on fitness-distance correlation. In Proceedings of Genetic and Evolutionary Computation Conference. 1415--1422.","key":"e_1_3_2_1_15_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/CEC.2017.7969505"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1007\/s00453-018-0429-2"},{"volume-title":"Proceedings of Genetic and Evolutionary Computation Conference. 785--792","author":"Goldman B. W.","unstructured":"B. W. Goldman and W. F. Punch . 2014. Parameter-less population pyramid . In Proceedings of Genetic and Evolutionary Computation Conference. 785--792 . B. W. Goldman and W. F. Punch. 2014. Parameter-less population pyramid. In Proceedings of Genetic and Evolutionary Computation Conference. 785--792.","key":"e_1_3_2_1_18_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1007\/s00453-002-0940-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/1967654.1967656"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1016\/j.tcs.2019.08.021"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/3377930.3390212"},{"key":"e_1_3_2_1_23_1","series-title":"Lecture Notes in Computer Science","volume-title":"Parallel Problem Solving from Nature - PPSN XV","author":"Pinto Eduardo Carvalho","unstructured":"Eduardo Carvalho Pinto and Carola Doerr . 2018. A simple proof for the usefulness of crossover in black-box optimization . In Parallel Problem Solving from Nature - PPSN XV , Vol. 2 . Number 11102 in Lecture Notes in Computer Science . 29--41. Eduardo Carvalho Pinto and Carola Doerr. 2018. A simple proof for the usefulness of crossover in black-box optimization. In Parallel Problem Solving from Nature - PPSN XV, Vol. 2. Number 11102 in Lecture Notes in Computer Science. 29--41."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/2001576.2001850"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/3071178.3071304"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/1068009.1068202"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1162\/EVCO_a_00171"},{"key":"e_1_3_2_1_29_1","series-title":"Lecture Notes in Computer Science","volume-title":"Sutton and Frank Neumann","author":"Andrew","year":"2014","unstructured":"Andrew M. Sutton and Frank Neumann . 2014 . Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. In Proceedings of Parallel Problem Solving from Nature. Number 8672 in Lecture Notes in Computer Science . 942--951. Andrew M. Sutton and Frank Neumann. 2014. Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. In Proceedings of Parallel Problem Solving from Nature. Number 8672 in Lecture Notes in Computer Science. 942--951."},{"doi-asserted-by":"crossref","unstructured":"Ingo Wegener. 2003. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In Evolutionary Optimization. Number 48 in International Series in Operations Research & Management Science. 349--369.  Ingo Wegener. 2003. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In Evolutionary Optimization. Number 48 in International Series in Operations Research & Management Science. 349--369.","key":"e_1_3_2_1_30_1","DOI":"10.1007\/0-306-48041-7_14"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1162\/EVCO_a_00184"}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '20","name":"GECCO '20: Genetic and Evolutionary Computation Conference","location":"Canc\u00fan Mexico"},"container-title":["Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377929.3398148","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377929.3398148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:07Z","timestamp":1750200067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377929.3398148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":31,"alternative-id":["10.1145\/3377929.3398148","10.1145\/3377929"],"URL":"https:\/\/doi.org\/10.1145\/3377929.3398148","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}