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

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, the authors 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. The authors first discuss the theoretical foundations concerning the existence of the optimal solutions and analyze the efficient convergence speed of their proposed algorithm. Lastly, they conduct numerical studies to demonstrate efficiency and effectiveness of the proposed algorithm.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01760808
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Nov 25 2020 3:05PM