{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:52Z","timestamp":1742914072838,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581114"},{"type":"electronic","value":"9783030581121"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58112-1_24","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:04:30Z","timestamp":1599062670000},"page":"346-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions"],"prefix":"10.1007","author":[{"given":"Jakob","family":"Bossek","sequence":"first","affiliation":[]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"issue":"170","key":"24_CR1","first-page":"1","volume":"17","author":"B Bischl","year":"2016","unstructured":"Bischl, B., et al.: mlr: Machine learning in R. J. Mach. Learn. Res. 17(170), 1\u20135 (2016). \nhttp:\/\/jmlr.org\/papers\/v17\/15-066.html","journal-title":"J. Mach. Learn. Res."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, W.R., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pp. 163\u2013171 (1994)","DOI":"10.1145\/195058.195125"},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Bonyadi, M.R., Michalewicz, Z., Barone, L.: The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In: 2013 IEEE Congress on Evolutionary Computation, pp. 1037\u20131044 (2013). \nhttps:\/\/doi.org\/10.1109\/CEC.2013.6557681","DOI":"10.1109\/CEC.2013.6557681"},{"key":"24_CR4","series-title":"Management and Industrial Engineering","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-030-01641-8_2","volume-title":"Optimization in Industry","author":"MR Bonyadi","year":"2019","unstructured":"Bonyadi, M.R., Michalewicz, Z., Wagner, M., Neumann, F.: Evolutionary computation for multicomponent problems: opportunities and future directions. In: Datta, S., Davim, J.P. (eds.) Optimization in Industry. MIE, pp. 13\u201330. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-01641-8_2"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Bossek, J., Casel, K., Kerschke, P., Neumann, F.: The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics (2020). to appear at GECCO 2020","DOI":"10.1145\/3377930.3390243"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"El Yafrani, M., Ahiod, B.: Population-based vs. single-solution heuristics for the travelling thief problem. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 317\u2013324. ACM (2016)","DOI":"10.1145\/2908812.2908847"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Faulkner, H., Polyakovskiy, S., Schultz, T., Wagner, M.: Approximate approaches to the traveling thief problem. In: Conference on Genetic and Evolutionary Computation (GECCO), pp. 385\u2013392. ACM (2015)","DOI":"10.1145\/2739480.2754716"},{"key":"24_CR8","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E Lawler","year":"1985","unstructured":"Lawler, E.: The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Hoboken (1985). \nhttps:\/\/books.google.com.au\/books?id=qbFlMwEACAAJ"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00500-014-1487-2","volume":"20","author":"Y Mei","year":"2016","unstructured":"Mei, Y., Li, X., Yao, X.: On investigation of interdependence between sub-problems of the travelling thief problem. Soft Comput. 20(1), 157\u2013172 (2016)","journal-title":"Soft Comput."},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-19759-9_5","volume-title":"Algorithmic Aspects of Cloud Computing","author":"F Neumann","year":"2019","unstructured":"Neumann, F., Polyakovskiy, S., Skutella, M., Stougie, L., Wu, J.: A fully polynomial time approximation scheme for packing while traveling. In: Disser, Y., Verykios, V.S. (eds.) ALGOCLOUD 2018. LNCS, vol. 11409, pp. 59\u201372. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-19759-9_5"},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 477\u2013484. ACM (2014). \nhttps:\/\/doi.org\/10.1145\/2576768.2598249","DOI":"10.1145\/2576768.2598249"},{"issue":"4","key":"24_CR12","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"24_CR13","unstructured":"Therneau, T., Atkinson, B.: rpart: recursive partitioning and regression trees (2018). \nhttps:\/\/CRAN.R-project.org\/package=rpart\n\n. R package version 4.1-13"},{"key":"24_CR14","first-page":"431","volume-title":"Average-Case Analysis of Algorithms and Data Structures","author":"JS Vitter","year":"1991","unstructured":"Vitter, J.S., Flajolet, P.: Average-Case Analysis of Algorithms and Data Structures, pp. 431\u2013524. MIT Press, Cambridge (1991)"},{"issue":"3","key":"24_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10732-017-9328-y","volume":"24","author":"M Wagner","year":"2017","unstructured":"Wagner, M., Lindauer, M., M\u0131s\u0131r, M., Nallaperuma, S., Hutter, F.: A case study of algorithm selection for the traveling thief problem. J. Heuristics 24(3), 295\u2013320 (2017). \nhttps:\/\/doi.org\/10.1007\/s10732-017-9328-y","journal-title":"J. Heuristics"},{"key":"24_CR16","doi-asserted-by":"publisher","unstructured":"Wu, J., Polyakovskiy, S., Neumann, F.: On the impact of the renting rate for the unconstrained nonlinear knapsack problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 413\u2013419. ACM (2016). \nhttps:\/\/doi.org\/10.1145\/2908812.2908862","DOI":"10.1145\/2908812.2908862"},{"key":"24_CR17","doi-asserted-by":"publisher","unstructured":"Wu, J., Polyakovskiy, S., Wagner, M., Neumann, F.: Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 777\u2013784. ACM (2018). \nhttps:\/\/doi.org\/10.1145\/3205455.3205488","DOI":"10.1145\/3205455.3205488"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Wu, J., Wagner, M., Polyakovskiy, S., Neumann, F.: Exact approaches for the travelling thief problem. In: Proceedings of the 11th International Conference on Simulated Evolution and Learning (SEAL), pp. 110\u2013121 (2017)","DOI":"10.1007\/978-3-319-68759-9_10"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ins.2017.12.011","volume":"432","author":"ME Yafrani","year":"2018","unstructured":"Yafrani, M.E., Ahiod, B.: Efficiently solving the traveling thief problem using hill climbing and simulated annealing. Inf. Sci. 432, 231\u2013244 (2018)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58112-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:17:00Z","timestamp":1599063420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"31 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"268","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}