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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Stochastic On-time Arrival Problem with Levy Stable Distributions


    Beteiligte:


    Erscheinungsdatum :

    01.09.2019


    Format / Umfang :

    3417446 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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

    Freier Zugriff