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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The Shortest Path Problem with Uncertain Information in Transport Networks


    Contributors:


    Publication date :

    2016-01-01


    Size :

    12 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    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


    Shortest path problem with arc failure scenarios

    Issac, Preethi / Campbell, Ann Melissa | Online Contents | 2017