{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:41:50Z","timestamp":1772786510945,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583133.3590693","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"131-134","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Many-objective Optimization via Voting for Elites"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3276-1890","authenticated-orcid":false,"given":"Jackson","family":"Dean","sequence":"first","affiliation":[{"name":"University of Vermont, Burlington, VT, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7140-2213","authenticated-orcid":false,"given":"Nick","family":"Cheney","sequence":"additional","affiliation":[{"name":"University of Vermont, Burlington, VT, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sorms.2015.08.001"},{"key":"e_1_3_2_2_2_1","volume-title":"David A Van Veldhuizen, et al","author":"Coello Coello Carlos A","year":"2007","unstructured":"Carlos A Coello Coello , Gary B Lamont , David A Van Veldhuizen, et al . 2007 . Evolutionary algorithms for solving multi-objective problems. Vol. 5 . Springer . Carlos A Coello Coello, Gary B Lamont, David A Van Veldhuizen, et al. 2007. Evolutionary algorithms for solving multi-objective problems. Vol. 5. Springer."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2704781"},{"key":"e_1_3_2_2_4_1","volume-title":"Multi-objective optimisation using evolutionary algorithms: an introduction","author":"Deb Kalyanmoy","unstructured":"Kalyanmoy Deb . 2011. Multi-objective optimisation using evolutionary algorithms: an introduction . Springer . Kalyanmoy Deb. 2011. Multi-objective optimisation using evolutionary algorithms: an introduction. Springer."},{"key":"e_1_3_2_2_5_1","volume-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","author":"Deb Kalyanmoy","year":"2002","unstructured":"Kalyanmoy Deb , Amrit Pratap , Sameer Agarwal , and TAMT Meyarivan . 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II . IEEE transactions on evolutionary computation 6, 2 ( 2002 ), 182--197. Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and TAMT Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE transactions on evolutionary computation 6, 2 (2002), 182--197."},{"key":"e_1_3_2_2_6_1","volume-title":"Dhish Kumar Saxena, et al","author":"Deb Kalyanmoy","year":"2005","unstructured":"Kalyanmoy Deb , Dhish Kumar Saxena, et al . 2005 . On finding pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems. Kangal report 2005011 (2005), 1--19. Kalyanmoy Deb, Dhish Kumar Saxena, et al. 2005. On finding pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems. Kangal report 2005011 (2005), 1--19."},{"key":"e_1_3_2_2_7_1","volume-title":"Foundations of genetic algorithms.","author":"Forrest Stephanie","unstructured":"Stephanie Forrest and Melanie Mitchell . 1993. Relative building-block fitness and the building-block hypothesis . In Foundations of genetic algorithms. Vol. 2 . Elsevier , 109--126. Stephanie Forrest and Melanie Mitchell. 1993. Relative building-block fitness and the building-block hypothesis. In Foundations of genetic algorithms. Vol. 2. Elsevier, 109--126."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3321897"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1177\/105971239700500305"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389225"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2208.14818"},{"key":"e_1_3_2_2_12_1","volume-title":"Abandoning objectives: Evolution through the search for novelty alone. Evolutionary computation 19, 2","author":"Lehman Joel","year":"2011","unstructured":"Joel Lehman and Ken Stanley . 2011. Abandoning objectives: Evolution through the search for novelty alone. Evolutionary computation 19, 2 ( 2011 ), 189--223. Joel Lehman and Ken Stanley. 2011. Abandoning objectives: Evolution through the search for novelty alone. Evolutionary computation 19, 2 (2011), 189--223."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001606"},{"key":"e_1_3_2_2_14_1","unstructured":"Joel Lehman Kenneth O Stanley etal 2008. Exploiting open-endedness to solve problems through the search for novelty.. In ALIFE. 329--336.  Joel Lehman Kenneth O Stanley et al. 2008. Exploiting open-endedness to solve problems through the search for novelty.. In ALIFE. 329--336."},{"key":"e_1_3_2_2_15_1","volume-title":"Illuminating search spaces by mapping elites. arXiv preprint arXiv:1504.04909","author":"Mouret Jean-Baptiste","year":"2015","unstructured":"Jean-Baptiste Mouret and Jeff Clune . 2015. Illuminating search spaces by mapping elites. arXiv preprint arXiv:1504.04909 ( 2015 ). Jean-Baptiste Mouret and Jeff Clune. 2015. Illuminating search spaces by mapping elites. arXiv preprint arXiv:1504.04909 (2015)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754703"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.3233\/ICA-170542"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528823"},{"key":"e_1_3_2_2_19_1","volume-title":"Quality diversity: A new frontier for evolutionary computation. Frontiers in Robotics and AI","author":"Pugh Justin K","year":"2016","unstructured":"Justin K Pugh , Lisa Soros , and Kenneth O Stanley . 2016. Quality diversity: A new frontier for evolutionary computation. Frontiers in Robotics and AI ( 2016 ), 40. Justin K Pugh, Lisa Soros, and Kenneth O Stanley. 2016. Quality diversity: A new frontier for evolutionary computation. Frontiers in Robotics and AI (2016), 40."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754664"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586247"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1357054.1357328"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068219"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.7551\/978-0-262-32621-6-ch128"},{"key":"e_1_3_2_2_25_1","volume-title":"Compositional pattern producing networks: A novel abstraction of development. Genetic programming and evolvable machines 8, 2","author":"Stanley Kenneth O","year":"2007","unstructured":"Kenneth O Stanley . 2007. Compositional pattern producing networks: A novel abstraction of development. Genetic programming and evolvable machines 8, 2 ( 2007 ), 131--162. Kenneth O Stanley. 2007. Compositional pattern producing networks: A novel abstraction of development. Genetic programming and evolvable machines 8, 2 (2007), 131--162."},{"key":"e_1_3_2_2_26_1","volume-title":"Artificial Life Conference Proceedings. MIT Press, 208--215","author":"Stanley Kenneth O","year":"2016","unstructured":"Kenneth O Stanley , Nick Cheney , and Lisa B Soros . 2016 . How the strictness of the minimal criterion impacts open-ended evolution . In Artificial Life Conference Proceedings. MIT Press, 208--215 . Kenneth O Stanley, Nick Cheney, and Lisa B Soros. 2016. How the strictness of the minimal criterion impacts open-ended evolution. In Artificial Life Conference Proceedings. MIT Press, 208--215."},{"key":"e_1_3_2_2_27_1","volume-title":"Open-endedness: The last grand challenge you've never heard of. While open-endedness could be a force for discovering intelligence, it could also be a component of AI itself","author":"Stanley Kenneth O","year":"2017","unstructured":"Kenneth O Stanley , Joel Lehman , and Lisa Soros . 2017 . Open-endedness: The last grand challenge you've never heard of. While open-endedness could be a force for discovering intelligence, it could also be a component of AI itself (2017). Kenneth O Stanley, Joel Lehman, and Lisa Soros. 2017. Open-endedness: The last grand challenge you've never heard of. While open-endedness could be a force for discovering intelligence, it could also be a component of AI itself (2017)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001707"},{"key":"e_1_3_2_2_29_1","volume-title":"SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report 103","author":"Zitzler Eckart","year":"2001","unstructured":"Eckart Zitzler , Marco Laumanns , and Lothar Thiele . 2001. SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report 103 ( 2001 ). Eckart Zitzler, Marco Laumanns, and Lothar Thiele. 2001. SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report 103 (2001)."}],"event":{"name":"GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation","location":"Lisbon Portugal","acronym":"GECCO '23 Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Companion Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590693","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3590693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:49Z","timestamp":1750178269000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":29,"alternative-id":["10.1145\/3583133.3590693","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3590693","relation":{},"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"2023-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}