TY - JOUR
T1 - Routing hazardous materials on time-dependent networks using conditional value-at-risk
AU - Toumazis, Iakovos
AU - Kwon, Changhyun
N1 - Funding Information:
This manuscript is based upon work supported by the U.S. Department of Transportation (US DOT), Research and Innovative Technology Administration through the University Transportation Research Center (UTRC) under Grant No. 49111-07-23. The authors are grateful for the support. Any opinions, findings, and conclusions or recommendations expressed in this manuscript are those of the authors and do not necessarily reflect the views of the US DOT or the UTRC. The authors are also thankful to the two anonymous reviewers for their valuable comments that helped to considerably improve the quality of the paper.
PY - 2013/12
Y1 - 2013/12
N2 - We propose a new method for mitigating risk in routing hazardous materials (hazmat), based on the conditional value-at-risk (CVaR) measure on time-dependent vehicular networks. The CVaR models are shown to be flexible and suitable for hazmat transportation that can be solved efficiently. This paper extends the previous research by considering CVaR for hazmat transportation in the case where accident probabilities and accident consequences are time-dependent. We provide a numerical method to determine an optimal departure time and an optimal route for a given origin-destination pair. The proposed algorithm is tested in a realistic road network in Buffalo, NY, USA and the results are discussed.
AB - We propose a new method for mitigating risk in routing hazardous materials (hazmat), based on the conditional value-at-risk (CVaR) measure on time-dependent vehicular networks. The CVaR models are shown to be flexible and suitable for hazmat transportation that can be solved efficiently. This paper extends the previous research by considering CVaR for hazmat transportation in the case where accident probabilities and accident consequences are time-dependent. We provide a numerical method to determine an optimal departure time and an optimal route for a given origin-destination pair. The proposed algorithm is tested in a realistic road network in Buffalo, NY, USA and the results are discussed.
KW - Conditional value-at-risk
KW - Dynamic shortest path
KW - Hazardous materials transportation
KW - Time-dependent network
UR - http://www.scopus.com/inward/record.url?scp=84886775344&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84886775344&partnerID=8YFLogxK
U2 - 10.1016/j.trc.2013.09.006
DO - 10.1016/j.trc.2013.09.006
M3 - Article
AN - SCOPUS:84886775344
SN - 0968-090X
VL - 37
SP - 73
EP - 92
JO - Transportation Research Part C: Emerging Technologies
JF - Transportation Research Part C: Emerging Technologies
ER -