Theoretical research often assumes all users are homogeneous in their route choice decision and will always pick the route with the shortest travel cost, which is not necessarily the case in reality. This paper documents the research effort in developing a Constrained Time-Dependent K Shortest Paths Algorithm in order to find K Shortest Paths between two given locations. The goal of this research is to provide sound route options to travelers in order to assist their route choice decision process, during which the overlap and travel time deviation issues between the K paths will be considered. The proposed algorithm balancing overlap and travel time deviation is developed in this research. A numerical analysis is conducted on the Tucson I-10 network, the outcome of the case study shows that our proposed algorithm is able to find different shortest paths with a reasonable degree of similarity and close travel time, which indicates that the result of the proposed algorithm is satisfactory.


    Access

    Download


    Export, share and cite



    Title :

    A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation


    Contributors:


    Publication date :

    2015




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Deviation between Actual and Shortest Travel Time Paths for Commuters

    Tang, Wenyun / Levinson, David M. | ASCE | 2018



    Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation

    Dong, Wei / Vu, Hai L. / Nazarathy, Yoni et al. | Transportation Research Record | 2013