{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:31Z","timestamp":1759638331604,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"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":[{"name":"Australian Research Council (ARC)","award":["DP190103894, FT200100536"],"award-info":[{"award-number":["DP190103894, FT200100536"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,8]]},"DOI":"10.1145\/3512290.3528851","type":"proceedings-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T15:32:35Z","timestamp":1660750355000},"page":"186-194","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Exploring the feature space of TSP instances using quality diversity"],"prefix":"10.1145","author":[{"given":"Jakob","family":"Bossek","sequence":"first","affiliation":[{"name":"University of M\u00fcnster, Germany"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Australia"}]}],"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\/3071178.3071342"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841103"},{"key":"e_1_3_2_1_3_1","volume-title":"Cook","author":"Applegate David L.","year":"2007","unstructured":"David L. Applegate , Robert E. Bixby , Vasek Chvatal , and William J . Cook . 2007 . The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press , USA. David L. Applegate, Robert E. Bixby, Vasek Chvatal, and William J. Cook. 2007. The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, USA."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.04.003"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340307"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50349-3_4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49130-1_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463399"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389844"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459313"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0967-0661(02)00081-3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45823-6_81"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00274"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450218.3477308"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205651.3208233"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00242"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00215"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19084-6_18"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-013-9341-2"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the International Conference on Genetic Algorithms (ICGA). Morgan-Kaufmann","author":"Nagata Yuichi","year":"1997","unstructured":"Yuichi Nagata and Shigenobu Kobayashi . 1997 . Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem . In Proceedings of the International Conference on Genetic Algorithms (ICGA). Morgan-Kaufmann , San Francisco, CA, 450--457. Yuichi Nagata and Shigenobu Kobayashi. 1997. Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem. In Proceedings of the International Conference on Genetic Algorithms (ICGA). Morgan-Kaufmann, San Francisco, CA, 450--457."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0506"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460253"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205532"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321796"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450218.3477310"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459384"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Adel Nikfarjam Aneta Neumann and Frank Neumann. 2021. On the Use of Quality Diversity Algorithms for The Traveling Thief Problem. arXiv:2112.08627 [cs.NE]  Adel Nikfarjam Aneta Neumann and Frank Neumann. 2021. On the Use of Quality Diversity Algorithms for The Traveling Thief Problem. arXiv:2112.08627 [cs.NE]","DOI":"10.1145\/3512290.3528752"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2014.18"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.3389\/frobt.2016.00040"},{"key":"e_1_3_2_1_31_1","volume-title":"R: A Language and Environment for Statistical Computing","author":"Team R Core","year":"2020","unstructured":"R Core Team . 2020 . R: A Language and Environment for Statistical Computing . R Foundation for Statistical Computing , Vienna, Austria . https:\/\/www.R-project.org\/ R Core Team. 2020. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria. https:\/\/www.R-project.org\/"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-9688-4_3"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_4"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13800-3_29"},{"key":"e_1_3_2_1_36_1","volume-title":"Gandomi","author":"Telikani Akbar","year":"2022","unstructured":"Akbar Telikani , Amirhessam Tahmassebi , Wolfgang Banzhaf , and Amir H . Gandomi . 2022 . Evolutionary Machine Learning: A Survey. Comput. Surveys 54, 8 (2022), 161:1--161:35. Akbar Telikani, Amirhessam Tahmassebi, Wolfgang Banzhaf, and Amir H. Gandomi. 2022. Evolutionary Machine Learning: A Survey. Comput. Surveys 54, 8 (2022), 161:1--161:35."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459311"}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Boston Massachusetts","acronym":"GECCO '22"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528851","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528851","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.3528851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":36,"alternative-id":["10.1145\/3512290.3528851","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528851","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"}}]}}