{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T03:50:38Z","timestamp":1785210638912,"version":"3.55.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,4,2]],"date-time":"2008-04-02T00:00:00Z","timestamp":1207094400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s00291-008-0135-6","type":"journal-article","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T09:38:29Z","timestamp":1207042709000},"page":"77-107","source":"Crossref","is-referenced-by-count":166,"title":["Dynamic transportation of patients in hospitals"],"prefix":"10.1007","volume":"32","author":[{"given":"Alexandre","family":"Beaudry","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Teresa","family":"Melo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Nickel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,4,2]]},"reference":[{"key":"135_CR1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0360-8352(03)00032-9","volume":"45","author":"M Aldaihani","year":"2003","unstructured":"Aldaihani M, Dessouky M (2003) Hybrid scheduling methods for paratransit operations. Comput Ind Eng 45: 75\u201396","journal-title":"Comput Ind Eng"},{"key":"135_CR2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A Attanasio","year":"2004","unstructured":"Attanasio A, Cordeau J-F, Ghiani G, Laporte G (2004) Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30: 377\u2013387","journal-title":"Parallel Comput"},{"key":"135_CR3","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1057\/palgrave.jors.2600581","volume":"49","author":"M Banerjea-Brodeur","year":"1998","unstructured":"Banerjea-Brodeur M, Cordeau J-F, Laporte G, Lasry A (1998) Scheduling linen deliveries in a large hospital. J Oper Res Soc 49: 777\u2013780","journal-title":"J Oper Res Soc"},{"key":"135_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1080\/03052159808941240","volume":"30","author":"J Baugh","year":"1998","unstructured":"Baugh J, Krishna G, Kakivaya R, Stone J (1998) Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Eng Optim 30: 91\u2013123","journal-title":"Eng Optim"},{"key":"135_CR5","unstructured":"Beaudry A (2006) Heuristic procedures for a dynamic dial-a-ride problem for patient transportation in hospitals. Master\u2019s Thesis, HEC Montr\u00e9al, Canada"},{"key":"135_CR6","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","volume":"33","author":"R Bent","year":"2006","unstructured":"Bent R, Van Hentenryck P (2006) A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput Oper Res 33: 875\u2013893","journal-title":"Comput Oper Res"},{"key":"135_CR7","first-page":"73","volume":"22","author":"LD Bodin","year":"1986","unstructured":"Bodin LD, Sexton T (1986) The multi-vehicle subscriber dial-a-ride problem. TIMS Stud Manage Sci 22: 73\u201386","journal-title":"TIMS Stud Manage Sci"},{"key":"135_CR8","unstructured":"Bornd\u00f6rfer R, Gr\u00f6tschel M, Klostermeister F, K\u00fcttner C (1997) Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Germany. Available online at http:\/\/www.zib.de\/PaperWeb\/abstracts\/SC-97-23"},{"key":"135_CR9","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"J-F Cordeau","year":"2006","unstructured":"Cordeau J-F (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54: 573\u2013586","journal-title":"Oper Res"},{"key":"135_CR10","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"J-F Cordeau","year":"2003","unstructured":"Cordeau J-F, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res Part B 37: 579\u2013594","journal-title":"Transp Res Part B"},{"key":"135_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"J-F Cordeau","year":"2007","unstructured":"Cordeau J-F, Laporte G (2007) The dial-a-ride problem: models and algorithms. Ann Oper Res 153: 29\u201346","journal-title":"Ann Oper Res"},{"key":"135_CR12","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1016\/j.ejor.2005.02.038","volume":"175","author":"L Coslovich","year":"2006","unstructured":"Coslovich L, Pesenti R, Ukovich W (2006) A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. Eur J Oper Res 175: 1605\u20131615","journal-title":"Eur J Oper Res"},{"key":"135_CR13","first-page":"301","volume":"6","author":"J Desrosiers","year":"1986","unstructured":"Desrosiers J, Dumas Y, Soumis F (1986) A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. Am J Math Manag Sci 6: 301\u2013325","journal-title":"Am J Math Manag Sci"},{"key":"135_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-642-85966-3_3","volume-title":"Computer-aided transit scheduling. Lecture notes in economics and mathematical systems, vol 308","author":"J Desrosiers","year":"1988","unstructured":"Desrosiers J, Dumas Y, Soumis F (1988) The multiple vehicle dial-a-ride problem. In: Daduna J, Wren A (eds) Computer-aided transit scheduling. Lecture notes in economics and mathematical systems, vol 308. Springer, Berlin, pp 15\u201327"},{"key":"135_CR15","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.trb.2003.07.001","volume":"38","author":"M Diana","year":"2004","unstructured":"Diana M, Dessouky M (2004) A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Trans Res Part B 38: 539\u2013557","journal-title":"Trans Res Part B"},{"key":"135_CR16","unstructured":"Dumas Y, Desrosiers J, Soumis F (1989) Large scale multi-vehicle dial-a-ride problems. Les Cahiers du GERAD G-89-30, \u00c9cole des Hautes \u00c9tudes Commerciales, Montr\u00e9al, Canada"},{"key":"135_CR17","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0191-2615(01)00014-5","volume":"36","author":"L Fu","year":"2002","unstructured":"Fu L (2002) Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Trans Res Part B 36: 485\u2013506","journal-title":"Trans Res Part B"},{"key":"135_CR18","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/opre.46.3.330","volume":"43","author":"M Gendreau","year":"1998","unstructured":"Gendreau M, Hertz A, Laporte G, Stan M (1998) A generalized insertion heuristic for the traveling salesman problem with time windows. Oper Res 43: 330\u2013335","journal-title":"Oper Res"},{"key":"135_CR19","doi-asserted-by":"crossref","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, S\u00e9guin R (2006) Neighbourhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Trans Res Part C 14: 157\u2013174","journal-title":"Trans Res Part C"},{"key":"135_CR20","doi-asserted-by":"crossref","unstructured":"Hanne T, Melo T, Nickel S (2008) Bringing robustness to patient flow management through optimized patient transports in hospitals. Interfaces. (in press)","DOI":"10.1287\/inte.1080.0379"},{"key":"135_CR21","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1287\/trsc.1060.0166","volume":"40","author":"LM Hvattum","year":"2006","unstructured":"Hvattum LM, L\u00f8kketangen A, Laporte G (2006) Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Trans Sci 40: 421\u2013438","journal-title":"Trans Sci"},{"key":"135_CR22","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1002\/net.20182","volume":"49","author":"LM Hvattum","year":"2007","unstructured":"Hvattum LM, L\u00f8kketangen A, Laporte G (2007) A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. Networks 49: 330\u2013340","journal-title":"Networks"},{"key":"135_CR23","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","volume":"20","author":"J Jaw","year":"1986","unstructured":"Jaw J, Odoni AR, Psaraftis HN, Wilson NHM (1986) A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows. Trans Res Part B 20: 243\u2013257","journal-title":"Trans Res Part B"},{"key":"135_CR24","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1057\/palgrave.jors.2602287","volume":"58","author":"R J\u00f8rgensen","year":"2007","unstructured":"J\u00f8rgensen R, Larsen J, Bergvinsdottir KB (2007) Solving the dial-a-ride problem using genetic algorithms. J Oper Res Soc 58: 1321\u20131331","journal-title":"J Oper Res Soc"},{"key":"135_CR25","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1080\/16258312.2004.11517130","volume":"5","author":"S Landry","year":"2004","unstructured":"Landry S, Philippe R (2004) How logistics can service healthcare. Supply Chain Forum 5: 24\u201330","journal-title":"Supply Chain Forum"},{"key":"135_CR26","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"OBG Madsen","year":"1995","unstructured":"Madsen OBG, Ravn HF, Rygaard JM (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann Oper Res 60: 193\u2013208","journal-title":"Ann Oper Res"},{"key":"135_CR27","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1016\/j.cor.2005.03.024","volume":"34","author":"E Melachrinoudis","year":"2007","unstructured":"Melachrinoudis E, Ilhan A, Min H (2007) A dial-a-ride problem for client transportation in a health-care organization. Comput Oper Res 34: 742\u2013759","journal-title":"Comput Oper Res"},{"key":"135_CR28","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","volume":"38","author":"S Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107 S, Laporte G (2004) Waiting strategies for the dynamic pickup and delivery problem with time windows. Trans Res Part B 38: 635\u2013655","journal-title":"Trans Res Part B"},{"key":"135_CR29","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"WP Nanry","year":"2000","unstructured":"Nanry WP, Barnes JW (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Trans Res Part B 34: 107\u2013121","journal-title":"Trans Res Part B"},{"key":"135_CR30","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. Trans Sci 14: 130\u2013154","journal-title":"Trans Sci"},{"key":"135_CR31","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.17.3.351","volume":"17","author":"HN Psaraftis","year":"1983","unstructured":"Psaraftis HN (1983) An exact algorithm for the single-vehicle, many-to-many dial-a-ride problem with time windows. Trans Sci 17: 351\u2013357","journal-title":"Trans Sci"},{"key":"135_CR32","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Trans Sci 40: 455\u2013472","journal-title":"Trans Sci"},{"key":"135_CR33","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke S, Cordeau J-F, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems. Networks 49: 258\u2013272","journal-title":"Networks"},{"key":"135_CR34","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"MWP Savelsbergh","year":"1985","unstructured":"Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann of Oper Res 4: 285\u2013305","journal-title":"Ann of Oper Res"},{"key":"135_CR35","first-page":"369","volume":"6","author":"T Sexton","year":"1986","unstructured":"Sexton T, Choi Y-M (1986) Pickup and delivery of partial loads with soft time windows. Am J Math Manage Sci 6: 369\u2013398","journal-title":"Am J Math Manage Sci"},{"key":"135_CR36","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9D Taillard","year":"1993","unstructured":"Taillard \u00c9D (1993) Parallel iterative search methods for vehicle routing problems. Networks 23: 661\u2013673","journal-title":"Networks"},{"key":"135_CR37","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/978-1-4613-1361-8_41","volume-title":"Meta-heuristics: Theory Appl","author":"P Toth","year":"1996","unstructured":"Toth P, Vigo D (1996) Fast local search algorithms for the handicapped persons transportation problem. In: Osman IH, Kelly JP(eds) Meta-heuristics: Theory Appl. Kluwer, Boston, pp 677\u2013690"},{"key":"135_CR38","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1287\/trsc.31.1.60","volume":"31","author":"P Toth","year":"1997","unstructured":"Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Trans Sci 31: 60\u201371","journal-title":"Trans Sci"},{"key":"135_CR39","unstructured":"Wilson NHM, Colvin N (1977) Computer control of the Rochester dial-a-ride system. Technical Report R-77-31, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge"},{"key":"135_CR40","unstructured":"Wilson NHM, Sussman JM, Wong HK, Higonnet BT (1971) Scheduling algorithms for dial-a-ride systems. Technical Report TR-70-13, Urban Systems Laboratory, Massachusetts Institute of Technology, Cambridge"},{"key":"135_CR41","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10288-006-0018-0","volume":"5","author":"R Wolfler Calvo","year":"2007","unstructured":"Wolfler Calvo R, Colorni A (2007) An effective and fast heuristic for the dial-a-ride problem. 4OR Q J Oper Res 5: 61\u201373","journal-title":"4OR Q J Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-008-0135-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-008-0135-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-008-0135-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:57Z","timestamp":1559041197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-008-0135-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,2]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["135"],"URL":"https:\/\/doi.org\/10.1007\/s00291-008-0135-6","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,2]]}}}