Solution time reduction techniques of a stochastic dynamic programming approach for hazardous material route selection problem

Authors:
Sumeet Desai;Gino J. Lim
Affiliations:
-;-
Venue:
Computers and Industrial Engineering
Year:
2013

Citing 8
Cited 0

Optimal obnoxious paths on a network: transportation of hazardous materials

Operations Research
Modeling equity of risk in the transportation of hazardous materials

Operations Research
Markov Decision Processes: Discrete Stochastic Dynamic Programming

Markov Decision Processes: Discrete Stochastic Dynamic Programming
Modeling of Transport Risk for Hazardous Materials

Operations Research
A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost

Transportation Science
A comparison of multivariate statistical methods for estimating expected consequences for low-probability and high-consequence incidents

Human Factors in Ergonomics & Manufacturing
State space reduction for nonstationary stochastic shortest path problems with real-time traffic information

IEEE Transactions on Intelligent Transportation Systems
Accurate calculation of hazardous materials transport risks

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We use a stochastic dynamic programming (SDP) approach to solve the problem of determining the optimal routing policies in a stochastic dynamic network. Due to its long time for solving SDP, we propose three techniques for pruning stochastic dynamic networks to expedite the process of obtaining optimal routing policies. The techniques include: (1) use of static upper/lower bounds, (2) pre-processing the stochastic dynamic networks by using the start time and origin location of the vehicle, and (3) a mix of pre-processing and upper/lower bounds. Our experiments show that while finding optimal routing policies in stochastic dynamic networks, the last two of the three strategies have a significant computational advantage over conventional SDP. Our main observation from these experiments was that the computational advantage of the pruning strategies that depend on the start time of the vehicle varies according to the time input to the problem. We present the results of this variation in the experiments section. We recommend that while comparing the computational performances of time-dependent techniques, it is very important to test the performance of such strategies at various time inputs.