{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T01:04:05Z","timestamp":1778461445020,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":33,"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\/501100010877","name":"Science, Technology and Innovation Commission of Shenzhen Municipality","doi-asserted-by":"publisher","award":["KQTD2016112514355531"],"award-info":[{"award-number":["KQTD2016112514355531"]}],"id":[{"id":"10.13039\/501100010877","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Agence National de Recherche","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}]},{"DOI":"10.13039\/501100007162","name":"Guangdong Science and Technology Department","doi-asserted-by":"publisher","award":["2017ZT07X386,2020B121201001,2019A1515110177"],"award-info":[{"award-number":["2017ZT07X386,2020B121201001,2019A1515110177"]}],"id":[{"id":"10.13039\/501100007162","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.3528847","type":"proceedings-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T15:32:35Z","timestamp":1660750355000},"page":"611-619","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Better approximation guarantees for the NSGA-II by using the current crowding distance"],"prefix":"10.1145","author":[{"given":"Weijie","family":"Zheng","sequence":"first","affiliation":[{"name":"Southern University of Science and Technology, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Doerr","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":"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_2_1","volume-title":"AAAI Conference on Artificial Intelligence, AAAI","author":"Bian Chao","year":"2020","unstructured":"Chao Bian , Chao Feng , Chao Qian , and Yang Yu . 2020 . An eficient evolutionary algorithm for subset selection with general cost constraints .. In AAAI Conference on Artificial Intelligence, AAAI 2020. AAAI, 3267--3274. Chao Bian, Chao Feng, Chao Qian, and Yang Yu. 2020. An eficient evolutionary algorithm for subset selection with general cost constraints.. In AAAI Conference on Artificial Intelligence, AAAI 2020. AAAI, 3267--3274."},{"key":"e_1_3_2_1_3_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_4_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/195"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810761"},{"key":"e_1_3_2_1_6_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_7_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/229"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908827"},{"key":"e_1_3_2_1_10_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_11_1","doi-asserted-by":"crossref","unstructured":"Benjamin Doerr and Zhongdi Qu. 2022. A First Runtime Analysis of the NSGA-II on a Multimodal Problem. (2022). Preprint.  Benjamin Doerr and Zhongdi Qu. 2022. A First Runtime Analysis of the NSGA-II on a Multimodal Problem. (2022). Preprint.","DOI":"10.1007\/978-3-031-14721-0_28"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3462719"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299908"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00013"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389224"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5615"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012296"},{"key":"e_1_3_2_1_18_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_19_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760234108"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45712-7_5"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2792984"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2501315"},{"key":"e_1_3_2_1_23_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_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908961.2931685"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.06.009"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5621"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.06.005"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012354"},{"key":"e_1_3_2_1_29_1","volume-title":"Better approximation guarantees for the NSGA-II by using the current crowding distance. arXiv preprint arXiv:2203.02693","author":"Zheng Weijie","year":"2022","unstructured":"Weijie Zheng and Benjamin Doerr . 2022. Better approximation guarantees for the NSGA-II by using the current crowding distance. arXiv preprint arXiv:2203.02693 ( 2022 ). Weijie Zheng and Benjamin Doerr. 2022. Better approximation guarantees for the NSGA-II by using the current crowding distance. arXiv preprint arXiv:2203.02693 (2022)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21283"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.03.001"},{"key":"e_1_3_2_1_32_1","volume-title":"Evolutionary learning: Advances in theories and algorithms","author":"Zhou Zhi-Hua","unstructured":"Zhi-Hua Zhou , Yang Yu , and Chao Qian . 2019. Evolutionary learning: Advances in theories and algorithms . Springer . Zhi-Hua Zhou, Yang Yu, and Chao Qian. 2019. Evolutionary learning: Advances in theories and algorithms. Springer."},{"key":"e_1_3_2_1_33_1","volume-title":"PPSN","author":"Zitzler Eckart","year":"1998","unstructured":"Eckart Zitzler and Lothar Thiele . 1998 . Multiobjective optimization using evolutionary algorithms---a comparative case study. In Parallel Problem Solving from Nature , PPSN 1998. Springer, 292--301. Eckart Zitzler and Lothar Thiele. 1998. Multiobjective optimization using evolutionary algorithms---a comparative case study. In Parallel Problem Solving from Nature, PPSN 1998. Springer, 292--301."}],"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.3528847","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528847","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.3528847"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":33,"alternative-id":["10.1145\/3512290.3528847","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528847","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"}}]}}