{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T01:36:57Z","timestamp":1782783417225,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP190103894"],"award-info":[{"award-number":["DP190103894"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT200100536"],"award-info":[{"award-number":["FT200100536"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654082","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"467-475","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A Detailed Experimental Analysis of Evolutionary Diversity Optimization for OneMinMax"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7906-096X","authenticated-orcid":false,"given":"Denis","family":"Antipov","sequence":"first","affiliation":[{"name":"Optimization and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, South Australia, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"Optimization and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, South Australia, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"Optimization and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, South Australia, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3594805.3607135"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340307"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459364"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459363"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459307"},{"key":"e_1_3_2_2_6_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Dang Duc-Cuong","year":"2016","unstructured":"Duc-Cuong Dang, Tobias Friedrich, Timo K\u00f6tzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, and Andrew M. Sutton. 2016. Escaping local optima with diversity mechanisms and crossover. In Genetic and Evolutionary Computation Conference, GECCO 2016. ACM, 645--652."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2724201"},{"key":"e_1_3_2_2_8_1","volume-title":"International Conference on Genetic Algorithms, ICGA","author":"Kenneth","year":"1989","unstructured":"Kenneth A. De Jong and William M. Spears. 1989. Using genetic algorithms to solve NP-complete problems. In International Conference on Genetic Algorithms, ICGA 1989. Morgan Kaufmann Publishers Inc., 124--132."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389844"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3561974"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908827"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Benjamin Doerr and Frank Neumann (Eds.). 2020. Theory of Evolutionary Computation - Recent Developments in Discrete Optimization. Springer.","DOI":"10.1007\/978-3-030-29414-4"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02219227"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00274"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598251"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739482.2764668"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00013"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90293-5"},{"key":"e_1_3_2_2_19_1","volume-title":"Encyclopedia of Optimization","author":"Kobler Daniel","unstructured":"Daniel Kobler. 2009. Evolutionary Algorithms in Combinatorial Optimization. In Encyclopedia of Optimization, Second Edition. Springer, 950--959."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-5915.1993.tb00509.x"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459385"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205532"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321796"},{"key":"e_1_3_2_2_24_1","first-page":"1","article-title":"Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. In Foundations of Genetic Algorithms, FOGA 2021","volume":"9","author":"Nikfarjam Adel","year":"2021","unstructured":"Adel Nikfarjam, Jakob Bossek, Aneta Neumann, and Frank Neumann. 2021. Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. In Foundations of Genetic Algorithms, FOGA 2021. ACM, 9:1--9:11.","journal-title":"ACM"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459384"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528862"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.871251"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001665"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9"}],"event":{"name":"GECCO '24: Genetic and Evolutionary Computation Conference","location":"Melbourne VIC Australia","acronym":"GECCO '24","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\/3638529.3654082","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:50Z","timestamp":1750291010000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":29,"alternative-id":["10.1145\/3638529.3654082","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654082","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-07-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}