Identifying geographically diverse routes for the transportation of hazardous materials
Often, 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.
Year of publication: |
2008
|
---|---|
Authors: | Dadkar, Yashoda ; Jones, Dean ; Nozick, Linda |
Published in: |
Transportation Research Part E: Logistics and Transportation Review. - Elsevier, ISSN 1366-5545. - Vol. 44.2008, 3, p. 333-349
|
Publisher: |
Elsevier |
Keywords: | Hazardous materials Stochastic dynamic network Routing K shortest path problem Genetic algorithm |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Identifying geographically diverse routes for the transportation of hazardous materials
Dadkar, Yashoda, (2008)
-
Identifying geographically diverse routes for the transportation of hazardous materials
Dadkar, Yashoda, (2008)
-
Optimizing facility use restrictions for the movement of hazardous materials
Dadkar, Yashoda, (2010)
- More ...