{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:53:48Z","timestamp":1776956028888,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319687582","type":"print"},{"value":"9783319687599","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68759-9_10","type":"book-chapter","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T22:33:42Z","timestamp":1507847622000},"page":"110-121","source":"Crossref","is-referenced-by-count":24,"title":["Exact Approaches for the Travelling Thief\u00a0Problem"],"prefix":"10.1007","author":[{"given":"Junhua","family":"Wu","sequence":"first","affiliation":[]},{"given":"Markus","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Sergey","family":"Polyakovskiy","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"key":"10_CR1","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Concorde TSP solver (2006). http:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10601-012-9119-x","volume":"17","author":"P Benchimol","year":"2012","unstructured":"Benchimol, P., Van Hoeve, W.-J., R\u00e9gin, J.-C., Rousseau, L.-M., Rueher, M.: Improved filtering for weighted circuit constraints. Constraints 17(3), 205\u2013233 (2012). doi: 10.1007\/s10601-012-9119-x . ISSN 1572-9354","journal-title":"Constraints"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bonyadi, M., 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 (CEC), pp. 1037\u20131044 (2013)","DOI":"10.1109\/CEC.2013.6557681"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.R., Michalewicz, Z., Przybylek, M.R., Wierzbicki, A.: Socially inspired algorithms for the travelling thief problem. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, GECCO 2014, pp. 421\u2013428. ACM (2014)","DOI":"10.1145\/2576768.2598367"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"El Yafrani, M., Ahiod, B.: Cosolver2B: an efficient local search heuristic for the travelling thief problem. In: 2015 IEEE\/ACS 12th International Conference of Computer Systems and Applications (AICCSA), pp. 1\u20135. IEEE (2015)","DOI":"10.1109\/AICCSA.2015.7507099"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"El Yafrani, M., Ahiod, B.: Population-based vs. single-solution heuristics for the travelling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, GECCO 2016, pp. 317\u2013324. ACM (2016)","DOI":"10.1145\/2908812.2908847"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Faulkner, H., Polyakovskiy, S., Schultz, T., Wagner, M.: Approximate approaches to the traveling thief problem. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO 2015, pp. 385\u2013392. ACM (2015)","DOI":"10.1145\/2739480.2754716"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. In: Proceedings of the 1961 16th ACM National Meeting, ACM 1961, pp. 71.201-71.204. ACM (1961)","DOI":"10.1145\/800029.808532"},{"issue":"4","key":"10_CR9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1287\/ijoc.14.4.295.2828","volume":"14","author":"JN Hooker","year":"2002","unstructured":"Hooker, J.N.: Logic, optimization, and constraint programming. INFORMS J. Comput. 14(4), 295\u2013321 (2002)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"10_CR10","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-319-13563-2_53","volume-title":"Simulated Evolution and Learning","author":"Y Mei","year":"2014","unstructured":"Mei, Y., Li, X., Yao, X.: Improving efficiency of heuristics for the large scale traveling thief problem. In: Dick, G., et al. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 631\u2013643. Springer, Cham (2014). doi: 10.1007\/978-3-319-13563-2_53 . ISBN 978-3-319-13563-2"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Mei, Y., Li, X., Salim, F., Yao, X.: Heuristic evolution with genetic programming for traveling thief problem. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 2753\u20132760, May 2015. doi: 10.1109\/CEC.2015.7257230","DOI":"10.1109\/CEC.2015.7257230"},{"issue":"1","key":"10_CR13","doi-asserted-by":"crossref","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":"10_CR14","unstructured":"Neumann, F., Polyakovskiy, S., Skutella, M., Stougie, L., Wu, J.: A Fully Polynomial Time Approximation Scheme for Packing While Traveling. ArXiv e-prints (2017)"},{"key":"10_CR15","unstructured":"Pisinger, D.: Advanced Generator for 0\u20131 Knapsack Problem. http:\/\/www.diku.dk\/~pisinger\/codes.html"},{"issue":"9","key":"10_CR16","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D.: Where are the hard knapsack problems? Comput. Oper. Res. 32(9), 2271\u20132284 (2005). doi: 10.1016\/j.cor.2004.03.002 . ISSN 0305-0548","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10_CR17","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.ejor.2016.09.035","volume":"258","author":"S Polyakovskiy","year":"2017","unstructured":"Polyakovskiy, S., Neumann, F.: The packing while traveling problem. Eur. J. Oper. Res. 258(2), 424\u2013439 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR18","doi-asserted-by":"crossref","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 2014 Annual Conference on Genetic and Evolutionary Computation, GECCO 2014, pp. 477\u2013484. ACM (2014)","DOI":"10.1145\/2576768.2598249"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Refalo","year":"2004","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557\u2013571. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30201-8_41"},{"issue":"4","key":"10_CR20","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"issue":"8","key":"10_CR21","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: MAX MIN ant system. Future Gener. Comput. Syst. 16(8), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-319-44427-7_25","volume-title":"Swarm Intelligence","author":"M Wagner","year":"2016","unstructured":"Wagner, M.: Stealing items more efficiently with ants: a swarm intelligence approach to the travelling thief problem. In: Dorigo, M., Birattari, M., Li, X., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ohkura, K., Pinciroli, C., St\u00fctzle, T. (eds.) ANTS 2016. LNCS, vol. 9882, pp. 273\u2013281. Springer, Cham (2016). doi: 10.1007\/978-3-319-44427-7_25"},{"key":"10_CR23","doi-asserted-by":"crossref","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 pp. 1\u201326 (2017)","DOI":"10.1007\/s10732-017-9328-y"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68759-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T12:18:11Z","timestamp":1570191491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68759-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687582","9783319687599"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68759-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}