Finding multiple dissimilar reliable routes in linear time complexity under travel time uncertainties

Access this Article


There are considerable literatures on route travel time reliability and most of which are based on the stochastic characteristics of traffic networks. This paper studies reliable routing under travel time uncertainty with limited information available. Since a-prior shortest path (SP) may incur higher delays in an uncertain network, the route travel time reliability is considered to seek for reliable routes. Due to complexity and data availability, many sophisticated reliable routing algorithms are not suitable for large scale applications. In this paper, an algorithm finding several dissimilar routes ranked by their reliability indices based on a risk-averse hyperpath is proposed. For being searched on the pre-calculated hyperpath, which is a directed acyclic graph (DAG), the path-finding can be completed with a linear complexity.


  • TRB 94th Annual Meeting Compendium of Papers

    TRB 94th Annual Meeting Compendium of Papers (Number 15-4376), 2015-01


  • NII Article ID (NAID)
  • Text Lang
  • Article Type
    conference paper
  • Data Source
Page Top