Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals

Published Online:https://doi.org/10.1287/inte.1080.0379

References

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