AbstractOften, the carrier/shipper of hazardous materials is interested in a collection of routes with approximately the same performance so that they can switch between different routes to avoid exposing the same population and potentially as a security measure. We develop a K shortest path algorithm for which the performance of each highway facility, with respect to each objective, can be stochastic and can vary over time. We also devise a mixed integer program to identify a subset of paths, which represents an acceptable trade-off between geographic diversity and performance. These models are then applied to a realistic case study.
Identifying geographically diverse routes for the transportation of hazardous materials
Transportation Research Part E: Logistics and Transportation Review ; 44 , 3 ; 333-349
2006-10-19
17 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Identifying geographically diverse routes for the transportation of hazardous materials
Online Contents | 2008
|Identifying geographically diverse routes for the transportation of hazardous materials
Online Contents | 2008
|Transportation of Hazardous Materials
NTIS | 1980
Transportation of hazardous materials
TIBKAT | 1986
|