{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:27:31Z","timestamp":1742923651407,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034169"},{"type":"electronic","value":"9783642034176"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03417-6_44","type":"book-chapter","created":{"date-parts":[[2009,8,5]],"date-time":"2009-08-05T03:57:54Z","timestamp":1249444674000},"page":"449-458","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Scheduling of Pigeons for Delay Constrained Applications"],"prefix":"10.1007","author":[{"given":"Jiazhen","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"Legand","family":"Burge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-88582-5_10","volume-title":"Wireless Algorithms, Systems, and Applications","author":"H. Guo","year":"2008","unstructured":"Guo, H., Li, J., Qian, Y.: HoP: Pigeon-Assisted Forwarding in Partitioned Wireless Networks. In: Li, Y., Huynh, D.T., Das, S.K., Du, D.-Z. (eds.) WASA 2008. LNCS, vol.\u00a05258, pp. 72\u201383. Springer, Heidelberg (2008)"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Guo, H., Li, J., Qian, Y., Tian, Y.: A practical routing strategy in delay tolerant networks using multiple pigeons. In: Proceedings of Milcom 2008, San Diego, CA, November 17-19 (2008)","DOI":"10.1109\/MILCOM.2008.4753116"},{"key":"44_CR3","first-page":"223","volume-title":"Vehicle routing: Methods and studies","author":"H.N. Psaraftis","year":"1988","unstructured":"Psaraftis, H.N.: Dynamic vehicle routing problems. In: Golden, B.L., Assad, A.A. (eds.) Vehicle routing: Methods and studies, pp. 223\u2013248. North Holland, Amsterdam (1988)"},{"issue":"1","key":"44_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"H.N. Psaraftis","year":"1995","unstructured":"Psaraftis, H.N.: Dynamic vehicle routing: Status and prospects. Annals of Operations Research\u00a061(1), 143\u2013164 (1995)","journal-title":"Annals of Operations Research"},{"key":"44_CR5","unstructured":"Larsen, A.: The Dynamic Vehicle Routing Problem. Dissertation, Technical University of Denmark (2000)"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1287\/opre.39.4.601","volume":"39","author":"D. Bertsimas","year":"1991","unstructured":"Bertsimas, D., van Ryzin, G.: A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operation Researches\u00a039, 601\u2013615 (1991)","journal-title":"Operation Researches"},{"key":"44_CR7","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1017\/S0001867800025842","volume":"25","author":"D. Bertsimas","year":"1993","unstructured":"Bertsimas, D., Ryzin, G.: Stochastic and Dynamic Vehicle Routing with General Demand and Interarrival Time Distribution. Advanced Applied Probability\u00a025, 947\u2013978 (1993)","journal-title":"Advanced Applied Probability"},{"issue":"3","key":"44_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0377-2217(98)00260-4","volume":"114","author":"M. Swihart","year":"1999","unstructured":"Swihart, M., Papastavrou, J.: A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. European Journal of Operational Research\u00a0114(3), 447\u2013464 (1999)","journal-title":"European Journal of Operational Research"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J. Beardwood","year":"1959","unstructured":"Beardwood, J., Halton, J., Hammersley, J.: The shortest path through many points. Proc. Camb. Phil. Soc.\u00a055, 299\u2013327 (1959)","journal-title":"Proc. Camb. Phil. Soc."},{"key":"44_CR10","unstructured":"Johnson, D.: Presented at the Mathematical Programming Symposium, Tokyo (1988)"},{"key":"44_CR11","unstructured":"Mesquite Software, Inc.: CSIM19 User\u2019s Guide, Austin, Texas (2001)"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03417-6_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T14:02:10Z","timestamp":1580306530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03417-6_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034169","9783642034176"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03417-6_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}