OR Spectrum

, Volume 32, Issue 1, pp 77–107 | Cite as

Dynamic transportation of patients in hospitals

  • Alexandre Beaudry
  • Gilbert Laporte
  • Teresa Melo
  • Stefan Nickel
Regular Article

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.

Keywords

In-house hospital transportation Dial-a-ride Dynamic mode Tabu search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldaihani M, Dessouky M (2003) Hybrid scheduling methods for paratransit operations. Comput Ind Eng 45: 75–96CrossRefGoogle Scholar
  2. 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–387CrossRefGoogle Scholar
  3. Banerjea-Brodeur M, Cordeau J-F, Laporte G, Lasry A (1998) Scheduling linen deliveries in a large hospital. J Oper Res Soc 49: 777–780Google Scholar
  4. 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–123CrossRefGoogle Scholar
  5. Beaudry A (2006) Heuristic procedures for a dynamic dial-a-ride problem for patient transportation in hospitals. Master’s Thesis, HEC Montréal, CanadaGoogle Scholar
  6. 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–893CrossRefGoogle Scholar
  7. Bodin LD, Sexton T (1986) The multi-vehicle subscriber dial-a-ride problem. TIMS Stud Manage Sci 22: 73–86Google Scholar
  8. Borndörfer R, Grötschel M, Klostermeister F, Küttner C (1997) Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Germany. Available online at http://www.zib.de/PaperWeb/abstracts/SC-97-23
  9. Cordeau J-F (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54: 573–586CrossRefGoogle Scholar
  10. 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–594CrossRefGoogle Scholar
  11. Cordeau J-F, Laporte G (2007) The dial-a-ride problem: models and algorithms. Ann Oper Res 153: 29–46CrossRefGoogle Scholar
  12. 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–1615CrossRefGoogle Scholar
  13. 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–325Google Scholar
  14. 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–27Google Scholar
  15. 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–557CrossRefGoogle Scholar
  16. Dumas Y, Desrosiers J, Soumis F (1989) Large scale multi-vehicle dial-a-ride problems. Les Cahiers du GERAD G-89-30, École des Hautes Études Commerciales, Montréal, CanadaGoogle Scholar
  17. Fu L (2002) Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Trans Res Part B 36: 485–506CrossRefGoogle Scholar
  18. 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–335CrossRefGoogle Scholar
  19. Gendreau M, Guertin F, Potvin J-Y, Séguin R (2006) Neighbourhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Trans Res Part C 14: 157–174CrossRefGoogle Scholar
  20. Hanne T, Melo T, Nickel S (2008) Bringing robustness to patient flow management through optimized patient transports in hospitals. Interfaces. (in press)Google Scholar
  21. Hvattum LM, Løkketangen A, Laporte G (2006) Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Trans Sci 40: 421–438CrossRefGoogle Scholar
  22. Hvattum LM, Løkketangen A, Laporte G (2007) A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. Networks 49: 330–340CrossRefGoogle Scholar
  23. 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–257CrossRefGoogle Scholar
  24. Jørgensen R, Larsen J, Bergvinsdottir KB (2007) Solving the dial-a-ride problem using genetic algorithms. J Oper Res Soc 58: 1321–1331CrossRefGoogle Scholar
  25. Landry S, Philippe R (2004) How logistics can service healthcare. Supply Chain Forum 5: 24–30Google Scholar
  26. 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–208CrossRefGoogle Scholar
  27. 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–759CrossRefGoogle Scholar
  28. Mitrović-Minić S, Laporte G (2004) Waiting strategies for the dynamic pickup and delivery problem with time windows. Trans Res Part B 38: 635–655CrossRefGoogle Scholar
  29. Nanry WP, Barnes JW (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Trans Res Part B 34: 107–121CrossRefGoogle Scholar
  30. Psaraftis HN (1980) A dynamic programming solution to the single-vehicle, many-to-many immediate request dial-a-ride problem. Trans Sci 14: 130–154CrossRefGoogle Scholar
  31. Psaraftis HN (1983) An exact algorithm for the single-vehicle, many-to-many dial-a-ride problem with time windows. Trans Sci 17: 351–357CrossRefGoogle Scholar
  32. Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Trans Sci 40: 455–472CrossRefGoogle Scholar
  33. Ropke S, Cordeau J-F, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems. Networks 49: 258–272CrossRefGoogle Scholar
  34. Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann of Oper Res 4: 285–305CrossRefGoogle Scholar
  35. Sexton T, Choi Y-M (1986) Pickup and delivery of partial loads with soft time windows. Am J Math Manage Sci 6: 369–398Google Scholar
  36. Taillard ÉD (1993) Parallel iterative search methods for vehicle routing problems. Networks 23: 661–673CrossRefGoogle Scholar
  37. 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–690Google Scholar
  38. Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Trans Sci 31: 60–71CrossRefGoogle Scholar
  39. 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, CambridgeGoogle Scholar
  40. 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, CambridgeGoogle Scholar
  41. Wolfler Calvo R, Colorni A (2007) An effective and fast heuristic for the dial-a-ride problem. 4OR Q J Oper Res 5: 61–73CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • Alexandre Beaudry
    • 1
  • Gilbert Laporte
    • 2
  • Teresa Melo
    • 3
  • Stefan Nickel
    • 4
  1. 1.Jeppesen (Canada) Ltd.MontrealCanada
  2. 2.Canada Research Chair in Distribution ManagementHEC MontréalMontrealCanada
  3. 3.Fraunhofer Institute for Industrial Mathematics and Department of Business AdministrationUniversity of Applied SciencesSaarbrückenGermany
  4. 4.Chair of Operations Research and Logistics and Fraunhofer Institute for Industrial MathematicsSaarland UniversitySaarbrückenGermany

Personalised recommendations