{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T19:40:02Z","timestamp":1748979602665,"version":"3.41.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319396354"},{"type":"electronic","value":"9783319396361"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-39636-1_3","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T10:36:37Z","timestamp":1464086197000},"page":"32-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Variable Neighbourhood Descent with Memory: A Hybrid Metaheuristic for Supermarket Resupply"],"prefix":"10.1007","author":[{"given":"Philip","family":"Mourdjis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujie","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fiona","family":"Polack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Cowling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"issue":"part B","key":"3_CR1","first-page":"269","volume":"52","author":"S Belhaiza","year":"2013","unstructured":"Belhaiza, S., Hansen, P., Laporte, G.: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput. Oper. Res. 52(part B), 269\u2013281 (2013)","journal-title":"Comput. Oper. Res."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-45193-8_9","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"R Bent","year":"2003","unstructured":"Bent, R., Van Hentenryck, P.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 123\u2013137. Springer, Heidelberg (2003)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Blocho, M.: A parallel algorithm for minimizing the fleet size in the pickup and delivery problem with time windows. In: Proceedings of the 22nd European MPI Users\u2019 Group Meeting, pp. 20\u201321. ACM (2015)","DOI":"10.1145\/2802658.2802673"},{"issue":"6","key":"3_CR4","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11(6), 4135\u20134151 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","volume":"15","author":"O Br\u00e4ysy","year":"2003","unstructured":"Br\u00e4ysy, O.: A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J. Comput. 15(4), 347\u2013368 (2003)","journal-title":"INFORMS J. Comput."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-75514-2_3","volume-title":"Hybrid Metaheuristics","author":"T Cari\u0107","year":"2007","unstructured":"Cari\u0107, T., Fosin, J., Gali\u0107, A., Gold, H., Reinholz, A.: Empirical analysis of two different metaheuristics for real-world vehicle routing problems. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI\/ICCV 2007. LNCS, vol. 4771, pp. 31\u201344. Springer, Heidelberg (2007)"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.cor.2015.04.002","volume":"62","author":"M Cherkesly","year":"2015","unstructured":"Cherkesly, M., Desaulniers, G., Laporte, G.: Branch-price-and-cut algorithns for the pickup and delivery problem with time windows and LIFO loading. Comput. Oper. Res. 62(1), 23\u201335 (2015)","journal-title":"Comput. Oper. Res."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"JF Cordeau","year":"2003","unstructured":"Cordeau, J.F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B Methodol. 37, 579\u2013594 (2003)","journal-title":"Transp. Res. Part B Methodol."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"PI Cowling","year":"2001","unstructured":"Cowling, P.I., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176\u2013190. Springer, Heidelberg (2001)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/1.9780898718515.ch9","volume-title":"The Vehicle Routing Problem","author":"G Desaulniers","year":"2002","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M., Erdmann, A., Soumis, F.: VRP with pickup and delivery. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 225\u2013242. SIAM, Philadelphia (2002)"},{"key":"3_CR11","series-title":"Whitestein Series in Software Agent Technologies","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-7643-7363-6_3","volume-title":"Applications of Agent Technology in Traffic and Transportation","author":"K Dorer","year":"2005","unstructured":"Dorer, K., Calisti, M.: An adaptive approach to dynamic transport optimization. In: Klugl, F., Bazzan, A., Ossowski, S. (eds.) Applications of Agent Technology in Traffic and Transportation. Whitestein Series in Software Agent Technologies, pp. 33\u201349. Birkh\u00e4user, Basel (2005)"},{"issue":"1","key":"3_CR12","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."},{"issue":"6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New insertion and post optimization procedures for the traveling salesman problem. Oper. Res. 40(6), 1086\u20131095 (1992)","journal-title":"Oper. Res."},{"key":"3_CR14","unstructured":"Gschwind, T., Irnich, S., Mainz, D.: Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing. Technical report, Johannes Gutenberg University Mainz, Mainz, Germany. Retrieved from (2012). http:\/\/logistik.bwl.uni-mainz.de\/"},{"key":"3_CR15","series-title":"Applied Mathematics at SINTEF","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68783-2","volume-title":"Geometric Modelling, Numerical Simuation, and Optimization","author":"G Hasle","year":"2007","unstructured":"Hasle, G., Lie, K.A., Quak, E.: Geometric Modelling, Numerical Simuation, and Optimization. Applied Mathematics at SINTEF, vol. 54. Springer, Heidelberg (2007)"},{"key":"3_CR16","unstructured":"Hosny, M.I.: Investigating Heuristic and Meta-Heuristic Algorithms for Solving Pickup and Delivery Problems Manar Ibrahim Hosny School of Computer Science & Informatics. Ph.D. thesis, Cardiff University (2010)"},{"key":"3_CR17","unstructured":"Koning, D.: Using Column Generation for the Pickup and Delivery Problem with Disturbances. Masters thesis, Universiteit Utrecht (2011)"},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43(4), 408\u2013416 (2009)","journal-title":"Transp. Sci."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: Tools with Artificial Intelligence, pp. 160\u2013167. IEEE (2001)","DOI":"10.1109\/ICTAI.2001.974461"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-88439-2_3","volume-title":"Hybrid Metaheuristics","author":"A Ostertag","year":"2008","unstructured":"Ostertag, A., Doerner, K.F., Hartl, R.F.: A variable neighborhood search integrated in the POPMUSIC framework for solving large scale vehicle routing problems. In: Blesa, M.J., Blum, C., Cotta, C., Fern\u00e1ndez, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol. 5296, pp. 29\u201342. Springer, Heidelberg (2008)"},{"issue":"5","key":"3_CR21","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10732-007-9045-z","volume":"14","author":"DC Paraskevopoulos","year":"2008","unstructured":"Paraskevopoulos, D.C., Repoussis, P.P., Tarantilis, C.D., Ioannou, G., Prastacos, G.P.: A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows. J. Heuristics 14(5), 425\u2013455 (2008)","journal-title":"J. Heuristics"},{"issue":"6","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.cor.2009.10.003","volume":"37","author":"SN Parragh","year":"2009","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 37(6), 1129\u20131138 (2009)","journal-title":"Comput. Oper. Res."},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-04918-7_4","volume-title":"Hybrid Metaheuristics","author":"S Pirkwieser","year":"2009","unstructured":"Pirkwieser, S., Raidl, G.R.: Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 45\u201359. Springer, Heidelberg (2009)"},{"key":"3_CR24","unstructured":"Quintiq: PDPTW World Records (2015). http:\/\/www.quintiq.com\/optimization\/pdptw-world-records.html"},{"issue":"3","key":"3_CR25","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1057\/jors.2011.48","volume":"63","author":"S Remde","year":"2011","unstructured":"Remde, S., Cowling, P.I., Dahal, K., Colledge, N., Selensky, E.: An empirical study of hyperheuristics for managing very large sets of low level heuristics. J. Oper. Res. Soc. 63(3), 392\u2013405 (2011)","journal-title":"J. Oper. Res. Soc."},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/11890584_10","volume-title":"Hybrid Metaheuristics","author":"PP Repoussis","year":"2006","unstructured":"Repoussis, P.P., Paraskevopoulos, D.C., Tarantilis, C.D., Ioannou, G.: A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows. In: Almeida, F., Blesa Aguilera, M.J., Blum, C., Moreno Vega, J.M., P\u00e9rez P\u00e9rez, M., Roli, A., Sampels, M. (eds.) HM 2006. LNCS, vol. 4030, pp. 124\u2013138. Springer, Heidelberg (2006)"},{"issue":"4","key":"3_CR27","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2005","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 (2005)","journal-title":"Transp. Sci."},{"issue":"2","key":"3_CR28","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"MWP Savelsbergh","year":"1992","unstructured":"Savelsbergh, M.W.P.: The vehicle routing problem with time windows: minimizing route duration. INFORMS J. Comput. 4(2), 146\u2013154 (1992)","journal-title":"INFORMS J. Comput."},{"key":"3_CR29","unstructured":"Statistica: Number of stores of leading grocery retailers in the United Kingdom (UK) as of (2013). http:\/\/www.statista.com\/statistics\/299155\/number-of-stores-of-grocery-retailers-supermarkets-united-kingdom-uk\/"},{"key":"3_CR30","unstructured":"TetraSoft, A.: MapBooking Algoritm for Pickup and Delivery Solutions with Time Windows and Capacity restraints. (2003). http:\/\/www.tetrasoft.dk\/english-info\/"},{"issue":"1","key":"3_CR31","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1287\/trsc.31.1.60","volume":"31","author":"P Toth","year":"1997","unstructured":"Toth, P., Vigo, D.: Heuristic algorithms for the handicapped persons transportation problem. Transp. Sci. 31(1), 60\u201371 (1997)","journal-title":"Transp. Sci."},{"issue":"3\u20134","key":"3_CR32","first-page":"279","volume":"8","author":"CJCH Watkins","year":"1992","unstructured":"Watkins, C.J.C.H., Dayan, P.: Q-learning. Mach. Learn. 8(3\u20134), 279\u2013292 (1992)","journal-title":"Mach. Learn."},{"issue":"3","key":"3_CR33","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","volume":"37","author":"H Xu","year":"2003","unstructured":"Xu, H., Chen, Z.L., Rajagopal, S., Arunapuram, S.: Solving a practical pickup and delivery problem. Transp. Sci. 37(3), 347\u2013364 (2003)","journal-title":"Transp. Sci."}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39636-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T19:08:48Z","timestamp":1748977728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39636-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319396354","9783319396361"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39636-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}