The Shortest Path Problem with Uncertain Information in Transport Networks

被引：11
|
作者：
Neumann, Tomasz [1 ]
机构：
[1] Gdynia Maritime Univ, Fac Nav, Al Jana Pawla 2 3, PL-31345 Gdynia, Poland
来源：
CHALLENGE OF TRANSPORT TELEMATICS, TST 2016 | 2016年 / 640卷
关键词：
Transport networks; Dempster-Shafer theory; Dijkstra's algorithm;
D O I：
10.1007/978-3-319-49646-7_40
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：475 / 486
页数：12
相关论文
共 50 条
  • [1] Uncertain random shortest path problem
    Yuhong Sheng
    Xuehui Mei
    Soft Computing, 2020, 24 : 2431 - 2440
  • [2] Uncertain random shortest path problem
    Sheng, Yuhong
    Mei, Xuehui
    SOFT COMPUTING, 2020, 24 (04) : 2431 - 2440
  • [3] Shortest path problem on uncertain networks: An efficient two phases approach
    Davoodi, Mansoor
    Ghaffari, Mohsen
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 157
  • [4] α-Reliable Shortest Path Problem in Uncertain Time-Dependent Networks
    Biswal S.
    Ghorai G.
    Mohanty S.P.
    International Journal of Applied and Computational Mathematics, 2022, 8 (4)
  • [5] Shortest path problem on uncertain networks: An efficient two phases approach
    Davoodi, Mansoor
    Ghaffari, Mohsen
    Computers and Industrial Engineering, 2021, 157
  • [6] Shortest path problem with uncertain arc lengths
    Gao, Yuan
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2011, 62 (06) : 2591 - 2600
  • [7] Shortest path problem of uncertain random network
    Sheng, Yuhong
    Gao, Yuan
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 97 - 105
  • [8] On the shortest path problem of uncertain random digraphs
    Hao Li
    Kun Zhang
    Soft Computing, 2022, 26 : 9069 - 9081
  • [9] On the shortest path problem of uncertain random digraphs
    Li, Hao
    Zhang, Kun
    SOFT COMPUTING, 2022, 26 (18) : 9069 - 9081
  • [10] The shortest path problem in uncertain domains - an agent based approach with Bayesian networks
    Dangelmaier, Wilhelm
    Kloepper, Benjamin
    Wienstroer, Jens
    Timm, Thorsten
    ISDA 2006: SIXTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 2, 2006, : 943 - +
12345