Abstract
Previous work on the risk-averse routing of hazardous materials has focussed on ways of finding the safest route between a pair of points. For repeated shipments where the arc incident probabilities are unknown, it is shown that the safest strategy is in general to use a mix of routes. Starting with a simple two-route example, it is shown that exposure can be significantly reduced by sharing shipments between routes. In order to determine the safest set of routes and the safest share of traffic between these routes, a minmax problem is formulated. The properties of the optimality conditions are explored. A simple solution heuristic based on a shortest path algorithm and the method of successive averages is proposed. Connections to game theory provide useful insights into the nature of the solution.
Similar content being viewed by others
References
Abkowitz M, Lepofsky M, Cheng P (1992) Selecting criteria for designating hazardous materials highway routes. Transp Res Rec 1333:30–35
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs, New Jersey
ALK Associates (1994) ALK's PC*HazRoute (Version 2.0). ALK Associates, Princeton, New Jersey
Bell MGH, Iida Y (1997) Transportation network analysis. Wiley & Sons, Chichester
Bell MGH, Cassir C (2002) Risk-averse user equilibrium traffic assignment: an application of game theory. Transp Res Part B: Methodol 36:671–681
Erkut E (1995) On the credibility of the conditional risk model for routing hazardous materials. Oper Res Lett 18:49–52
Erkut E, Ingolfsson A (2000) Catastrophe avoidance models for hazardous materials route planning. Transp Sci 34:165–179
Erkut E, Verter V (1998) Modelling of transport risk for hazardous materials. Opns Res 46:625–642
Glickman TS (1983) Rerouting railroad shipments of hazardous materials to avoid populated areas. Accident Anal Prev 15:329–335
Jin H, Batta R, Karwan MH (1996) On the analysis of two new models for transporting hazardous materials. Oper Res 44(5):710–723
List G, Mirchandi P, Turnquist M, Zofrafos K (1991) A modelling and analysis for hazardous materials transportation: risk analysis, routing-scheduling and facility location. Transp Sci 25(2):100–114
Nozick KL, List GF, Turnquist M (1997) Integrated routing and scheduling in hazardous materials transportation. Transp Sci 31(3):200–215
Punnen AP (1991) A linear time algorithm for the maximum capacity route problem. Eur J Oper Res 53:402–404
Sherali HD, Brizendine LD, Glickman TS, Subramanian S (1997) Low-probability high-consequence considerations in routing hazardous material shipments. Transp Sci 31(3):237–251
Sivakumar RA, Batta R, Karwan MH (1993) A network-based model for transporting extremely hazardous materials. Oper Res Lett 13:85–93
Sivakumar RA, Batta R, Karwan MH (1995) A multiple route conditional risk model for transporting hazardous materials. INFO 33:20–33
US Department of Transportation (1994) Guidelines for applying criteria to designate routes for transporting hazardous materials. Report No. FHWA-SA-94-083, Federal Highway Administration, Washington District of Columbia
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bell, M.G.H. Mixed Route Strategies for the Risk-Averse Shipment of Hazardous Materials. Netw Spat Econ 6, 253–265 (2006). https://doi.org/10.1007/s11067-006-9283-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11067-006-9283-x