Mixed Route Strategies for the Risk-Averse Shipment of Hazardous Materials
AbstractPrevious 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
Download InfoIf 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.
Bibliographic InfoArticle provided by Springer in its journal Networks and Spatial Economics.
Volume (Year): 6 (2006)
Issue (Month): 3 (September)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=106607
Network reliability; Hazmats; Uncertainty;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- N. Norouzi & R. Tavakkoli-Moghaddam & M. Ghazanfari & M. Alinaghian & A. Salamatbakhsh, 2012. "A New Multi-objective Competitive Open Vehicle Routing Problem Solved by Particle Swarm Optimization," Networks and Spatial Economics, Springer, vol. 12(4), pages 609-633, December.
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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.