Skip to main content
Article thumbnail
Location of Repository

Identifying geographically diverse routes for the transportation of hazardous materials

By Yashoda Dadkar, Dean Jones and Linda Nozick

Abstract

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.Hazardous materials Stochastic dynamic network Routing K shortest path problem Genetic algorithm

OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.sciencedirect.com/s... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.