This paper examines how correlations in link travel times affect reliable path finding in a stochastic network. The reliable path is defined as the path that requires the lowest travel time budget to ensure a given probability of on-time arrival. Such a path can be found by solving the shortest path problem considering on-time arrival reliability (SPOTAR). SPOTAR is solved approximately by using an approach based on Monte Carlo simulation. A major advantage of the simulation-based algorithm is its ability to deal with correlated link travel times. Through the use of a real-world network, the simulation-based algorithm is first validated by comparing it with a label-correcting algorithm that can solve the uncorrelated case exactly; the impacts of the correlations on link travel times are then examined. The results of the numerical experiments indicate that correlations affect the optimal SPOTAR solutions significantly. However, larger correlations do not always lead to larger errors in the reliable route choices that ignore them.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Impacts of Correlations on Reliable Shortest Path Finding


    Subtitle :

    A Simulation-Based Study


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2013-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English