Optimal obnoxious paths on a network: transportation of hazardous materials
Operations Research
The equity constrained shortest path problem
Computers and Operations Research
Modeling equity of risk in the transportation of hazardous materials
Operations Research
A comparison of p-dispersion heuristics
Computers and Operations Research
SIAM Journal on Computing
Catastrophe Avoidance Models for Hazardous Materials Route Planning
Transportation Science
Designing a Road Network for Hazardous Materials Transportation
Transportation Science
A Path-Based Approach for Hazmat Transport Network Design
Management Science
Heuristics for the bi-objective path dissimilarity problem
Computers and Operations Research
Toll Policies for Mitigating Hazardous Materials Transport Risk
Transportation Science
Hi-index | 0.01 |
Recently, the Value-at-Risk (VaR) framework was introduced for the routing problem of a single hazmat trip. In this paper, we extend the VaR framework in two important ways. First, we show how to apply the VaR concept to a more realistic multi-trip multi-hazmat type framework, which determines routes that minimize the global VaR value while satisfying equity constraints. Second, we show how to embed the algorithm for the single hazmat trip problem into a Lagrangian relaxation framework to obtain an efficient solution method for this general case. We test our computational experience based on a real-life hazmat routing scenario in the Albany district of New York State. Our results indicate that one can achieve a high degree of risk dispersion while controlling the VaR value within the desired confidence level.