This paper addresses the reliable shortest path problem with the following optimality criterion: maximizing the probability of arriving on time at a destination within a given time budget. As a link travel time distribution, we propose to use stable Levy distributions. The use of stable distributions allows replacing the computationally complex convolutions calculations with recalculating the Levy distribution parameters, which significantly reduces the running time of the algorithm. An experimental analysis of the algorithm conducted on a large-scale road network in Samara, Russia allow us to conclude that the proposed algorithm can significantly reduce the computation time with a slight increase in the path travel time.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Stochastic On-time Arrival Problem with Levy Stable Distributions


    Contributors:


    Publication date :

    2019-09-01


    Size :

    3417446 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Levy-Stable Productivity Shocks

    Gaffeo, E. | British Library Online Contents | 2008


    Improving the performance of arrival on time in stochastic shortest path problem

    Yaoxin Wu / Wei Chen / Xuexi Zhang et al. | IEEE | 2016



    Optimizing Customized Transit Service considering Stochastic Bus Arrival Time

    Qian Sun / Steven Chien / Dawei Hu et al. | DOAJ | 2021

    Free access