{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:31:04Z","timestamp":1774373464416,"version":"3.50.1"},"reference-count":61,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T00:00:00Z","timestamp":1717804800000},"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":"crossref","award":["DP190103894 and FT200100536"],"award-info":[{"award-number":["DP190103894 and FT200100536"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100015015","name":"South Australian Government","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100015015","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Research Consortium \u201cUnlocking Complex Resources through Lean Processing\u201d"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Evol. Learn. Optim."],"published-print":{"date-parts":[[2024,6,30]]},"abstract":"<jats:p>In real-world optimisation, it is common to face several sub-problems interacting and forming the main problem. There is an inter-dependency between the sub-problems, making it impossible to solve such a problem by focusing on only one component. The travelling thief problem\u00a0(TTP) belongs to this category and is formed by the integration of the travelling salesperson problem\u00a0(TSP) and the knapsack problem\u00a0(KP). In this paper, we investigate the inter-dependency of the TSP and the KP by means of quality diversity\u00a0(QD) approaches. QD algorithms provide a powerful tool not only to obtain high-quality solutions but also to illustrate the distribution of high-performing solutions in the behavioural space.<\/jats:p>\n          <jats:p>We introduce a multi-dimensional archive of phenotypic elites (MAP-Elites) based evolutionary algorithm using well-known TSP and KP search operators, taking the TSP and KP score as the behavioural descriptor. MAP-Elites algorithms are QD-based techniques to explore high-performing solutions in a behavioural space. Afterwards, we conduct comprehensive experimental studies that show the usefulness of using the QD approach applied to the TTP. First, we provide insights regarding high-quality TTP solutions in the TSP\/KP behavioural space. Afterwards, we show that better solutions for the TTP can be obtained by using our QD approach, and it can improve the best-known solution for a number of TTP instances used for benchmarking in the literature.<\/jats:p>","DOI":"10.1145\/3641109","type":"journal-article","created":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T12:16:12Z","timestamp":1705493772000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Use of Quality Diversity Algorithms for the Travelling Thief Problem"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6928-1029","authenticated-orcid":false,"given":"Adel","family":"Nikfarjam","sequence":"first","affiliation":[{"name":"Optimisation and Logistics, School of Computer and Mathematical Sciences, and The University of Adelaide, Adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"Optimisation and Logistics, School of Computer and Mathematical Sciences, and The University of Adelaide, Adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"Optimisation and Logistics, School of Computer and Mathematical Sciences, and The University of Adelaide, Adelaide, Australia"}]}],"member":"320","published-online":{"date-parts":[[2024,6,8]]},"reference":[{"key":"e_1_3_2_2_1","first-page":"171","volume-title":"GECCO","author":"Alexander Bradley","year":"2017","unstructured":"Bradley Alexander, James Kortman, and Aneta Neumann. 2017. Evolution of artistic image variants through feature based diversity optimisation. In GECCO. ACM, 171\u2013178."},{"key":"e_1_3_2_3_1","first-page":"58","volume-title":"GECCO","author":"Allard Maxime","year":"2022","unstructured":"Maxime Allard, Sim\u00f3n C. Smith, Konstantinos I. Chatzilygeroudis, and Antoine Cully. 2022. Hierarchical quality-diversity for online damage recovery. In GECCO. ACM, 58\u201367."},{"key":"e_1_3_2_4_1","first-page":"1037","volume-title":"IEEE Congress on Evolutionary Computation","author":"Bonyadi Mohammad Reza","year":"2013","unstructured":"Mohammad Reza Bonyadi, Zbigniew Michalewicz, and Luigi Barone. 2013. The travelling thief problem: The first step in the transition from theoretical problems to realistic problems. In IEEE Congress on Evolutionary Computation. IEEE, 1037\u20131044."},{"key":"e_1_3_2_5_1","first-page":"421","volume-title":"GECCO","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\u2013428."},{"key":"e_1_3_2_6_1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-030-01641-8_2","volume-title":"Optimization in Industry","author":"Bonyadi Mohammad Reza","year":"2019","unstructured":"Mohammad Reza Bonyadi, Zbigniew Michalewicz, Markus Wagner, and Frank Neumann. 2019. Evolutionary computation for multicomponent problems: Opportunities and future directions. In Optimization in Industry. Springer, 13\u201330."},{"key":"e_1_3_2_7_1","first-page":"556","volume-title":"GECCO","author":"Bossek Jakob","year":"2021","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\u2013564."},{"key":"e_1_3_2_8_1","first-page":"198","volume-title":"GECCO","author":"Bossek Jakob","year":"2021","unstructured":"Jakob Bossek and Frank Neumann. 2021. Evolutionary diversity optimization and the minimum spanning tree problem. In GECCO. ACM, 198\u2013206."},{"key":"e_1_3_2_9_1","doi-asserted-by":"crossref","first-page":"105560","DOI":"10.1016\/j.cor.2021.105560","article-title":"A weighted-sum method for solving the bi-objective traveling thief problem","volume":"138","author":"Chagas Jonatas B. C.","year":"2022","unstructured":"Jonatas B. C. Chagas and Markus Wagner. 2022. A weighted-sum method for solving the bi-objective traveling thief problem. Comput. Oper. Res. 138 (2022), 105560.","journal-title":"Comput. Oper. Res."},{"key":"e_1_3_2_10_1","article-title":"Quality-diversity optimization: A novel branch of stochastic optimization","volume":"2012","author":"Chatzilygeroudis Konstantinos I.","year":"2020","unstructured":"Konstantinos I. Chatzilygeroudis, Antoine Cully, Vassilis Vassiliades, and Jean-Baptiste Mouret. 2020. Quality-diversity optimization: A novel branch of stochastic optimization. CoRR abs\/2012.04322 (2020).","journal-title":"CoRR"},{"key":"e_1_3_2_11_1","first-page":"23","volume-title":"GECCO (Companion)","author":"Clune Jeff","year":"2013","unstructured":"Jeff Clune, Jean-Baptiste Mouret, and Hod Lipson. 2013. Summary of \u201cThe evolutionary origins of modularity\u201d. In GECCO (Companion). ACM, 23\u201324."},{"issue":"6","key":"e_1_3_2_12_1","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","article-title":"A method for solving traveling-salesman problems","volume":"6","author":"Croes Georges A.","year":"1958","unstructured":"Georges A. Croes. 1958. A method for solving traveling-salesman problems. Operations Research 6, 6 (1958), 791\u2013812.","journal-title":"Operations Research"},{"key":"e_1_3_2_13_1","first-page":"175","volume-title":"GECCO","author":"Cully Antoine","year":"2013","unstructured":"Antoine Cully and Jean-Baptiste Mouret. 2013. Behavioral repertoire learning in robotics. In GECCO. ACM, 175\u2013182."},{"key":"e_1_3_2_14_1","first-page":"681","volume-title":"GECCO","author":"Do Anh Viet","year":"2020","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\u2013689."},{"issue":"3","key":"e_1_3_2_15_1","first-page":"11:1\u201311:27","article-title":"Analysis of evolutionary diversity optimisation for permutation problems","volume":"2","author":"Do Anh Viet","year":"2022","unstructured":"Anh Viet Do, Mingyu Guo, Aneta Neumann, and Frank Neumann. 2022. Analysis of evolutionary diversity optimisation for permutation problems. ACM Trans. Evol. Learn. Optim. 2, 3, 11:1\u201311:27.","journal-title":"ACM Trans. Evol. Learn. Optim."},{"key":"e_1_3_2_16_1","first-page":"5558","volume-title":"IJCAI 2023","author":"Do Anh Viet","year":"2023","unstructured":"Anh Viet Do, Mingyu Guo, Aneta Neumann, and Frank Neumann. 2023. Diverse approximations for monotone submodular maximization problems with a matroid constraint. In IJCAI 2023. 5558\u20135566."},{"issue":"1","key":"e_1_3_2_17_1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","article-title":"On the analysis of the (1+1) evolutionary algorithm","volume":"276","author":"Droste Stefan","year":"2002","unstructured":"Stefan Droste, Thomas Jansen, and Ingo Wegener. 2002. On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276, 1-2 (2002), 51\u201381.","journal-title":"Theor. Comput. Sci."},{"key":"e_1_3_2_18_1","first-page":"5922","volume-title":"AAAI","author":"Fontaine Matthew C.","year":"2021","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\u20135930."},{"key":"e_1_3_2_19_1","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/3377930.3390232","volume-title":"GECCO","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\u2013102."},{"key":"e_1_3_2_20_1","first-page":"313","volume-title":"GECCO Companion","author":"Galanos Theodoros","year":"2021","unstructured":"Theodoros Galanos, Antonios Liapis, Georgios N. Yannakakis, and Reinhard Koenig. 2021. ARCH-Elites: Quality-diversity for urban design. In GECCO Companion. ACM, 313\u2013314."},{"issue":"1","key":"e_1_3_2_21_1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1162\/evco_a_00274","article-title":"Feature-based diversity optimization for problem instance classification","volume":"29","author":"Gao Wanru","year":"2021","unstructured":"Wanru Gao, Samadhi Nallaperuma, and Frank Neumann. 2021. Feature-based diversity optimization for problem instance classification. Evol. Comput. 29, 1 (2021), 107\u2013128.","journal-title":"Evol. Comput."},{"key":"e_1_3_2_22_1","first-page":"24","volume-title":"ICGA","author":"Harik Georges R.","year":"1995","unstructured":"Georges R. Harik. 1995. Finding multimodal solutions using restricted tournament selection. In ICGA. Morgan Kaufmann, 24\u201331."},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"e_1_3_2_24_1","volume-title":"An Analysis of the Behavior of a Class of Genetic Adaptive Systems.","author":"Jong Kenneth Alan De","year":"1975","unstructured":"Kenneth Alan De Jong. 1975. An Analysis of the Behavior of a Class of Genetic Adaptive Systems.University of Michigan."},{"issue":"2","key":"e_1_3_2_25_1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1162\/EVCO_a_00025","article-title":"Abandoning objectives: Evolution through the search for novelty alone","volume":"19","author":"Lehman Joel","year":"2011","unstructured":"Joel Lehman and Kenneth O. Stanley. 2011. Abandoning objectives: Evolution through the search for novelty alone. Evol. Comput. 19, 2 (2011), 189\u2013223.","journal-title":"Evol. Comput."},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2638437"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106284"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0506"},{"issue":"4","key":"e_1_3_2_29_1","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10732-023-09518-7","article-title":"Solving travelling thief problems using coordination based methods","volume":"29","author":"Namazi Majid","year":"2023","unstructured":"Majid Namazi, M. A. Hakim Newton, Conrad Sanderson, and Abdul Sattar. 2023. Solving travelling thief problems using coordination based methods. J. Heuristics 29, 4-6 (2023), 487\u2013544.","journal-title":"J. Heuristics"},{"key":"e_1_3_2_30_1","first-page":"140","volume-title":"SOCS","author":"Namazi Majid","year":"2019","unstructured":"Majid Namazi, M. A. Hakim Newton, Abdul Sattar, and Conrad Sanderson. 2019. A profit guided coordination heuristic for travelling thief problems. In SOCS. AAAI Press, 140\u2013144."},{"key":"e_1_3_2_31_1","first-page":"111","volume-title":"SOCS","author":"Namazi Majid","year":"2020","unstructured":"Majid Namazi, Conrad Sanderson, M. A. Hakim Newton, and Abdul Sattar. 2020. Surrogate assisted optimisation for travelling thief problems. In SOCS. AAAI Press, 111\u2013115."},{"key":"e_1_3_2_32_1","first-page":"832","volume-title":"GECCO 2022","author":"Neumann Aneta","year":"2022","unstructured":"Aneta Neumann, Denis Antipov, and Frank Neumann. 2022. Coevolutionary Pareto diversity optimization. In GECCO 2022. ACM, 832\u2013839."},{"key":"e_1_3_2_33_1","first-page":"261","volume-title":"GECCO","author":"Neumann Aneta","year":"2021","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\u2013269."},{"key":"e_1_3_2_34_1","first-page":"991","volume-title":"GECCO","author":"Neumann Aneta","year":"2018","unstructured":"Aneta Neumann, Wanru Gao, Carola Doerr, Frank Neumann, and Markus Wagner. 2018. Discrepancy-based evolutionary diversity optimization. In GECCO. ACM, 991\u2013998."},{"key":"e_1_3_2_35_1","first-page":"837","volume-title":"GECCO","author":"Neumann Aneta","year":"2019","unstructured":"Aneta Neumann, Wanru Gao, Markus Wagner, and Frank Neumann. 2019. Evolutionary diversity optimization using multi-objective indicators. In GECCO. ACM, 837\u2013845."},{"key":"e_1_3_2_36_1","first-page":"1436","volume-title":"GECCO 2023","author":"Neumann Aneta","year":"2023","unstructured":"Aneta Neumann, Sharlotte Gounder, Xiankun Yan, Gregory Sherman, Benjamin Campbell, Mingyu Guo, and Frank Neumann. 2023. Diversity optimization for the detection and concealment of spatially defined communication networks. In GECCO 2023. ACM, 1436\u20131444."},{"key":"e_1_3_2_37_1","first-page":"452","volume-title":"ICONIP 2018 (LNCS)","author":"Neumann Aneta","year":"2018","unstructured":"Aneta Neumann, Christo Pyromallis, and Bradley Alexander. 2018b. Evolution of images with diversity and constraints using a generative adversarial network. In ICONIP 2018 (LNCS), Vol. 11306. Springer, 452\u2013465."},{"key":"e_1_3_2_38_1","first-page":"59","volume-title":"ALGOCLOUD (Lecture Notes in Computer Science)","author":"Neumann Frank","year":"2018","unstructured":"Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, and Junhua Wu. 2018a. A fully polynomial time approximation scheme for packing while traveling. In ALGOCLOUD (Lecture Notes in Computer Science), Vol. 11409. Springer, 59\u201372."},{"key":"e_1_3_2_39_1","first-page":"9:1\u20139:11","volume-title":"FOGA","author":"Nikfarjam Adel","year":"2021","unstructured":"Adel Nikfarjam, Jakob Bossek, Aneta Neumann, and Frank Neumann. 2021b. Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. In FOGA. ACM, 9:1\u20139:11."},{"key":"e_1_3_2_40_1","first-page":"600","volume-title":"GECCO","author":"Nikfarjam Adel","year":"2021","unstructured":"Adel Nikfarjam, Jakob Bossek, Aneta Neumann, and Frank Neumann. 2021a. Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. In GECCO. ACM, 600\u2013608."},{"key":"e_1_3_2_41_1","first-page":"749","volume-title":"GECCO","author":"Nikfarjam Adel","year":"2022","unstructured":"Adel Nikfarjam, Aneta Neumann, and Frank Neumann. 2022a. Evolutionary diversity optimisation for the traveling thief problem. In GECCO. ACM, 749\u2013756."},{"key":"e_1_3_2_42_1","first-page":"260","volume-title":"GECCO","author":"Nikfarjam Adel","year":"2022","unstructured":"Adel Nikfarjam, Aneta Neumann, and Frank Neumann. 2022b. On the use of quality diversity algorithms for the traveling thief problem. In GECCO. ACM, 260\u2013268."},{"key":"e_1_3_2_43_1","first-page":"170","volume-title":"PPSN (Lecture Notes in Computer Science)","author":"P\u00e1l K\u00e1roly F.","year":"1994","unstructured":"K\u00e1roly F. P\u00e1l. 1994. Selection schemes with spatial isolation for genetic optimization. In PPSN (Lecture Notes in Computer Science), Vol. 866. Springer, 170\u2013179."},{"key":"e_1_3_2_44_1","first-page":"477","volume-title":"GECCO","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\u2013484."},{"key":"e_1_3_2_45_1","first-page":"40","article-title":"Quality diversity: A new frontier for evolutionary computation","volume":"3","author":"Pugh Justin K.","year":"2016","unstructured":"Justin K. Pugh, Lisa B. Soros, and Kenneth O. Stanley. 2016. Quality diversity: A new frontier for evolutionary computation. Frontiers Robotics AI 3 (2016), 40.","journal-title":"Frontiers Robotics AI"},{"key":"e_1_3_2_46_1","first-page":"967","volume-title":"GECCO","author":"Pugh Justin K.","year":"2015","unstructured":"Justin K. Pugh, Lisa B. Soros, Paul A. Szerlip, and Kenneth O. Stanley. 2015. Confronting the challenge of quality diversity. In GECCO. ACM, 967\u2013974."},{"key":"e_1_3_2_47_1","first-page":"901","volume-title":"GECCO","author":"Rakicevic Nemanja","year":"2021","unstructured":"Nemanja Rakicevic, Antoine Cully, and Petar Kormushev. 2021. Policy manifold search: Exploring the manifold hypothesis for diversity-based neuroevolution. In GECCO. ACM, 901\u2013909."},{"key":"e_1_3_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.735432"},{"key":"e_1_3_2_49_1","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1145\/1143997.1144200","volume-title":"GECCO","author":"Singh Gulshan","year":"2006","unstructured":"Gulshan Singh and Kalyanmoy Deb. 2006. Comparison of multi-modal optimization algorithms based on evolutionary algorithms. In GECCO. ACM, 1305\u20131312."},{"key":"e_1_3_2_50_1","first-page":"111","volume-title":"GECCO Companion","author":"Steckel Kirby","year":"2021","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\u2013112."},{"key":"e_1_3_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02243880"},{"key":"e_1_3_2_52_1","first-page":"641","volume-title":"GECCO","author":"Ulrich Tamara","year":"2011","unstructured":"Tamara Ulrich and Lothar Thiele. 2011. Maximizing population diversity in single-objective optimization. In GECCO. ACM, 641\u2013648."},{"issue":"4","key":"e_1_3_2_53_1","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1109\/TEVC.2017.2735550","article-title":"Using centroidal Voronoi tessellations to scale up the multidimensional archive of phenotypic elites algorithm","volume":"22","author":"Vassiliades Vassilis","year":"2018","unstructured":"Vassilis Vassiliades, Konstantinos I. Chatzilygeroudis, and Jean-Baptiste Mouret. 2018. Using centroidal Voronoi tessellations to scale up the multidimensional archive of phenotypic elites algorithm. IEEE Trans. Evol. Comput. 22, 4 (2018), 623\u2013630.","journal-title":"IEEE Trans. Evol. Comput."},{"key":"e_1_3_2_54_1","first-page":"273","volume-title":"ANTS Conference (Lecture Notes in Computer Science)","volume":"9882","author":"Wagner Markus","year":"2016","unstructured":"Markus Wagner. 2016. Stealing items more efficiently with ants: A swarm intelligence approach to the travelling thief problem. In ANTS Conference (Lecture Notes in Computer Science), Vol. 9882. Springer, 273\u2013281."},{"issue":"3","key":"e_1_3_2_55_1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10732-017-9328-y","article-title":"A case study of algorithm selection for the traveling thief problem","volume":"24","author":"Wagner Markus","year":"2018","unstructured":"Markus Wagner, Marius Lindauer, Mustafa Misir, Samadhi Nallaperuma, and Frank Hutter. 2018. A case study of algorithm selection for the traveling thief problem. J. Heuristics 24, 3 (2018), 295\u2013320.","journal-title":"J. Heuristics"},{"key":"e_1_3_2_56_1","first-page":"110","volume-title":"SEAL (Lecture Notes in Computer Science)","author":"Wu Junhua","year":"2017","unstructured":"Junhua Wu, Markus Wagner, Sergey Polyakovskiy, and Frank Neumann. 2017. Exact approaches for the travelling thief problem. In SEAL (Lecture Notes in Computer Science), Vol. 10593. Springer, 110\u2013121."},{"key":"e_1_3_2_57_1","first-page":"329","volume-title":"GECCO","author":"Wuijts Rogier Hans","year":"2019","unstructured":"Rogier Hans Wuijts and Dirk Thierens. 2019. Investigation of the traveling thief problem. In GECCO. ACM, 329\u2013337."},{"key":"e_1_3_2_58_1","first-page":"1","volume-title":"AICCSA","author":"Yafrani Mohamed El","year":"2015","unstructured":"Mohamed El Yafrani and Bela\u00efd Ahiod. 2015. Cosolver2B: An efficient local search heuristic for the travelling thief problem. In AICCSA. IEEE Computer Society, 1\u20135."},{"key":"e_1_3_2_59_1","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.ins.2017.12.011","article-title":"Efficiently solving the traveling thief problem using hill climbing and simulated annealing","volume":"432","author":"Yafrani Mohamed El","year":"2018","unstructured":"Mohamed El Yafrani and Bela\u00efd Ahiod. 2018. Efficiently solving the traveling thief problem using hill climbing and simulated annealing. Inf. Sci. 432 (2018), 231\u2013244.","journal-title":"Inf. Sci."},{"key":"e_1_3_2_60_1","first-page":"343","volume-title":"SYNASC","author":"Zaharie Daniela","year":"2005","unstructured":"Daniela Zaharie. 2005. Density based clustering with crowding differential evolution. In SYNASC. IEEE Computer Society, 343\u2013350."},{"key":"e_1_3_2_61_1","first-page":"189","volume-title":"GECCO","author":"Zardini Enrico","year":"2021","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\u2013197."},{"key":"e_1_3_2_62_1","first-page":"95","volume-title":"GECCO (Companion)","author":"Zouari Wiem","year":"2019","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\u201396."}],"container-title":["ACM Transactions on Evolutionary Learning and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3641109","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3641109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:57:26Z","timestamp":1750291046000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3641109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,8]]},"references-count":61,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6,30]]}},"alternative-id":["10.1145\/3641109"],"URL":"https:\/\/doi.org\/10.1145\/3641109","relation":{},"ISSN":["2688-299X","2688-3007"],"issn-type":[{"value":"2688-299X","type":"print"},{"value":"2688-3007","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,8]]},"assertion":[{"value":"2022-12-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-26","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}