{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T04:42:11Z","timestamp":1770352931247,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T00:00:00Z","timestamp":1420502400000},"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":["Soft Comput"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00500-014-1574-4","type":"journal-article","created":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T07:54:06Z","timestamp":1420444446000},"page":"2481-2498","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Constrained dynamic vehicle routing problems with time windows"],"prefix":"10.1007","volume":"19","author":[{"given":"Jesica","family":"de Armas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bel\u00e9n","family":"Meli\u00e1n-Batista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,6]]},"reference":[{"key":"1574_CR1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","volume":"15","author":"O Br\u00e4ysy","year":"2003","unstructured":"Br\u00e4ysy O (2003) A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J Comput 15:347\u2013368","journal-title":"INFORMS J Comput"},{"key":"1574_CR2","unstructured":"Cassani L, Righini G (2004) Heuristic algorithms for the tsp with rear-loading. In: 35th Annual Conference of the Italian Operations Research Society (AIRO XXXV), Lecce, Italy"},{"issue":"1","key":"1574_CR3","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/trsc.1050.0133","volume":"40","author":"ZL Chen","year":"2006","unstructured":"Chen ZL, Xu H (2006) Dynamic column generation for dynamic vehicle routing with time windows. Transp Sci 40(1):74\u201388","journal-title":"Transp Sci"},{"issue":"6","key":"1574_CR4","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791\u2013812","journal-title":"Oper Res"},{"key":"1574_CR5","unstructured":"De Armas J, Meli\u00e1n-Batista B, Moreno-P\u00e9rez JA, Brito J (2013) GVNS for a real-world rich vehicle routing problem with time windows. University of La Laguna, Technical report"},{"issue":"3","key":"1574_CR6","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/j.ejor.2007.06.064","volume":"195","author":"K Fleszar","year":"2008","unstructured":"Fleszar K, Osman I, Hindi K (2008) A variable neighbourhood search algorithm for the open vehicle routing problem. Eur J Oper Res 195(3):803\u2013809","journal-title":"Eur J Oper Res"},{"key":"1574_CR7","doi-asserted-by":"crossref","unstructured":"Gendreau M, Potvin JY (eds) (2004) Focused section on real-time fleet management, vol 38. Transportation Science","DOI":"10.1287\/trsc.1030.0067"},{"issue":"6","key":"1574_CR8","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"Gendreau Michel","year":"1992","unstructured":"Michel Gendreau, Alain Hertz, Gilbert Laporte (1992) New insertion and postoptimization procedures for the traveling salesman problem. Oper Res 40(6):1086\u20131094","journal-title":"Oper Res"},{"key":"1574_CR9","doi-asserted-by":"crossref","unstructured":"Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies. Eur J Oper Res 151:1\u201311","DOI":"10.1016\/S0377-2217(02)00915-3"},{"issue":"3","key":"1574_CR10","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.ejor.2006.12.065","volume":"191","author":"A Goel","year":"2008","unstructured":"Goel A, Gruhn V (2008) A general vehicle routing problem. Eur J Oper Res 191(3):650\u2013660","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1574_CR11","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen P, Mladenovic N, Moreno-P\u00e9rez JA (2010) Variable neighbourhood search: methods and applications. Ann OR 175(1):367\u2013407","journal-title":"Ann OR"},{"issue":"3","key":"1574_CR12","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"V Hemmelmayr","year":"2009","unstructured":"Hemmelmayr V, Doerner K, Hartl R (2009) A variable neighborhood search heuristic for periodic routing problems. Eur J Oper Res 195(3):791\u2013802","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1574_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.cor.2011.03.006","volume":"39","author":"L Hong","year":"2012","unstructured":"Hong L (2012) An improved LNS algorithm for real-time vehicle routing problem with time windows. Comput Oper Res 39(2):151\u2013163","journal-title":"Comput Oper Res"},{"key":"1574_CR14","doi-asserted-by":"crossref","unstructured":"Ichoua S, Gendreau M, Potvin J-Y (2007) In: Zeimpekis V, Tarantilis CD, Giaglis GM, Minis I (eds) Planned route optimization for real-time vehicle routing., Dynamic fleet management, volume 38 of operations research\/computer science interfaces seriesSpringer, US, pp 1\u20138","DOI":"10.1007\/978-0-387-71722-7_1"},{"issue":"2","key":"1574_CR15","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","volume":"189","author":"J Nicolas","year":"2008","unstructured":"Nicolas J, Frederic S, El-Ghazali T (2008) Multi-objective vehicle routing problems. Eur J Oper Res 189(2):293\u2013309","journal-title":"Eur J Oper Res"},{"issue":"4","key":"1574_CR16","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.1016\/j.asoc.2011.10.023","volume":"12","author":"MR Khouadjia","year":"2012","unstructured":"Khouadjia MR, Sarasola B, Alba E, Jourdan L, Talbi EG (2012) A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests. Appl Soft Comput 12(4):1426\u20131439","journal-title":"Appl Soft Comput"},{"issue":"9","key":"1574_CR17","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1016\/j.cor.2005.10.010","volume":"34","author":"J Kyt\u00f6joki","year":"2007","unstructured":"Kyt\u00f6joki J, Nuortio T, Brysy O, Gendreau M (2007) An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput Oper Res 34(9):2743\u20132757","journal-title":"Comput Oper Res"},{"key":"1574_CR18","unstructured":"Lackner A (2004) Selection meta-heuristics for dynamic vehicle routing problem (Dynamische Tourenplanung mit ausgew\u00e4hlten Metaheuristiken). Number 47. G\u00f6ttinger Wirtschftinformatik"},{"key":"1574_CR19","unstructured":"Larsen A (2001) The dynamic vehicle routing problem. Ph.D. Thesis"},{"key":"1574_CR20","doi-asserted-by":"crossref","unstructured":"Larsen A, Madsen OBG, Solomon MM (2008) In: Golden B, Raghavan S, Wasil E (eds) Recent developments in dynamic vehicle routing systems., The Vehicle Routing Problem: Latest Advances and New Challenges, volume 43 of Operations Research\/Computer Science InterfacesSpringer, US, pp 199\u2013218","DOI":"10.1007\/978-0-387-77778-8_9"},{"key":"1574_CR21","unstructured":"Lund K, Madsen OBG, Rygaard JM (1996) Vehicle routing problems with varying degrees of dynamism. Technical Report, IMM Institute of Mathematical Modelling"},{"issue":"4","key":"1574_CR22","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R Montemanni","year":"2005","unstructured":"Montemanni R, Gambardella LM, Rizzoli AE, Donati A (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10(4):327\u2013343","journal-title":"J Comb Optim"},{"key":"1574_CR23","unstructured":"Ilhan O (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Xerox University Microfilms"},{"issue":"1","key":"1574_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac V, Gendreau M, Gueret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1\u201311","journal-title":"Eur J Oper Res"},{"issue":"6","key":"1574_CR25","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M Polacek","year":"2004","unstructured":"Polacek M, Hartl K, Doerner K, Reimann M (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10(6):613\u2013627","journal-title":"J Heuristics"},{"issue":"2","key":"1574_CR26","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis HN (1980) A Dynamic-programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 14(2):130\u2013154","journal-title":"Transp Sci"},{"key":"1574_CR27","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s11721-007-0005-x","volume":"1","author":"AE Rizzoli","year":"2007","unstructured":"Rizzoli AE, Montemanni R, Lucibello E, Gambardella LM (2007) Ant colony optimization for real-world vehicle routing problems. Swarm Intel 1:135\u2013151","journal-title":"Swarm Intel"},{"issue":"2","key":"1574_CR28","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle-routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"issue":"2","key":"1574_CR29","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E Taillard","year":"1997","unstructured":"Taillard E, Badeau P, Gendreau M, Guertin F, Potvin JY (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(2):170\u2013186","journal-title":"Transp Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1574-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1574-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1574-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T06:00:28Z","timestamp":1566194428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1574-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,6]]},"references-count":29,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1574"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1574-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,6]]}}}