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 条
  • [11] The shortest path problem on networks with fuzzy parameters
    Hernandes, Fabio
    Lamata, Maria Teresa
    Verdegay, Jose Luis
    Yamakami, Akebo
    FUZZY SETS AND SYSTEMS, 2007, 158 (14) : 1561 - 1570
  • [12] IMPROVED SHORTEST PATH ALGORITHMS FOR TRANSPORT NETWORKS
    VANVLIET, D
    TRANSPORTATION RESEARCH, 1978, 12 (01): : 7 - 20
  • [13] The Shortest Path Problem and Its Critical Edge in Uncertain Environment
    Jie, Ke Wei
    Zhao, Gao Chang
    Sun, Xiao Jun
    IEEE ACCESS, 2019, 7 : 154414 - 154423
  • [14] Models and algorithm for generalized shortest path problem in uncertain environment
    Li, Fei
    Proceedings of the Fifth International Conference on Information and Management Sciences, 2006, 5 : 377 - 382
  • [15] Solving Uncertain Shortest Path Problem Based on Granular Computing
    Alsawy, A. A.
    Hefny, H. A.
    2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMPUTING RESEARCH (ICCIC), 2013, : 838 - 841
  • [16] Shortest Path Versus Multihub Routing in Networks With Uncertain Demand
    Frechette, Alexandre
    Shepherd, F. Bruce
    Thottan, Marina K.
    Winzer, Peter J.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (06) : 1931 - 1943
  • [17] Stochastic Shortest Path Finding in Path-Centric Uncertain Road Networks
    Andonov, Georgi
    Yang, Bin
    2018 19TH IEEE INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT (MDM 2018), 2018, : 40 - 45
  • [18] Uncertain programming models for multi-objective shortest path problem with uncertain parameters
    Majumder, Saibal
    Kar, Mohuya B.
    Kar, Samarjit
    Pal, Tandra
    SOFT COMPUTING, 2020, 24 (12) : 8975 - 8996
  • [19] Uncertain programming models for multi-objective shortest path problem with uncertain parameters
    Saibal Majumder
    Mohuya B. Kar
    Samarjit Kar
    Tandra Pal
    Soft Computing, 2020, 24 : 8975 - 8996
  • [20] Sharing information for the all pairs shortest path problem
    Takaoka, Tadao
    THEORETICAL COMPUTER SCIENCE, 2014, 520 : 43 - 50
12345