Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty

Liang Shen; Hu Shao; Ting Wu; Emily Zhu Fainman; William H.K. Lam

doi:10.1016/j.tre.2020.102159

Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty

Liang Shen, Hu Shao, Ting Wu, Emily Zhu Fainman, William H.K. Lam

Research output: Journal article publication › Journal article › Academic research › peer-review

20 Citations (Scopus)

Abstract

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.

Original language	English
Article number	102159
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	144
DOIs	https://doi.org/10.1016/j.tre.2020.102159
Publication status	Published - Dec 2020

Keywords

Delay at intersections
Reliability
Reliable path-finding algorithm
Transportation
Travel time correlations

ASJC Scopus subject areas

Business and International Management
Civil and Structural Engineering
Transportation

More information

10.1016/j.tre.2020.102159

http://hdl.handle.net/10397/101044

Cite this

@article{6af8bc83ceba4d46b6c92f11d82afc9d,

title = "Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty",

abstract = "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.",

keywords = "Delay at intersections, Reliability, Reliable path-finding algorithm, Transportation, Travel time correlations",

author = "Liang Shen and Hu Shao and Ting Wu and Fainman, {Emily Zhu} and Lam, {William H.K.}",

note = "Funding Information: The work described in this paper was jointly supported by grants from National Natural Science Foundation of China (Project Nos. 72071202 , 71671184 , 71971108 and 71571096 ), Research Initiation Foundation of Xuzhou Medical University (Project No. D2019046), Top Six Talents' Project of Jiangsu Province (Project No. XNYQC-001), the Fundamental Research Funds for the Central Universities (Project No. 14380040), the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. PolyU R5029-18), and the Research Committee of the Hong Kong Polytechnic University (Project No. 4-ZZFY). Publisher Copyright: {\textcopyright} 2020 Elsevier Ltd Copyright: Copyright 2020 Elsevier B.V., All rights reserved.",

year = "2020",

month = dec,

doi = "10.1016/j.tre.2020.102159",

language = "English",

volume = "144",

journal = "Transportation Research Part E: Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Elsevier Ltd",

}

TY - JOUR

T1 - Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty

AU - Shen, Liang

AU - Shao, Hu

AU - Wu, Ting

AU - Fainman, Emily Zhu

AU - Lam, William H.K.

N1 - Funding Information: The work described in this paper was jointly supported by grants from National Natural Science Foundation of China (Project Nos. 72071202 , 71671184 , 71971108 and 71571096 ), Research Initiation Foundation of Xuzhou Medical University (Project No. D2019046), Top Six Talents' Project of Jiangsu Province (Project No. XNYQC-001), the Fundamental Research Funds for the Central Universities (Project No. 14380040), the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. PolyU R5029-18), and the Research Committee of the Hong Kong Polytechnic University (Project No. 4-ZZFY). Publisher Copyright: © 2020 Elsevier Ltd Copyright: Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2020/12

Y1 - 2020/12

N2 - 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.

AB - 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.

KW - Delay at intersections

KW - Reliability

KW - Reliable path-finding algorithm

KW - Transportation

KW - Travel time correlations

UR - http://www.scopus.com/inward/record.url?scp=85097100951&partnerID=8YFLogxK

U2 - 10.1016/j.tre.2020.102159

DO - 10.1016/j.tre.2020.102159

M3 - Journal article

AN - SCOPUS:85097100951

SN - 1366-5545

VL - 144

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

M1 - 102159

ER -

Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this