Abstract The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra’s algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The Shortest Path Problem with Uncertain Information in Transport Networks


    Beteiligte:


    Erscheinungsdatum :

    01.01.2016


    Format / Umfang :

    12 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    The Shortest Path Problem with Uncertain Information in Transport Networks

    Neumann, Tomasz | British Library Conference Proceedings | 2016



    Time-Constrained Shortest-Path Problem in Stochastic Dynamic Networks

    National Research Council (U.S.) | British Library Conference Proceedings | 2005


    Robust Shortest Path Problem With Distributional Uncertainty

    Zhang, Yuli / Song, Shiji / Shen, Zuo-Jun Max et al. | IEEE | 2018


    The Variance-Constrained Shortest Path Problem

    Sivakumar, Raj A. | Online Contents | 1994