Low Probability - High Consequence Considerations in Routing Hazardous Material Shipments

This paper is concerned with the development and analysis of a mathematical model for determining a route that attempts to reduce the risk of low probability---high consequence accidents related with the transportation of hazardous materials. The approach adopted considers trade-offs between the conditional expectation of a catastrophic outcome given that an accident has occurred, and more traditional measures of risk dealing with the expected value of the consequence and the accident probability on a selected path. More specifically, the problem we address involves finding a path that minimizes the conditional expectation objective value, subject to the expected value of the consequence being lesser than or equal to a specified value v , and the probability of an accident on the path being also constrained to be no more than some value (eta). The values v and (eta) are user-prescribed and could be prompted by the solution to the shortest path problems that minimize the respective corresponding linear risk functions. The proposed model is a discrete, fractional programming problem that is solved using a specialized branch-and-bound approach. A numerical example is provided for the sake of illustration, and some computational experience on randomly generated test cases is provided to study the effort required to solve this problem in different instances. The model is also tested using realistic data associated with a case concerned with routing hazardous materials through the roadways of Bethlehem, Pennsylvania. Data acquisition as well as algorithmic computational issues are discussed.

[1]  Theodore S. Glickman REROUTING RAILROAD SHIPMENTS OF HAZARDOUS MATERIALS TO AVOID POPULATED AREAS , 1983 .

[2]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[3]  F F Saccomanno,et al.  FATALITY RISK CURVES FOR TRANSPORTING CHLORINE AND LIQUEFIED PETROLEUM GAS BY TRUCK AND RAIL (WITH DISCUSSION AND CLOSURE) , 1990 .

[4]  Mark A. Turnquist,et al.  Modeling and Analysis for Hazardous Materials Transportation: Risk Analysis, Routing/Scheduling and Facility Location , 1991, Transp. Sci..

[5]  Erhan Erkut On the credibility of the conditional risk model for routing hazardous materials , 1995, Oper. Res. Lett..

[6]  R. Sivanandan,et al.  A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes , 1994 .

[7]  Yacov Y. Haimes,et al.  Risk‐based analysis of extreme events , 1988 .

[8]  Douglas R. Shier,et al.  On algorithms for finding the k shortest paths in a network , 1979, Networks.

[9]  Abraham Charnes,et al.  Programming with linear fractional functionals , 1962 .

[10]  Bruce L. Golden,et al.  Solvingk-shortest and constrained shortest path problems efficiently , 1989 .

[11]  Mark H. Karwan,et al.  On the Analysis of Two New Models for Transporting Hazardous Materials , 1996, Oper. Res..

[12]  Laora Dauberman Brizendine Low probability-high consequence considerations in a multiobjective approach to risk management , 1994 .

[13]  Rajan Batta,et al.  A network-based model for transporting extremely hazardous materials , 1993, Oper. Res. Lett..

[14]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[15]  Hanif D. Sherali,et al.  Linear programming and network flows (2nd ed.) , 1990 .

[16]  Yacov Y. Haimes,et al.  Probability distributions and their partitioning , 1988 .

[17]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[18]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[19]  M Abkowitz,et al.  Developing a risk/cost framework for routing truck movements of hazardous materials. , 1988, Accident; analysis and prevention.

[20]  Rajan Batta,et al.  A Multiple Route Conditional Risk Model For Transporting Hazardous Materials , 1995 .

[21]  J. Y. Yen Finding the K Shortest Loopless Paths in a Network , 1971 .