{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T10:08:24Z","timestamp":1787652504880,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3321707.3321766","type":"proceedings-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:48:04Z","timestamp":1562161684000},"page":"329-337","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Investigation of the traveling thief problem"],"prefix":"10.1145","author":[{"given":"Rogier Hans","family":"Wuijts","sequence":"first","affiliation":[{"name":"Utrecht University, Utrecht, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dirk","family":"Thierens","sequence":"additional","affiliation":[{"name":"Utrecht University, Utrecht, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598367"},{"key":"e_1_3_2_1_2_1","first-page":"162","article-title":"Applying adaptive algorithms to epistatic domains","volume":"85","author":"Davis Lawrence","year":"1985","unstructured":"Lawrence Davis . 1985 . Applying adaptive algorithms to epistatic domains .. In IJCAI , Vol. 85. 162 -- 164 . Lawrence Davis. 1985. Applying adaptive algorithms to epistatic domains.. In IJCAI, Vol. 85. 162--164.","journal-title":"IJCAI"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908847"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.09.047"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-017-9308-x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754716"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of an international conference on genetic algorithms and their applications","volume":"154","author":"Goldberg David E","year":"1985","unstructured":"David E Goldberg , Robert Lingle , 1985 . Alleles, loci, and the traveling salesman problem . In Proceedings of an international conference on genetic algorithms and their applications , Vol. 154 . Lawrence Erlbaum, Hillsdale, NJ, 154--159. David E Goldberg, Robert Lingle, et al. 1985. Alleles, loci, and the traveling salesman problem. In Proceedings of an international conference on genetic algorithms and their applications, Vol. 154. Lawrence Erlbaum, Hillsdale, NJ, 154--159."},{"key":"e_1_3_2_1_8_1","unstructured":"Terry Jones and Stephanie Forrest. 1995. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. (1995) 184--192.   Terry Jones and Stephanie Forrest. 1995. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. (1995) 184--192."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-30698-8_3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071235"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13563-2_53"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1487-2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-62395-5_45"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(88)90098-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_38"},{"key":"e_1_3_2_1_16_1","volume-title":"A Fully Polynomial Time Approximation Scheme for Packing While Traveling. arXiv preprint arXiv:1702.05217","author":"Neumann Frank","year":"2017","unstructured":"Frank Neumann , Sergey Polyakovskiy , Martin Skutella , Leen Stougie , and Junhua Wu. 2017. A Fully Polynomial Time Approximation Scheme for Packing While Traveling. arXiv preprint arXiv:1702.05217 ( 2017 ). Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, and Junhua Wu. 2017. A Fully Polynomial Time Approximation Scheme for Packing While Traveling. arXiv preprint arXiv:1702.05217 (2017)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908820"},{"key":"e_1_3_2_1_18_1","volume-title":"Genetic algorithms and their applications: proceedings of the second International Conference on Genetic Algorithms.","author":"Oliver IM","year":"1987","unstructured":"IM Oliver , D Jd Smith , and John RC Holland . 1987. Study of permutation crossover operators on the traveling salesman problem . In Genetic algorithms and their applications: proceedings of the second International Conference on Genetic Algorithms. Hillsdale, NJ : L. Erlhaum Associates , 1987 . IM Oliver, DJd Smith, and John RC Holland. 1987. Study of permutation crossover operators on the traveling salesman problem. In Genetic algorithms and their applications: proceedings of the second International Conference on Genetic Algorithms. Hillsdale, NJ: L. Erlhaum Associates, 1987."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598249"},{"key":"e_1_3_2_1_20_1","volume-title":"A traveling salesman problem library. ORSA journal on computing 3, 4","author":"Reinelt Gerhard","year":"1991","unstructured":"Gerhard Reinelt . 1991. TSPLIB , A traveling salesman problem library. ORSA journal on computing 3, 4 ( 1991 ), 376--384. Gerhard Reinelt. 1991. TSPLIB, A traveling salesman problem library. ORSA journal on computing 3, 4 (1991), 376--384."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071305"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55453-2_2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44427-7_25"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-017-9328-y"},{"key":"e_1_3_2_1_25_1","volume-title":"Investigation of the Traveling Thief Problem. Master's thesis","author":"Wuijts Rogier Hans","unstructured":"Rogier Hans Wuijts . 2018. Investigation of the Traveling Thief Problem. Master's thesis . Utrecht University . Rogier Hans Wuijts. 2018. Investigation of the Traveling Thief Problem. Master's thesis. Utrecht University."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205537"}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","location":"Prague Czech Republic","acronym":"GECCO '19","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\/3321707.3321766","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321707.3321766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:19Z","timestamp":1750204399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":26,"alternative-id":["10.1145\/3321707.3321766","10.1145\/3321707"],"URL":"https:\/\/doi.org\/10.1145\/3321707.3321766","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}