Summary
This chapter discusses several transportation problems arising in the field of health care logistics, emergency preparedness and disaster relief. The underlying basic problems are vehicle routing, dial-a-ride, warehouse location routing, covering tour and inventory routing problems. However several additional constraints and real world characteristics enrich the basic problems. The problems are introduced and discussed in the context of their applications with a focus on the Austrian situation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Ambrosino and M. G. Scutella. ‘‘Distribution network design: new problems and related models’’.European Journal of Operational Research 165, pp. 610–624, 2005.
A. Attanasio, J.-F. Cordeau, G. Ghiani, and G. Laporte.‘‘Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem’’.Parallel Computing 30,pp. 377–387, 2004.
A. Beaudry, G. Laporte, T. Melo, and S. Nickel. ‘‘Dynamic transportation of patients in hospitals’’.Berichte des Fraunhofer ITWM, Nr. 104, 2006.
L. Brotcorne, G. Laporte, and F. Semet. ‘‘Ambulance location and relocation models’’,European Journal of Operational Research 147, pp. 451–463, 2003.
K.-M. Bryson, H. Millar, A. Joseph, and A. Mobolurin.‘‘Using formal MS/OR modeling to support disaster recovery planning’’.European Journal of Operational Research 141,pp. 679–688, 2002.
A. Campbell, L. W. Clarke, and M. W. P. Savelsbergh. Inventory Routing in Practice. In ‘‘The Vehicle Routing Problem,’’ Toth, P., and Vigo, D. (eds.),SIAM Monographs on Discrete Mathematics and Applications,pp. 309–330, 2002.
A. Campbell, D. Vandenbussche, and W. Hermann. ‘‘Routing for Relief Efforts’’.submitted toTransportation Science, 2006.
R. L. Church and C. ReVelle.‘‘The maximal covering location problem’’,Papers of the Regional Science Association 32,pp. 101-118, 1974.
J.-F. Cordeau and G. Laporte. ‘‘A tabu search heuristic for the static multi-vehicle dial-a-ride problem’’.Transportation Research B 37, pp. 579–594, 2003.
J.-F. Cordeau and G. Laporte. ‘‘The Dial-a-Ride Problem (DARP): Variants modelling issues and algorithms’’.4OR 1,pp. 89–101, 2003.
M. Daskin.‘‘A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution’’,Transportation Science 17(1),pp. 48–70, 1983.
K. F. Doerner, M. Gronalt, R. F. Hartl, M. Reimann, and K. Zisser.VRP with interdependent Time Windows - A Case study for the Austrian Red Cross blood programme,in: Leopold-Wildburger, U., Rendl F. and Wäscher, G. (Eds.):Operations Research Proceedings 2002, Springer,pp. 156–161, 2003.
K. F. Doerner, W. J. Gutjahr, R. F. Hartl, M. Karall, and M. Reimann.’’Heuristic Solution of an Extended Double-Coverage Ambulance Location Problem for Austria’’.Central European Journal on Operations Research,pp. 325–340, 2006.
K. F. Doerner, M. Gronalt, R. F. Hartl, G. Kiechle, and M. Reimann.‘‘Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows’’.to appear:Computers & Operations Research, 2007.
M. Dorigo and T. Stützle,Ant Colony Optimization. MIT Press, Cambridge, 2004.
M. Gendreau, G. Laporte, and F. Semet. ‘‘The Covering Tour Problem",Operations Research 45 (4),pp. 568–576, 1997.
M. Gendreau, G. Laporte, and F. Semet. ‘‘Solving an ambulancelocation model by tabu search’’,Location Science 5(2),pp. 75–85, 1997.
M. Gendreau, G. Laporte, and F. Semet. ‘‘A dynamic model and parallel tabu search heuristic for real-time ambulance relocation’’,Parallel Computing 27, pp. 1641–1653, 2001.
M. Gendreau, F. Guertin, J.-Y. Potvin, and R. Séguin.‘‘Neighborhood Search heuristic for a Dynamic Vehicle Dispatching Problem with Pick-ups and Deliveries’’.Transportation Research C,14 (3), pp. 157–174, 2006.
M. Hachicha, M. J. Hodgson, G. Laporte, and F. Semet.‘‘Heuristics for the multi-vehicle covering tour problem’’,Computers and Operations Research 27,pp. 29–42, 2000.
V. Hemmelmayr, K. F. Doerner, R. F. Hartl, and M. W. P. Savelsbergh.Delivery Strategies for Periodic Blood Supplies. submitted, 2007.
M. J. Hodgson, G. Laporte, and F. Semet. ‘‘A covering tour model for planning mobile health care facilities in Suhum district, Ghana",Journal of Regional Science 38 (4),pp. 621–639, 1998.
J. Goldberg and L. Paz.‘‘Locating Emergency Vehicle Bases When Service Time Depends on Call Location’’Transportation Science,25 (4), pp. 264–280, 1991.
N. Jozefowiez, F. Semet, and E.-G. Talbi. ‘‘The bi-objective covering tour problem’’,Computers and Operations Research,34,pp. 1929–1942, 2007.
G. Kiechle, K. F. Doerner, M. Gendreau, and R. F. Hartl.‘‘Patient Transportation - Dynamic Dial-a-Ride and Emergency Transportation Problems’’. Preprints of TRISTAN 2007, 2007.
G. Laporte,Location Routing Problems, in: Golden, B. and Assad, A. (eds.), Vehicle Routing: Methods and Studies,pp. 163–197, North-Holland, 1988.
V. Marianov and C. ReVelle.‘‘The queueing maximal availability location problem: a model for the siting of emergency vehicles",European Journal of Operational Research 93, pp. 110–120, 1996.
S. Mitrović-Minić and G. Laporte.‘‘Waiting Strategies for the Dynamic Pickup and Delivery Problem with Time Windows’’.Transportation Research B 38,pp. 635–655, 2004.
S. Mitrović-Minić, R. Krishnamurti, and G. Laporte.‘‘Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows’’.Transportation Research B 38,pp. 669-685, 2004.
N. Mladenović, and P. Hansen.Variable Neighborhood Search.Computers & Operations Research/ 24, pp. 1097–1100, 1997.
S. N. Parragh, K. F. Doerner, X. Gandibleux, and R. F. Hartl.‘‘Approaching the Pareto Frontier of the Multi-objective Dial-a-Ride Problem’’Paper presented at the Route 2007 Workshop, Jekyll Island, Route 2007, Mai, 13-16, 2007.
S. N. Parragh, K. F. Doerner, and R. F. Hartl. A survey on pickup and delivery problems. Part I: Transportation between customers and depot,to appear: Journal für Betriebswirtschaft, 2007.
S. N. Parragh, K. F. Doerner, and R. F. Hartl. A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations,to appear: Journal für Betriebswirtschaft, 2007.
J. Perl and M. S. Daskin.A unified warehouse location-routing methodology,Journal of Business Logistics,5, pp. 92–111, 1984.
M. W. P. Savelsbergh and M. Sol. ‘‘DRIVE : Dynamic Routing of Independent Vehicles’’.Operations Research 46 (4),pp. 474–490, 1998.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Doerner, K.F., Hartl, R.F. (2008). Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77778-8_24
Download citation
DOI: https://doi.org/10.1007/978-0-387-77778-8_24
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-77777-1
Online ISBN: 978-0-387-77778-8
eBook Packages: Business and EconomicsBusiness and Management (R0)