{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:12:27Z","timestamp":1748751147486,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266251"},{"type":"electronic","value":"9783319266268"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_23","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T09:08:43Z","timestamp":1449652123000},"page":"307-318","source":"Crossref","is-referenced-by-count":4,"title":["A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline"],"prefix":"10.1007","author":[{"given":"Dan","family":"Yang","sequence":"first","affiliation":[]},{"given":"Xiaohan","family":"He","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Song","sequence":"additional","affiliation":[]},{"given":"Hejiao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"23_CR2","unstructured":"Wilson, N.H.M., Colvin, N.J.: Computer control of the Rochester dial-a-ride system. Massachusetts Institute of Technology. Center for Transportation Studies (1977)"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis, H.N.: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp. Sci. 14(2), 130\u2013154 (1980)","journal-title":"Transp. Sci."},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"HN Psaraftis","year":"1995","unstructured":"Psaraftis, H.N.: Dynamic vehicle routing: status and prospects. Ann. Oper. Res. 61(1), 143\u2013164 (1995)","journal-title":"Ann. Oper. Res."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-15461-4_20","volume-title":"Swarm Intelligence","author":"MR Khouadjia","year":"2010","unstructured":"Khouadjia, M.R., Alba, E., Jourdan, L., Talbi, E.-G.: Multi-swarm optimization for dynamic combinatorial problems: a case study on dynamic vehicle routing problem. In: Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Gro\u00df, R., \u015eahin, E., Sayama, H., St\u00fctzle, T. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 227\u2013238. Springer, Heidelberg (2010)"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"14","author":"M Gendreau","year":"2006","unstructured":"Gendreau, M., Guertin, F., Potvin, J.Y., et al.: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transp. Res. Part C, Emerg. Technol. 14(3), 157\u2013174 (2006)","journal-title":"Transp. Res. Part C, Emerg. Technol."},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00291-008-0135-6","volume":"32","author":"A Beaudry","year":"2010","unstructured":"Beaudry, A., Laporte, G., Melo, T., et al.: Dynamic transportation of patients in hospitals. OR Spectrum 32(1), 77\u2013107 (2010)","journal-title":"OR Spectrum"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.ejor.2012.09.016","volume":"225","author":"F Ferrucci","year":"2013","unstructured":"Ferrucci, F., Bock, S., Gendreau, M.: A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods. Eur. J. Oper. Res. 225(1), 130\u2013141 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Alvarenga, G.B., De Abreu, Silva, R.M., Mateus, G.R.: A hybrid approach for the dynamic vehicle routing problem with time windows. In: Fifth International Conference on Hybrid Intelligent Systems, HIS 2005, 7 p. IEEE (2005)","DOI":"10.1109\/ICHIS.2005.8"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Meidan, L., Yehua, S., Jing, W., et al.: Insertion heuristic algorithm for dynamic vehicle routing problem with time window. In: 2010 2nd International Conference on Information Science and Engineering (ICISE), pp. 3789\u20133792. IEEE (2010)","DOI":"10.1109\/ICISE.2010.5689112"},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cor.2011.03.006","volume":"39","author":"L Hong","year":"2012","unstructured":"Hong, L.: An improved LNS algorithm for real-time vehicle routing problem with time windows. Comp. Oper. Res. 39(2), 151\u2013163 (2012)","journal-title":"Comp. Oper. Res."},{"key":"23_CR12","unstructured":"Kilby, P., Prosser, P., Shaw, P.: Dynamic VRPs: a study of scenarios. University of Strathclyde Technical report, pp. 1\u201311 (1998)"},{"issue":"4","key":"23_CR13","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R Montemanni","year":"2005","unstructured":"Montemanni, R., Gambardella, L.M., Rizzoli, A.E., et al.: Ant colony system for a dynamic vehicle routing problem. Comb. Optim. 10(4), 327\u2013343 (2005)","journal-title":"Comb. Optim."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Elhassania, M., Jaouad, B., Ahmed, E.A.: Solving the dynamic vehicle routing problem using genetic algorithms. In: 2014 International Conference on Logistics and Operations Management (GOL), pp. 62\u201369. IEEE (2014)","DOI":"10.1109\/GOL.2014.6887419"},{"issue":"5","key":"23_CR15","first-page":"327","volume":"8","author":"MJ Elhassania","year":"2013","unstructured":"Elhassania, M.J., Jaouad, B., Ahmed, E.A.: A new hybrid algorithm to solve the vehicle routing problem in the dynamic environment. Int. J. Soft Comput. 8(5), 327\u2013334 (2013)","journal-title":"Int. J. Soft Comput."},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac, V., Gendreau, M., Guret, C., et al.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1\u201311 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"23_CR18","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 - CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"issue":"4","key":"23_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":"2","key":"23_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"ML Fisher","year":"1981","unstructured":"Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Netw. 11(2), 109\u2013124 (1981)","journal-title":"Netw."},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N Christofides","year":"1984","unstructured":"Christofides, N., Beasley, J.E.: The period routing problem. Netw. 14(2), 237\u2013256 (1984)","journal-title":"Netw."},{"issue":"8","key":"23_CR22","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9 Taillard","year":"1993","unstructured":"Taillard, \u00c9.: Parallel iterative search methods for vehicle routing problems. Netw. 23(8), 661\u2013673 (1993)","journal-title":"Netw."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T18:17:50Z","timestamp":1748715470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}