{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:37:36Z","timestamp":1743129456588,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119958"},{"type":"electronic","value":"9783642119965"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-11996-5_6","type":"book-chapter","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T17:47:42Z","timestamp":1295459262000},"page":"59-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Serving Multiple Urban Areas with Stochastic Customer Requests"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Meisel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uli","family":"Suppa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Mattfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,20]]},"reference":[{"unstructured":"Bellman R (1957) Dynamic Programming. Princeton University Press","key":"6_CR1"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1287\/opre.39.4.601","volume":"39","author":"DJ Bertsimas","year":"1991","unstructured":"Bertsimas DJ, van Ryzin G (1991) A stochastic and dynamic vehicle routing problem in the Euclidean plane Operations Research 39:601\u2013615","journal-title":"Operations Research"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1287\/opre.41.1.60","volume":"41","author":"DJ Bertsimas","year":"1993","unstructured":"Bertsimas DJ, van Ryzin G (1993) Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Operations Research 41:60\u201376","journal-title":"Operations Research"},{"unstructured":"Bianchi L (2000) Notes on dynamic vehicle routing \u2013 The state of the art. Technical Report IDSIA-05-01, Idsia, Manno-Lugano (CH)","key":"6_CR4"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1287\/trsc.1040.0095","volume":"39","author":"J Branke","year":"2005","unstructured":"Branke J, Middendorf M, N\u00f6th G, Dessouky M (2005) Waiting strategies for dynamic vehicle routing. Transportation Science 39:298\u2013312","journal-title":"Transportation Science"},{"key":"6_CR6","volume-title":"Fleet Management and Logistics","author":"M Gendreau","year":"1998","unstructured":"Gendreau M, Potvin JY (1998) Dynamic vehicle routing and dispatching. In: Crainic T, Laporte G (eds) Fleet Management and Logistics, Kluwer, London"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M Gendreau","year":"1999","unstructured":"Gendreau M, Guertin F, Potvin JY, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science 33:381\u2013390","journal-title":"Transportation Science"},{"key":"6_CR8","volume-title":"Dynamic Fleet Management","author":"A Larsen","year":"2007","unstructured":"Larsen A, Madsen OBG, Solomon MM (2007) Classification of dynamic vehicle routing systems. In Zeimpekis V et al. (eds) Dynamic Fleet Management, Springer, New York"},{"key":"6_CR9","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"A Larsen","year":"2008","unstructured":"Larsen A, Madsen OBG, Solomon MM (2008) Recent developments in dynamic vehicle routing systems. In Golden B et al. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges, Springer, New York"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","volume":"38","author":"S Mitrovic-Minic","year":"2004","unstructured":"Mitrovic-Minic S, Laporte G. (2004) Waiting Strategies for the dynamic pickup and delivery problem with time windows. Transportation Research B 38:635\u2013655","journal-title":"Transportation Research B"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.ejor.2008.03.023","volume":"196","author":"C Novoa","year":"2009","unstructured":"Novoa C, Storer R (2009) An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. European Journal of Operational Research 196:509\u2013515","journal-title":"European Journal of Operational Research"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0377-2217(95)00189-1","volume":"95","author":"JD Papastavrou","year":"1996","unstructured":"Papastavrou JD (1996) A stochastic and dynamic routing policy using branching processes with state dependent immigration. European Journal of Operational Research 95:167\u2013177","journal-title":"European Journal of Operational Research"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/trsc.20.2.117","volume":"20","author":"W Powell","year":"1986","unstructured":"Powell W (1986) A stochastic model of the dynamic vehicle allocation problem. Transportation Science 20:117\u2013129","journal-title":"Transportation Science"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1287\/trsc.30.3.195","volume":"30","author":"W Powell","year":"1996","unstructured":"Powell W (1996) A stochastic formulation of the dynamic assignment problem with an application to truckload motor carriers. Transportation Science 30:195\u2013219","journal-title":"Transportation Science"},{"key":"6_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/9780470182963","volume-title":"approximate dynamic programming","author":"W Powell","year":"2007","unstructured":"Powell W (2007) approximate dynamic programming. Wiley, Hoboken (NJ)"},{"key":"6_CR16","volume-title":"Vehicle Routing: Methods and Studies","author":"H Psaraftis","year":"1988","unstructured":"Psaraftis H (1988) Dynamic vehicle routing problems. In: Goldan B, Assad A (eds.) Vehicle Routing: Methods and Studies. North-Holland, Amsterdam"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"H Psaraftis","year":"1995","unstructured":"Psaraftis H (1995) Dynamic vehicle routing: Status and prospects. Annals of Operations Research 61:143\u2013164","journal-title":"Annals of Operations Research"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1016\/S0305-0548(99)00146-X","volume":"27","author":"N Secomandi","year":"2000","unstructured":"Secomandi N (2000) Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Computers & OR 27:1201\u20131225","journal-title":"Computers & OR"},{"key":"6_CR19","doi-asserted-by":"publisher","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 Problem with Time Windows. Operations Research 35:254\u2013265","journal-title":"Operations Research"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/trsc.1060.0183","volume":"43","author":"B Thomas","year":"2007","unstructured":"Thomas B (2007) Waiting Strategies for Anticipating Service Requests at Known Customer Locations. Transportation Science 43:319\u2013331","journal-title":"Transportation Science"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/trsc.1030.0071","volume":"38","author":"B Thomas","year":"2004","unstructured":"Thomas B, White C (2004) Anticipatory route selection. Transportation Science 38:473\u2013484","journal-title":"Transportation Science"},{"key":"6_CR22","volume-title":"dynamic fleet management","author":"H Topaloglu","year":"2007","unstructured":"Topaloglu H (2007) A parallelizable and approximate dynamic programming-based dynamic fleet management model with random travel times and multiple vehicle types. In Zeimpekis V et al. (eds) Dynamic Fleet Management, Springer, New York"}],"container-title":["Dynamics in Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11996-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T23:30:13Z","timestamp":1674171013000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11996-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642119958","9783642119965"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11996-5_6","relation":{},"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"20 January 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}