当前位置: X-MOL 学术Transp. Res. Part E Logist. Transp. Rev. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty
Transportation Research Part E: Logistics and Transportation Review ( IF 10.6 ) Pub Date : 2020-11-22 , DOI: 10.1016/j.tre.2020.102159
Liang Shen , Hu Shao , Ting Wu , Emily Zhu Fainman , William H.K. Lam

This article proposes an innovative path finding algorithm to achieve on-time arrival reliability on road networks under uncertainty with stochastic delays at signalized intersections. Typically, we extend conventional path-finding algorithms to signalized traffic networks of 1) random and correlated running travel time along links (RTTL), 2) delays at intersections and traffic signals (DITS) and their correlations, as well as 3) correlations between RTTL and DITS. We first discuss the theoretical foundations concerning the existence of the optimal solutions and analyze the efficient convergence speed of our proposed algorithm. Lastly, we conduct numerical studies to demonstrate efficiency and effectiveness of the proposed algorithm.



中文翻译:

在不确定情况下找到信号交通网络中具有相关链路旅行时间的可靠最短路径

本文提出了一种创新的路径查找算法,可在不确定性和信号交叉口随机延迟的情况下,实现道路网络的准时到达可靠性。通常,我们将常规的路径查找算法扩展到以下信号化交通网络:1)沿链路的随机相关行驶时间(RTTL),2)交叉路口和交通信号的延迟(DITS)及其相关性,以及3)之间的相关性RTTL和DITS。我们首先讨论有关最优解存在性的理论基础,并分析所提出算法的有效收敛速度。最后,我们进行了数值研究,以证明所提出算法的效率和有效性。

更新日期:2020-11-22
down
wechat
bug