{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T03:33:55Z","timestamp":1776569635831,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":28,"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\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP190103894, FT200100536"],"award-info":[{"award-number":["DP190103894, FT200100536"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"South Australian Government","award":["Unlocking Complex Resources through Lean Processing"],"award-info":[{"award-number":["Unlocking Complex Resources through Lean Processing"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,8]]},"DOI":"10.1145\/3512290.3528862","type":"proceedings-article","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T14:14:38Z","timestamp":1660572878000},"page":"749-756","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Evolutionary diversity optimisation for the traveling thief problem"],"prefix":"10.1145","author":[{"given":"Adel","family":"Nikfarjam","sequence":"first","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"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":"Bradley Alexander James Kortman and Aneta Neumann. 2017. Evolution of artistic image variants through feature based diversity optimisation. In GECCO. ACM 171--178.  Bradley Alexander James Kortman and Aneta Neumann. 2017. Evolution of artistic image variants through feature based diversity optimisation. In GECCO. ACM 171--178.","DOI":"10.1145\/3071178.3071342"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557681"},{"key":"e_1_3_2_1_3_1","volume-title":"Michal Roman Przybylek, and Adam Wierzbicki","author":"Bonyadi Mohammad Reza","year":"2014","unstructured":"Mohammad Reza Bonyadi , Zbigniew Michalewicz , Michal Roman Przybylek, and Adam Wierzbicki . 2014 . Socially inspired algorithms for the travelling thief problem. In GECCO. ACM , 421--428. Mohammad Reza Bonyadi, Zbigniew Michalewicz, Michal Roman Przybylek, and Adam Wierzbicki. 2014. Socially inspired algorithms for the travelling thief problem. In GECCO. ACM, 421--428."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Jakob Bossek Aneta Neumann and Frank Neumann. 2021. Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. In GECCO. ACM 556--564.  Jakob Bossek Aneta Neumann and Frank Neumann. 2021. Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. In GECCO. ACM 556--564.","DOI":"10.1145\/3449639.3459364"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Jakob Bossek and Frank Neumann. 2021. Evolutionary diversity optimization and the minimum spanning tree problem. In GECCO. ACM 198--206.  Jakob Bossek and Frank Neumann. 2021. Evolutionary diversity optimization and the minimum spanning tree problem. In GECCO. ACM 198--206.","DOI":"10.1145\/3449639.3459363"},{"key":"e_1_3_2_1_6_1","volume-title":"Multi-Emitter MAP-Elites: Improving quality, diversity and convergence speed with heterogeneous sets of emitters. CoRR abs\/2007.05352","author":"Cully Antoine","year":"2020","unstructured":"Antoine Cully . 2020. Multi-Emitter MAP-Elites: Improving quality, diversity and convergence speed with heterogeneous sets of emitters. CoRR abs\/2007.05352 ( 2020 ). Antoine Cully. 2020. Multi-Emitter MAP-Elites: Improving quality, diversity and convergence speed with heterogeneous sets of emitters. CoRR abs\/2007.05352 (2020)."},{"key":"e_1_3_2_1_7_1","unstructured":"Anh Viet Do Jakob Bossek Aneta Neumann and Frank Neumann. 2020. Evolving diverse sets of tours for the travelling salesperson problem. In GECCO. ACM 681--689.  Anh Viet Do Jakob Bossek Aneta Neumann and Frank Neumann. 2020. Evolving diverse sets of tours for the travelling salesperson problem. In GECCO. ACM 681--689."},{"key":"e_1_3_2_1_8_1","unstructured":"Anh Viet Do Mingyu Guo Aneta Neumann and Frank Neumann. 2021. Analysis of evolutionary diversity optimisation for permutation problems. In GECCO. ACM 574--582.  Anh Viet Do Mingyu Guo Aneta Neumann and Frank Neumann. 2021. Analysis of evolutionary diversity optimisation for permutation problems. In GECCO. ACM 574--582."},{"key":"e_1_3_2_1_9_1","volume-title":"Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Network","author":"Fontaine Matthew C.","unstructured":"Matthew C. Fontaine , Ruilin Liu , Ahmed Khalifa , Jignesh Modi , Julian Togelius , Amy K. Hoover , and Stefanos Nikolaidis . 2021. Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Network . In AAAI. AAAI Press , 5922--5930. Matthew C. Fontaine, Ruilin Liu, Ahmed Khalifa, Jignesh Modi, Julian Togelius, Amy K. Hoover, and Stefanos Nikolaidis. 2021. Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Network. In AAAI. AAAI Press, 5922--5930."},{"key":"e_1_3_2_1_10_1","volume-title":"Hoover","author":"Fontaine Matthew C.","year":"2020","unstructured":"Matthew C. Fontaine , Julian Togelius , Stefanos Nikolaidis , and Amy K . Hoover . 2020 . Covariance matrix adaptation for the rapid illumination of behavior space. In GECCO. ACM , 94--102. Matthew C. Fontaine, Julian Togelius, Stefanos Nikolaidis, and Amy K. Hoover. 2020. Covariance matrix adaptation for the rapid illumination of behavior space. In GECCO. ACM, 94--102."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00274"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106284"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0506"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Aneta Neumann Jakob Bossek and Frank Neumann. 2021. Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. In GECCO. ACM 261--269.  Aneta Neumann Jakob Bossek and Frank Neumann. 2021. Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. In GECCO. ACM 261--269.","DOI":"10.1145\/3449639.3459385"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Aneta Neumann Wanru Gao Carola Doerr Frank Neumann and Markus Wagner. 2018. Discrepancy-based evolutionary diversity optimization. In GECCO. ACM 991--998.  Aneta Neumann Wanru Gao Carola Doerr Frank Neumann and Markus Wagner. 2018. Discrepancy-based evolutionary diversity optimization. In GECCO. ACM 991--998.","DOI":"10.1145\/3205455.3205532"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Aneta Neumann Wanru Gao Markus Wagner and Frank Neumann. 2019. Evolutionary diversity optimization using multi-objective indicators. In GECCO. ACM 837--845.  Aneta Neumann Wanru Gao Markus Wagner and Frank Neumann. 2019. Evolutionary diversity optimization using multi-objective indicators. In GECCO. ACM 837--845.","DOI":"10.1145\/3321707.3321796"},{"key":"e_1_3_2_1_17_1","first-page":"1","article-title":"Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation","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 FOGA. ACM , 9 : 1 -- 9 :11. 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 FOGA. ACM, 9:1--9:11.","journal-title":"FOGA. ACM"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Adel Nikfarjam Jakob Bossek Aneta Neumann and Frank Neumann. 2021. Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. In GECCO. ACM 600--608.  Adel Nikfarjam Jakob Bossek Aneta Neumann and Frank Neumann. 2021. Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. In GECCO. ACM 600--608.","DOI":"10.1145\/3449639.3459384"},{"key":"e_1_3_2_1_19_1","volume-title":"On the Use of Quality Diversity Algorithms for The Traveling Thief Problem. CoRR abs\/2112.08627","author":"Nikfarjam Adel","year":"2021","unstructured":"Adel Nikfarjam , Aneta Neumann , and Frank Neumann . 2021. On the Use of Quality Diversity Algorithms for The Traveling Thief Problem. CoRR abs\/2112.08627 ( 2021 ). Adel Nikfarjam, Aneta Neumann, and Frank Neumann. 2021. On the Use of Quality Diversity Algorithms for The Traveling Thief Problem. CoRR abs\/2112.08627 (2021)."},{"key":"e_1_3_2_1_20_1","volume-title":"Markus Wagner, Zbigniew Michalewicz, and Frank Neumann.","author":"Polyakovskiy Sergey","year":"2014","unstructured":"Sergey Polyakovskiy , Mohammad Reza Bonyadi , Markus Wagner, Zbigniew Michalewicz, and Frank Neumann. 2014 . A comprehensive benchmark set and heuristics for the traveling thief problem. In GECCO. ACM , 477--484. Sergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz, and Frank Neumann. 2014. A comprehensive benchmark set and heuristics for the traveling thief problem. In GECCO. ACM, 477--484."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Nemanja Rakicevic Antoine Cully and Petar Kormushev. 2021. Policy manifold search: exploring the manifold hypothesis for diversity-based neuroevolution. In GECCO. ACM 901--909.  Nemanja Rakicevic Antoine Cully and Petar Kormushev. 2021. Policy manifold search: exploring the manifold hypothesis for diversity-based neuroevolution. In GECCO. ACM 901--909.","DOI":"10.1145\/3449639.3459320"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Kirby Steckel and Jacob Schrum. 2021. Illuminating the space of beatable lode runner levels produced by various generative adversarial networks. In GECCO Companion. ACM 111--112.  Kirby Steckel and Jacob Schrum. 2021. Illuminating the space of beatable lode runner levels produced by various generative adversarial networks. In GECCO Companion. ACM 111--112.","DOI":"10.1145\/3449726.3459440"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Tamara Ulrich and Lothar Thiele. 2011. Maximizing population diversity in single-objective optimization. In GECCO. ACM 641--648.  Tamara Ulrich and Lothar Thiele. 2011. Maximizing population diversity in single-objective optimization. In GECCO. ACM 641--648.","DOI":"10.1145\/2001576.2001665"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44427-7_25"},{"key":"e_1_3_2_1_25_1","volume-title":"Cosolver2B: An eficient local search heuristic for the Travelling Thief Problem","author":"Yafrani Mohamed El","unstructured":"Mohamed El Yafrani and Bela\u00efd Ahiod . 2015. Cosolver2B: An eficient local search heuristic for the Travelling Thief Problem . In AICCSA. IEEE Computer Society , 1--5. Mohamed El Yafrani and Bela\u00efd Ahiod. 2015. Cosolver2B: An eficient local search heuristic for the Travelling Thief Problem. In AICCSA. IEEE Computer Society, 1--5."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.12.011"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Enrico Zardini Davide Zappetti Davide Zambrano Giovanni Iacca and Dario Floreano. 2021. Seeking quality diversity in evolutionary co-design of morphology and control of soft tensegrity modular robots. In GECCO. ACM 189--197.  Enrico Zardini Davide Zappetti Davide Zambrano Giovanni Iacca and Dario Floreano. 2021. Seeking quality diversity in evolutionary co-design of morphology and control of soft tensegrity modular robots. In GECCO. ACM 189--197.","DOI":"10.1145\/3449639.3459311"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Wiem Zouari In\u00e8s Alaya and Moncef Tagina. 2019. A new hybrid ant colony algorithms for the traveling thief problem. In GECCO (Companion). ACM 95--96.  Wiem Zouari In\u00e8s Alaya and Moncef Tagina. 2019. A new hybrid ant colony algorithms for the traveling thief problem. In GECCO (Companion). ACM 95--96.","DOI":"10.1145\/3319619.3326785"}],"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.3528862","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528862","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.3528862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":28,"alternative-id":["10.1145\/3512290.3528862","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528862","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"}}]}}