{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T08:04:35Z","timestamp":1769587475658,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T00:00:00Z","timestamp":1510617600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71372088"],"award-info":[{"award-number":["71372088"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s12351-017-0363-0","type":"journal-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T11:19:45Z","timestamp":1510658385000},"page":"1093-1112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Disturbance management for vehicle routing with time window changes"],"prefix":"10.1007","volume":"20","author":[{"given":"Hualong","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Di","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiangshan","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,14]]},"reference":[{"issue":"5","key":"363_CR1","first-page":"40","volume":"28","author":"J Clausen","year":"2001","unstructured":"Clausen J, Jesper H, Jesper L (2001) Disruption management. OR\/MS 28(5):40\u201343","journal-title":"OR\/MS"},{"key":"363_CR2","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","volume":"39","author":"JF Cordeau","year":"2012","unstructured":"Cordeau JF, Maischberger M (2012) A parallel iterated tabu search heuristic for vehicle routing problems. Comput Oper Res 39:2033\u20132050","journal-title":"Comput Oper Res"},{"issue":"1","key":"363_CR3","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig G, Ramser J (1959) The truck dispatching problem. Manag Sci 6(1):80\u201391","journal-title":"Manag Sci"},{"key":"363_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.cie.2015.03.006","volume":"85","author":"J Armas De","year":"2015","unstructured":"De Armas J, Batista BM (2015) Variable neighborhood search for a dynamic rich vehicle routing problem with time windows. Comput Ind Eng 85:120\u2013131","journal-title":"Comput Ind Eng"},{"key":"363_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.endm.2014.11.030","volume":"47","author":"A Dhahri","year":"2015","unstructured":"Dhahri A, Zidi K, Ghedira K (2015) A variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities. Electron Notes Discrete Math 47:229\u2013236","journal-title":"Electron Notes Discrete Math"},{"key":"363_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.neucom.2011.09.040","volume":"98","author":"QL Ding","year":"2012","unstructured":"Ding QL, Hu XP, Sun LJ, Wang YZ (2012) An improved ant colony optimization and its application to vehicle routing problem with time windows. Neurocomputing 98:101\u2013107","journal-title":"Neurocomputing"},{"key":"363_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.swevo.2014.12.003","volume":"21","author":"J Euchi","year":"2015","unstructured":"Euchi J, Yassine A, Chabchoub H (2015) The dynamic vehicle routing problem: solution with hybrid metaheuristic approach. Swarm Evolut Comput 21:41\u201353","journal-title":"Swarm Evolut Comput"},{"issue":"1","key":"363_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 (2013) 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","journal-title":"Eur J Oper Res"},{"key":"363_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.cie.2012.01.005","volume":"65","author":"FP Goksal","year":"2013","unstructured":"Goksal FP, Karaoglan I, Altiparmak F (2013) A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Comput Ind Eng 65:39\u201353","journal-title":"Comput Ind Eng"},{"key":"363_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.cor.2013.08.017","volume":"43","author":"MH H\u00e0","year":"2014","unstructured":"H\u00e0 MH, Bostel N, Langevin A, Rousseau LM (2014) An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size. Comput Oper Res 43:9\u201319","journal-title":"Comput Oper Res"},{"issue":"1","key":"363_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ejor.2010.08.021","volume":"209","author":"L H\u00e4me","year":"2011","unstructured":"H\u00e4me L (2011) An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows. Eur J Oper Res 209(1):11\u201322","journal-title":"Eur J Oper Res"},{"issue":"5","key":"363_CR12","first-page":"1255","volume":"33","author":"XF He","year":"2013","unstructured":"He XF, Ma L (2013) Quantum-inspired ant colony algorithm for vehicle routing problem with time windows. Syst Eng Theory Practice 33(5):1255\u20131261","journal-title":"Syst Eng Theory Practice"},{"key":"363_CR13","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press, Ann Arbor"},{"issue":"1","key":"363_CR14","first-page":"50","volume":"14","author":"XP Hu","year":"2011","unstructured":"Hu XP, Sun LJ, Wang YN (2011) A model for disruption management in urban distribution systems. J Manag Sci China 14(1):50\u201360","journal-title":"J Manag Sci China"},{"key":"363_CR15","doi-asserted-by":"publisher","first-page":"1380","DOI":"10.1016\/j.dss.2012.12.014","volume":"54","author":"XP Hu","year":"2013","unstructured":"Hu XP, Sun LJ, Liu LL (2013) A PAM approach to handling disruptions in real-time vehicle routing problems. Decis Support Syst 54:1380\u20131393","journal-title":"Decis Support Syst"},{"key":"363_CR16","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/j.asoc.2014.11.005","volume":"27","author":"S Karakatic","year":"2015","unstructured":"Karakatic S, Podgorelec V (2015) A survey of genetic algorithms for solving multi depot vehicle routing problem. Appl Soft Comput 27:519\u2013532","journal-title":"Appl Soft Comput"},{"key":"363_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J Lenstra","year":"1981","unstructured":"Lenstra J, Rinnooy KA (1981) Complexity of vehicle routing and scheduling problems. Networks 11:221\u2013227","journal-title":"Networks"},{"issue":"4","key":"363_CR18","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1016\/j.cor.2005.05.022","volume":"34","author":"JQ Li","year":"2007","unstructured":"Li JQ, Borenstein D, Mirchandani PB (2007) A decision support system for the single-depot vehicle rescheduling problem. Comput Oper Res 34(4):1008\u20131032","journal-title":"Comput Oper Res"},{"issue":"5","key":"363_CR19","first-page":"114","volume":"8","author":"X Liu","year":"2008","unstructured":"Liu X, Qi H (2008) Local search algorithm of dynamic vehicle routing problem with time window. J Traffic Trans Eng 8(5):114\u2013120","journal-title":"J Traffic Trans Eng"},{"key":"363_CR20","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.trb.2015.05.009","volume":"81","author":"M Liu","year":"2015","unstructured":"Liu M, Luo Z, Lim A (2015) A branch-and-cut algorithm for a realistic dial-a-ride problem. Trans Res Part B Methodol 81:267\u2013288","journal-title":"Trans Res Part B Methodol"},{"key":"363_CR21","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.asoc.2013.01.007","volume":"13","author":"Y Marinakis","year":"2013","unstructured":"Marinakis Y, Iordanidou GR, Marinaki M (2013) Particle swarm optimization for the vehicle routing problem with stochastic demands. Appl Soft Comput 13:1693\u20131704","journal-title":"Appl Soft Comput"},{"key":"363_CR22","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, Gu\u00e9ret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225:1\u201311","journal-title":"Eur J Oper Res"},{"key":"363_CR23","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.cor.2004.09.015","volume":"33","author":"JY Potvin","year":"2006","unstructured":"Potvin JY, Xu Y, Benyahia I (2006) Vehicle routing and scheduling with dynamic travel times. Comput Oper Res 33:1129\u20131137","journal-title":"Comput Oper Res"},{"key":"363_CR24","doi-asserted-by":"publisher","first-page":"1922","DOI":"10.1016\/j.sbspro.2015.06.203","volume":"195","author":"NM Razali","year":"2015","unstructured":"Razali NM (2015) An efficient genetic algorithm for large scale vehicle routing problem subject to precedence constraints. Soc Behav Sci 195:1922\u20131931","journal-title":"Soc Behav Sci"},{"key":"363_CR25","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.asoc.2013.10.017","volume":"15","author":"M Reed","year":"2014","unstructured":"Reed M, Yiannakou A, Evering R (2014) An ant colony algorithm for the multi-compartment vehicle routing problem. Appl Soft Comput 15:169\u2013176","journal-title":"Appl Soft Comput"},{"key":"363_CR26","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1016\/j.ejor.2015.04.009","volume":"245","author":"M Schyns","year":"2015","unstructured":"Schyns M (2015) An ant colony system for responsive dynamic vehicle routing. Eur J Oper Res 245:704\u2013718","journal-title":"Eur J Oper Res"},{"key":"363_CR27","unstructured":"Solomon M (2009) Solomon benchmark problems, \nhttp:\/\/www.idsia.ch\/~luca\/macs-vrptw\/problems\/welcome.html"},{"issue":"12","key":"363_CR28","first-page":"452","volume":"5","author":"XP Wang","year":"2010","unstructured":"Wang XP, Wu X, Hu XP (2010) A study of urgency vehicle routing disruption management problem. J Netw 5(12):452\u2013455","journal-title":"J Netw"},{"key":"363_CR29","doi-asserted-by":"publisher","DOI":"10.1142\/5632","volume-title":"Disruption Management: framework, models and applications","author":"G Yu","year":"2004","unstructured":"Yu G, Qi X (2004) Disruption Management: framework, models and applications. World Scientific Publishing Co. Pte. Ltd, Singapore"},{"key":"363_CR30","volume-title":"Optimization applications in the airline industry","author":"G Yu","year":"1999","unstructured":"Yu G, Yang J (1999) Optimization applications in the airline industry. Springer, Berlin"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0363-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-017-0363-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0363-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T02:18:31Z","timestamp":1588040311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-017-0363-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,14]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["363"],"URL":"https:\/\/doi.org\/10.1007\/s12351-017-0363-0","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,14]]},"assertion":[{"value":"21 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}