Summary
Many emergency service providers, especially ambulance departments and companies who provide non-public maintenance services, face the problem that their eet of vehicles has to provide two different types of services: 1. Cover a certain region and provide immediate service when an emergency occurs; 2. Provide some regular service (e.g., the pick-up and delivery of patients, predetermined service tasks, periodic pick-ups . . . ). This is the current situation for the largest Austrian emergency service providers (e.g., the Austrian Red Cross), where the same eet is used to provide both types of services. Dynamic aspects thus directly inuence the schedule for the regular service. When an emergency occurs and an ambulance is required, the vehicle with the shortest distance to the emergency is assigned to serve the emergency patient. Therefore, it may happen that an ambulance vehicle that has to carry out a scheduled transport order of a patient, which has not started yet, is used to serve the emergency request and the schedule for the regular services has to be re-optimized and another vehicle has to be reassigned to the regular patient. Ambulances that carry out emergency transport become available at the hospital after the emergency service and can be then used to carry out regular transport orders. Again, the schedule for regular services has to be re-optimized.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Attanasio, A., Cordeau, J.-F., Ghiani, G., and Laporte, G. (2004) Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing 30:377–387.
Cordeau, J.-F., and Laporte, G. (2003) “The Dial-a-Ride Problem (DARP): Variants modelling issues and algorithms”. 4OR 1, pp. 89–101.
Gendreau, M., Guertin, F., Potvin, J.-Y., and Séguin, R. (2002): “Neighborhood Search heuristic for a Dynamic Vehicle Dispatching Problem with Pickups and Deliveries”. Technical Report, Centre de recherche sur les transports, Université de Montréal. Forthcoming in Transportation Research C.
Gendreau, M., Laporte, G., and Semet, F. (2001): “A dynamic model and parallel tabu search heuristic for real-time ambulance relocation”. Parallel Computing 27, 1641–1653.
Jaw J.-J., Odoni, A., Psaraftis, H., Wilson, N. (1986): “A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows”. Transportation Research B 20 (3), pp. 243–257.
Mitrović-Minić, S., and Laporte, G. (2004): “Waiting Strategies for the Dynamic Pickup and Delivery Problem with Time Windows”. Transportation Research B 38, pp. 635–655.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiechle, G., Doerner, K.F., Gendreau, M., Hartl, R.F. (2009). Waiting Strategies for Regular and Emergency Patient Transportation. In: Fleischmann, B., Borgwardt, KH., Klein, R., Tuma, A. (eds) Operations Research Proceedings 2008., vol 2008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00142-0_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-00142-0_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00141-3
Online ISBN: 978-3-642-00142-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)