{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:53:52Z","timestamp":1776956032604,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,12]],"date-time":"2014-07-12T00:00:00Z","timestamp":1405123200000},"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":["DP130104395"],"award-info":[{"award-number":["DP130104395"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP140103400"],"award-info":[{"award-number":["DP140103400"]}],"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":[[2014,7,12]]},"DOI":"10.1145\/2576768.2598249","type":"proceedings-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T12:10:42Z","timestamp":1405080642000},"page":"477-484","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":82,"title":["A comprehensive benchmark set and heuristics for the traveling thief problem"],"prefix":"10.1145","author":[{"given":"Sergey","family":"Polyakovskiy","sequence":"first","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}]},{"given":"Mohammad Reza","family":"Bonyadi","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}]},{"given":"Markus","family":"Wagner","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}]},{"given":"Zbigniew","family":"Michalewicz","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}]}],"member":"320","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Advanced generator for 0--1 Knapsack Problems. See http:\/\/www.diku.dk\/~pisinger\/codes.html.  Advanced generator for 0--1 Knapsack Problems. See http:\/\/www.diku.dk\/~pisinger\/codes.html."},{"key":"e_1_3_2_1_2_1","unstructured":"TSP Test Data. See http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/index.html.  TSP Test Data. See http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/index.html."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.1.82.15157"},{"key":"e_1_3_2_1_4_1","first-page":"1037","volume-title":"IEEE Congress on Evolutionary Computation","author":"Bonyadi M. R.","year":"2013","unstructured":"M. R. Bonyadi , Z. Michalewicz , and L. Barone . The travelling thief problem: The first step in the transition from theoretical problems to realistic problems . In IEEE Congress on Evolutionary Computation , pp. 1037 -- 1044 . IEEE, 2013 . M. R. Bonyadi, Z. Michalewicz, and L. Barone. The travelling thief problem: The first step in the transition from theoretical problems to realistic problems. In IEEE Congress on Evolutionary Computation, pp. 1037--1044. IEEE, 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598367"},{"key":"e_1_3_2_1_6_1","first-page":"62","volume-title":"A. Dress","author":"Kara I.","year":"2007","unstructured":"I. Kara , B. Y. Kara , and M. K. Yetis . Energy minimizing vehicle routing problem . In A. Dress , Y. Xu, and B. Zhu, editors, Combinatorial Optimization and Applications, Vol . 4616 of phLecture Notes in Computer Science, pp. 62 -- 71 . Springer Berlin Heidelberg , 2007 . I. Kara, B. Y. Kara, and M. K. Yetis. Energy minimizing vehicle routing problem. In A. Dress, Y. Xu, and B. Zhu, editors, Combinatorial Optimization and Applications, Vol. 4616 of phLecture Notes in Computer Science, pp. 62--71. Springer Berlin Heidelberg, 2007."},{"key":"e_1_3_2_1_7_1","first-page":"16","article-title":"Green capacitated vehicle routing problem fuel consumption optimization model","volume":"3","author":"Kucukoglu I.","unstructured":"I. Kucukoglu , S. Ene , A. Aksoy , and N. Ozturk . Green capacitated vehicle routing problem fuel consumption optimization model . Computational Engineering Research , 3 : 16 -- 23 . I. Kucukoglu, S. Ene, A. Aksoy, and N. Ozturk. Green capacitated vehicle routing problem fuel consumption optimization model. Computational Engineering Research, 3: 16--23.","journal-title":"Computational Engineering Research"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.07.107"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.45.3.414"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"}],"event":{"name":"GECCO '14: Genetic and Evolutionary Computation Conference","location":"Vancouver BC Canada","acronym":"GECCO '14","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598249","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2576768.2598249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:00Z","timestamp":1750277640000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,12]]},"references-count":10,"alternative-id":["10.1145\/2576768.2598249","10.1145\/2576768"],"URL":"https:\/\/doi.org\/10.1145\/2576768.2598249","relation":{},"subject":[],"published":{"date-parts":[[2014,7,12]]},"assertion":[{"value":"2014-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}