{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T19:22:19Z","timestamp":1769196139460,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":54,"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, LabEx LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH, LabEx 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":[[2022,7,8]]},"DOI":"10.1145\/3512290.3528868","type":"proceedings-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T15:32:35Z","timestamp":1660750355000},"page":"520-528","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["The (1 + (\u03bb, \u03bb)) global SEMO algorithm"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omar El","family":"Hadri","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrien","family":"Pinard","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","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."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459377"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469800"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00731-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340317"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390148"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321838"},{"key":"e_1_3_2_1_9_1","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.","DOI":"10.1142\/7438"},{"key":"e_1_3_2_1_10_1","volume-title":"Running Time Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) using Binary or Stochastic Tournament Selection. CoRR abs\/2203.11550","author":"Bian Chao","year":"2022","unstructured":"Chao Bian and Chao Qian . 2022. Running Time Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) using Binary or Stochastic Tournament Selection. CoRR abs\/2203.11550 ( 2022 ). Chao Bian and Chao Qian. 2022. Running Time Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) using Binary or Stochastic Tournament Selection. CoRR abs\/2203.11550 (2022)."},{"key":"e_1_3_2_1_11_1","volume-title":"PPSN","author":"Brockhoff Dimo","year":"2008","unstructured":"Dimo Brockhoff , Tobias Friedrich , and Frank Neumann . 2008 . Analyzing hyper-volume indicator based algorithms. In Parallel Problem Solving from Nature , PPSN 2008. Springer, 651--660. Dimo Brockhoff, Tobias Friedrich, and Frank Neumann. 2008. Analyzing hyper-volume indicator based algorithms. In Parallel Problem Solving from Nature, PPSN 2008. Springer, 651--660."},{"key":"e_1_3_2_1_12_1","volume-title":"EMO","author":"B\u00fcche Dirk","year":"2003","unstructured":"Dirk B\u00fcche , Sibylle D. M\u00fcller , and Petros Koumoutsakos . 2003 . Self-adaptation for multi-objective evolutionary algorithms. In Evolutionary Multi-Criterion Optimization , EMO 2003. Springer, 267--281. Dirk B\u00fcche, Sibylle D. M\u00fcller, and Petros Koumoutsakos. 2003. Self-adaptation for multi-objective evolutionary algorithms. In Evolutionary Multi-Criterion Optimization, EMO 2003. Springer, 267--281."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071297"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.09.024"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"key":"e_1_3_2_1_17_1","volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"Doerr Benjamin","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. 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_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908827"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_21_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 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.","DOI":"10.1007\/978-3-030-29414-4"},{"key":"e_1_3_2_1_22_1","volume-title":"A First Runtime Analysis of the NSGA-II on a Multimodal Problem. CoRR abs\/2204.07637","author":"Doerr Benjamin","year":"2022","unstructured":"Benjamin Doerr and Zhongdi Qu. 2022. A First Runtime Analysis of the NSGA-II on a Multimodal Problem. CoRR abs\/2204.07637 ( 2022 ). arXiv:2204.07637 Benjamin Doerr and Zhongdi Qu. 2022. A First Runtime Analysis of the NSGA-II on a Multimodal Problem. CoRR abs\/2204.07637 (2022). arXiv:2204.07637"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3462719"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1177-z"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390200"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.2.173"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299908"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00013"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5615"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012296"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2007.15.1.1"},{"key":"e_1_3_2_1_33_1","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","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.06.007"},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of the 7th International Mendel Conference on Soft Computing, MENDEL","author":"Laumanns Marco","year":"2001","unstructured":"Marco Laumanns , G\u00fcnter Rudolph , and Hans-Paul Schwefel . 2001 . Mutation control and convergence in evolutionary multi-objective optimization . In Proceedings of the 7th International Mendel Conference on Soft Computing, MENDEL 2001. 24--29. Marco Laumanns, G\u00fcnter Rudolph, and Hans-Paul Schwefel. 2001. Mutation control and convergence in evolutionary multi-objective optimization. In Proceedings of the 7th International Mendel Conference on Soft Computing, MENDEL 2001. 24--29."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.823470"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45712-7_5"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2501315"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012322"},{"key":"e_1_3_2_1_42_1","volume-title":"PPSN","author":"M\u00fchlenbein Heinz","year":"1992","unstructured":"Heinz M\u00fchlenbein . 1992 . How genetic algorithms really work: mutation and hillclimbing. In Parallel Problem Solving from Nature , PPSN 1992. Elsevier, 15--26. Heinz M\u00fchlenbein. 1992. How genetic algorithms really work: mutation and hillclimbing. In Parallel Problem Solving from Nature, PPSN 1992. Elsevier, 15--26."},{"key":"e_1_3_2_1_43_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 . Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103345"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.06.009"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389833"},{"key":"e_1_3_2_1_47_1","volume-title":"Friedrich Fromman Verlag (G\u00fcnther Holzboog KG)","author":"Rechenberg Ingo","unstructured":"Ingo Rechenberg . 1973. Evolutionsstrategie. Friedrich Fromman Verlag (G\u00fcnther Holzboog KG) , Stuttgart . Ingo Rechenberg. 1973. Evolutionsstrategie. Friedrich Fromman Verlag (G\u00fcnther Holzboog KG), Stuttgart."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.036"},{"key":"e_1_3_2_1_49_1","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_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1968.1098903"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0480-z"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365606776022751"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528847"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21283"}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","location":"Boston Massachusetts","acronym":"GECCO '22","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\/3512290.3528868","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:57Z","timestamp":1750183797000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":54,"alternative-id":["10.1145\/3512290.3528868","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528868","relation":{},"subject":[],"published":{"date-parts":[[2022,7,8]]},"assertion":[{"value":"2022-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}