Mixed Route Strategies for the Risk-Averse Shipment of Hazardous Materials
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. Copyright Springer Science + Business Media, LLC 2006
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:6:y:2006:i:3:p:253-265. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.