TY - GEN
T1 - Reliable Least-Time Path Estimation and Computation in Stochastic Time-Varying Networks with Spatio-Temporal Dependencies
AU - Filipovska, Monika
AU - Mahmassani, Hani S.
N1 - Funding Information:
This paper is based on work funded by the Northwestern University Transportation Center, motivated by research conducted as part of a project funded by the Federal Highway Administration, US Department of Transportation, in collaboration with Leidos, Inc. The authors are grateful to Doug Laird of FHWA and David Hale at Leidos for their role on the related project. The authors remain fully responsible for all content of the paper, which may not necessarily reflect the views of the sponsoring agencies.
Publisher Copyright:
© 2020 IEEE.
PY - 2020/9/20
Y1 - 2020/9/20
N2 - This paper studies the problem of estimation and computation of reliable least-time paths in stochastic time-varying (STV) networks with spatio-temporal dependencies. For a given desired confidence level a, the least-time paths from any origin to a given destination node are to be found over a desired planning horizon. In STV networks, least-time path finding approaches aim to incorporate an element of reliability to help travelers better plan their trips to prepare for the risk of arriving later or traveling for longer than desired. A label-correcting algorithm that incorporates time-dependence of the travel time distributions is proposed. The algorithm incorporates a Monte Carlo sampling approach for a path travel time estimation with time-dependence, which can also be used as an approximate solution method with spatial link travel-time correlations. Numerical results on the large-scale Chicago network are provided to test for the performance of the algorithms and the robustness of solutions. The trade-off between accuracy and efficiency of the approximate solution method compared to a Monte Carlo simulation-based approach is discussed and evaluated.
AB - This paper studies the problem of estimation and computation of reliable least-time paths in stochastic time-varying (STV) networks with spatio-temporal dependencies. For a given desired confidence level a, the least-time paths from any origin to a given destination node are to be found over a desired planning horizon. In STV networks, least-time path finding approaches aim to incorporate an element of reliability to help travelers better plan their trips to prepare for the risk of arriving later or traveling for longer than desired. A label-correcting algorithm that incorporates time-dependence of the travel time distributions is proposed. The algorithm incorporates a Monte Carlo sampling approach for a path travel time estimation with time-dependence, which can also be used as an approximate solution method with spatial link travel-time correlations. Numerical results on the large-scale Chicago network are provided to test for the performance of the algorithms and the robustness of solutions. The trade-off between accuracy and efficiency of the approximate solution method compared to a Monte Carlo simulation-based approach is discussed and evaluated.
UR - http://www.scopus.com/inward/record.url?scp=85099664848&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85099664848&partnerID=8YFLogxK
U2 - 10.1109/ITSC45102.2020.9294650
DO - 10.1109/ITSC45102.2020.9294650
M3 - Conference contribution
AN - SCOPUS:85099664848
T3 - 2020 IEEE 23rd International Conference on Intelligent Transportation Systems, ITSC 2020
BT - 2020 IEEE 23rd International Conference on Intelligent Transportation Systems, ITSC 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 23rd IEEE International Conference on Intelligent Transportation Systems, ITSC 2020
Y2 - 20 September 2020 through 23 September 2020
ER -