Summary Travel times are generally stochastic and spatially correlated in congested road networks. However, very few existing route guidance systems (RGS) can provide reliable guidance services to aid travellers planning their trips with taking account explicitly travel time reliability constraint. This study aims to develop such a RGS with particular consideration of travellers' concern on travel time reliability in congested road networks with uncertainty. In this study, the spatially dependent reliable shortest path problem (SD-RSPP) is formulated as a multi-criteria shortest path-finding problem in road networks with correlated link travel times. Three effective dominance conditions are established for links with different levels of travel time correlations. An efficient algorithm is proposed to solve SD-RSPP by adaptively using three established dominance conditions. The complexities of road networks in reality are also explicitly considered. To demonstrate the applicability of proposed algorithm, a comprehensive case study is carried out in Hong Kong. The results of case study show that the proposed solution algorithm is robust to take account of travellers' multiple routing criteria. Computational results demonstrate that the proposed solution algorithm can determine the reliable shortest path on real-time basis for large-scale road networks. Copyright © 2016 John Wiley & Sons, Ltd.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Efficient solution algorithm for finding spatially dependent reliable shortest path in road networks




    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English


    Classification :

    BKL:    55.21 Kraftfahrzeuge / 55.21
    Local classification TIB:    275/7020



    Impacts of Correlations on Reliable Shortest Path Finding

    Zockaie, Ali / Nie, Yu (Marco) / Wu, Xing et al. | Transportation Research Record | 2013


    Reliable Shortest Path Problems in Stochastic Time-Dependent Networks

    Chen, Bi Yu / Lam, William H. K. / Sumalee, Agachai et al. | Taylor & Francis Verlag | 2014



    Finding Shortest Path in Road Networks Based on Jam-Distance Graph and Dijkstra’s Algorithm

    Ali, Sarah Fouad / Abdulrazzaq, Musaab Riyadh / Gaata, Methaq Talib | Springer Verlag | 2022


    Finding Reliable Shortest Paths in Dynamic Stochastic Networks

    Wu, Xing | Transportation Research Record | 2013