Bringing robustness to patient flow management through optimized patient transports in hospitals

Interfaces

Volumn 39, Issue 3, 2009, Pages 241-255

  Hanne, Thomas ^a   Melo, Teresa ^b   Nickel, Stefan ^c,d  

^a UNIVERSITY OF APPLIED SCIENCES AND ARTS NORTHWESTERN SWITZERLAND   (Switzerland)

^b Saarland University of Applied Sciences   (Germany)

^c FRAUNHOFER INSTITUTE FOR INDUSTRIAL MATHEMATICS ITWM   (Germany)

^d SAARLAND UNIVERSITY   (Germany)

Author keywords

Algorithms; Health care; Heuristic; Integer; Programming; Scheduling vehicles; Transportation; Vehicle routing

Indexed keywords

EID: 67651096013     PISSN: 00922102     EISSN: 1526551X     Source Type: Journal    
DOI: 10.1287/inte.1080.0379     Document Type: Article

References (22)

1. Aldaihani, M., M. Dessouky. 2003. Hybrid scheduling methods for paratransit operations. Comput. Indust. Engrg. 45 75-96.
2. Attanasio, A., J.-F. Cordeau, G. Ghiani, G. Laporte. 2004. Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30 377-387.
3. Baugh, J., G. Krishna, R. Kakivaya, J. Stone. 1998. Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Engrg. Optim. 30 91-123.
4. Beaudry, A., G. Laporte, T. Melo, S. Nickel. 2006. Dynamic transportation of patients in hospitals. Technical Report CRT-2006-29, Centre de Recherche sur les Transports, Université de Montréal, Montréal.
5. Colorni, A., G. Righini. 2001. Modeling and optimizing dynamic dial-a-ride problems. Internat. Trans. Oper. Res. 8 155-166.
6. Cordeau, J.-F. 2006. A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54 573-586.
7. Cordeau, J.-F., G. Laporte. 2003. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Res. Part B 37 579-594.
8. Cordeau, J.-F., G. Laporte. 2007. The dial-a-ride problem: Models and algorithms. Ann. Oper. Res. 153 29-46.
9. Cordeau, J.-F., G. Laporte, J.-Y. Potvin, M. W. P. Savelsbergh. 2006. Transportation on demand. C. Barnhart, G. Laporte, eds. Transportation, Handbooks in Operations Research and Management Science. North-Holland, Amsterdam, 429-466.
10. Coslovich, L., R. Pesenti, W. Ukovich. 2006. A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. Eur. J. Oper. Res. 175 1605-1615.
11. Every, N. R., J. Hochman, R. Becker, S. Kopecky, C. P. Cannon. 2000. Critical pathways: A review. Circulation 101 461-465.
12. Hall, R., D. Belson, P. Murali, M. Dessouky. 2006. Modeling patient flows through the healthcare system. R. W. Hall, ed. Patient Flow: Reducing Delay in Healthcare Delivery, International Series in Operations Research and Management Science. Springer, New York, 1-44.
13. Jacobson, S. H., S. N. Hall, J. R. Swisher. 2006. Discrete-event simulation of health care systems. R. W. Hall, ed. Patient Flow: Reducing Delay in Healthcare Delivery, International Series in Operations Research and Management Science. Springer, New York, 211-252.
14. Jørgensen, R., J. Larsen, K. B. Bergvinsdottir. 2007. Solving the diala-ride problem using genetic algorithms. J. Oper. Res. Soc. 58 1321-1331.
15. Kallrath, J. 2005. Online Storage Systems and Transportation Problems with Applications: Optimization Models and Mathematical Solutions, Applied Optimization. Springer, New York, 57-120.
16. Landry, S., R. Philippe. 2004. How logistics can service healthcare. Supply Chain Forum 5 24-30.
17. Madsen, O. B. G., H. F. Ravn, J. M. Rygaard. 1995. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann. Oper. Res. 60 193-208.
18. Melachrinoudis, E., A. Ilhan, H. Min. 2007. A dial-a-ride problem for client transportation in a health-care organization. Comput. Oper. Res. 34 742-759.
19. Paquette, J., J.-F. Cordeau, G. Laporte. 2007. Quality of service in dial-a-ride operations. Retrieved May 7, 2008, http://neumann. hec.ca/chairedistributique/common/Quality.pdf.
20. Teodorovic, D., G. Radivojevic. 2000. A fuzzy logic approach to dynamic dial-a-ride problem. Fuzzy Sets Systems 116 23-33.
21. Tinnapel, F. 2007. Patienten ohne Warteliste (Patients without waiting list). Frankfurter Rundschau (November) F5.
22. Toth, P., D. Vigo. 1997. Heuristic algorithms for the handicapped persons transportation problem. Transportation Sci. 31 60-71.