Identifying geographically diverse routes for the transportation of hazardous materials

详细信息    查看全文

• 作者：Yashoda Dadkar ; Dean Jones ; Linda Nozick
• 关键词：Hazardous materials ; Stochastic dynamic network ; Routing ; K shortest path problem ; Genetic algorithm
• 刊名：Transportation Research Part E: Logistics and Transportation Review
• 出版年：2008
• 出版时间：May 2008
• 年：2008
• 卷：44
• 期：3
• 页码：333-349
• 全文大小：1149 K

文摘

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.