{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:40:25Z","timestamp":1762252825039,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030008970"},{"type":"electronic","value":"9783030008987"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-00898-7_16","type":"book-chapter","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T12:27:11Z","timestamp":1537360031000},"page":"253-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Matheuristic Approach to the Pickup and Delivery Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Carlo S.","family":"Sartori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciana S.","family":"Buriol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"issue":"6","key":"16_CR1","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1016\/j.cor.2005.07.025","volume":"34","author":"GB Alvarenga","year":"2007","unstructured":"Alvarenga, G.B., Mateus, G.R., De Tomi, G.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34(6), 1561\u20131584 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"16_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s13675-014-0030-7","volume":"2","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Speranza, M.G.: A survey on matheuristics for routing problems. EURO J. Comput. Optim. 2(4), 223\u2013246 (2014)","journal-title":"EURO J. Comput. Optim."},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/opre.1100.0881","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Bartolini, E., Mingozzi, A.: An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59(2), 414\u2013426 (2011)","journal-title":"Oper. Res."},{"issue":"4","key":"16_CR4","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","volume":"33","author":"R Bent","year":"2006","unstructured":"Bent, R., Van Hentenryck, P.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput. Oper. Res. 33(4), 875\u2013893 (2006)","journal-title":"Comput. Oper. Res."},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-04918-7_13","volume-title":"Hybrid Metaheuristics","author":"MA Boschetti","year":"2009","unstructured":"Boschetti, M.A., Maniezzo, V., Roffilli, M., Boluf\u00e9 R\u00f6hler, A.: Matheuristics: optimization, simulation and control. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 171\u2013177. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-04918-7_13"},{"key":"16_CR6","unstructured":"Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for exam timetabling problems. In: PATAT 2008 Conference, Montreal, Canada (2008)"},{"key":"16_CR7","unstructured":"Curtois, T., Landa-Silva, D., Qu, Y., Laesanklang, W.: Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows. EURO J. Transp. Logist., pp. 1\u201342 (2017)"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y Dumas","year":"1991","unstructured":"Dumas, Y., Desrosiers, J., Soumis, F.: The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1), 7\u201322 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.cor.2017.03.004","volume":"84","author":"P Grangier","year":"2017","unstructured":"Grangier, P., Gendreau, M., Lehu\u00e9d\u00e9, F., Rousseau, L.M.: A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. Comput. Oper. Res. 84, 116\u2013126 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"16_CR10","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1002\/nav.20261","volume":"54","author":"G Laporte","year":"2007","unstructured":"Laporte, G.: What you should know about the vehicle routing problem. Nav. Res. Logist. (NRL) 54(8), 811\u2013819 (2007)","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"02","key":"16_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1142\/S0218213003001186","volume":"12","author":"H Li","year":"2003","unstructured":"Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. Int. J. Artif. Intell. Tools 12(02), 173\u2013186 (2003)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-1-4419-1665-5_12","volume-title":"Handbook of Metaheuristics. International Series in Operations Research & Management Science","author":"HR Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 363\u2013397. Springer, Boston (2010). \n                      https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_12"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-662-49381-6_37","volume-title":"Intelligent Information and Database Systems","author":"J Nalepa","year":"2016","unstructured":"Nalepa, J., Blocho, M.: Enhanced guided ejection search for the pickup and delivery problem with time windows. In: Nguyen, N.T., Trawi\u0144ski, B., Fujita, H., Hong, T.-P. (eds.) ACIIDS 2016. LNCS (LNAI), vol. 9621, pp. 388\u2013398. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49381-6_37"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"WP Nanry","year":"2000","unstructured":"Nanry, W.P., Barnes, J.W.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transp. Res. Part B Methodol. 34(2), 107\u2013121 (2000)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. J. f\u00fcr Betriebswirtschaft 58(1), 21\u201351 (2008)","journal-title":"J. f\u00fcr Betriebswirtschaft"},{"issue":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/j.cor.2012.08.004","volume":"40","author":"SN Parragh","year":"2013","unstructured":"Parragh, S.N., Schmid, V.: Hybrid column generation and large neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 40(1), 490\u2013497 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"16_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/trsc.1090.0272","volume":"43","author":"S Ropke","year":"2009","unstructured":"Ropke, S., Cordeau, J.F.: Branch-and-cut-and-price for the pickup and delivery problem with time windows. Transp. Sci. 43(3), 267\u2013286 (2009)","journal-title":"Transp. Sci."},{"issue":"4","key":"16_CR19","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"MW Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29(1), 17\u201329 (1995)","journal-title":"Transp. Sci."},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP 1998","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"16_CR22","unstructured":"SINTEF: Li & lim benchmark instances (2008). \n                      https:\/\/www.sintef.no\/projectweb\/top\/pdptw\/li-lim-benchmark\/\n                      \n                    . Accessed 18 April 2018"},{"issue":"2","key":"16_CR23","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"10","key":"16_CR24","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1016\/j.cor.2013.01.013","volume":"40","author":"A Subramanian","year":"2013","unstructured":"Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10), 2519\u20132531 (2013)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00898-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:45:05Z","timestamp":1558327505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00898-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030008970","9783030008987"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00898-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"20 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}