Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Dynamic transportation of patients in hospitals

Dynamic transportation of patients in hospitals This study analyzes and solves a patient transportation problem arising in large hospitals. The aim is to provide an efficient and timely transport service to patients between several locations in a hospital campus. Transportation requests arrive in a dynamic fashion and the solution methodology must therefore be capable of quickly inserting new requests in the current vehicle routes. Contrary to standard dial-a-ride problems, the problem under study includes several complicating constraints which are specific to a hospital context. The study provides a detailed description of the problem and proposes a two-phase heuristic procedure capable of handling its many features. In the first phase a simple insertion scheme is used to generate a feasible solution, which is improved in the second phase with a tabu search algorithm. The heuristic procedure was extensively tested on real data provided by a German hospital. Results show that the algorithm is capable of handling the dynamic aspect of the problem and of providing high-quality solutions. In particular, it succeeded in reducing waiting times for patients while using fewer vehicles. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png OR Spectrum Springer Journals

Dynamic transportation of patients in hospitals

Loading next page...
 
/lp/springer-journals/dynamic-transportation-of-patients-in-hospitals-7QDbz3o3d3

References (61)

Publisher
Springer Journals
Copyright
Copyright © 2008 by Springer-Verlag
Subject
Business and Management; Operation Research/Decision Theory; Calculus of Variations and Optimal Control; Optimization; Business and Management, general
ISSN
0171-6468
eISSN
1436-6304
DOI
10.1007/s00291-008-0135-6
Publisher site
See Article on Publisher Site

Abstract

This study analyzes and solves a patient transportation problem arising in large hospitals. The aim is to provide an efficient and timely transport service to patients between several locations in a hospital campus. Transportation requests arrive in a dynamic fashion and the solution methodology must therefore be capable of quickly inserting new requests in the current vehicle routes. Contrary to standard dial-a-ride problems, the problem under study includes several complicating constraints which are specific to a hospital context. The study provides a detailed description of the problem and proposes a two-phase heuristic procedure capable of handling its many features. In the first phase a simple insertion scheme is used to generate a feasible solution, which is improved in the second phase with a tabu search algorithm. The heuristic procedure was extensively tested on real data provided by a German hospital. Results show that the algorithm is capable of handling the dynamic aspect of the problem and of providing high-quality solutions. In particular, it succeeded in reducing waiting times for patients while using fewer vehicles.

Journal

OR SpectrumSpringer Journals

Published: Apr 2, 2008

There are no references for this article.