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 条
  • [21] Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment
    Deng, Yong
    Chen, Yuxin
    Zhang, Yajuan
    Mahadevan, Sankaran
    APPLIED SOFT COMPUTING, 2012, 12 (03) : 1231 - 1237
  • [22] The shortest path problem in the stochastic networks with unstable topology
    Shirdel, Gholam H.
    Abdolhosseinzadeh, Mohsen
    SPRINGERPLUS, 2016, 5
  • [23] An Entropy Maximization Problem in Shortest Path Routing Networks
    Chellappan, Vanniarajan
    Sivalingam, Krishna M.
    Krithivasan, Kamala
    2014 IEEE 20TH INTERNATIONAL WORKSHOP ON LOCAL & METROPOLITAN AREA NETWORKS (LANMAN), 2014,
  • [24] Nonlinear neural networks for solving the shortest path problem
    Effati, S.
    Jafarzadeh, M.
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 189 (01) : 567 - 574
  • [25] A distributed solution to the shortest path problem for large networks
    Li, XF
    6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCI I, 2002, : 57 - 62
  • [26] A bank of Hopfield neural networks for the shortest path problem
    BousonoCalzon, C
    FigueirasVidal, AR
    SIGNAL PROCESSING, 1997, 61 (02) : 157 - 170
  • [27] Fast Approximation of Shortest Path on Dynamic Information Networks
    Jin, Junting
    Shi, Xiaowei
    Li, Cuiping
    Chen, Hong
    WEB-AGE INFORMATION MANAGEMENT, WAIM 2014, 2014, 8485 : 272 - 276
  • [28] A Shortest Path Problem
    JIA Zhengsheng(Mathematics and Mechanics Department of Taiyuan University of technology Taiyuan 030024)FAN Hui(Foundation Department Shan Xi Mining Industry institute
    JournalofSystemsScienceandSystemsEngineering, 1996, (04) : 496 - 499
  • [29] Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information
    Broumi, Said
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    PROCEEDINGS OF 2016 10TH INTERNATIONAL CONFERENCE ON SOFTWARE, KNOWLEDGE, INFORMATION MANAGEMENT & APPLICATIONS (SKIMA), 2016, : 169 - 174
  • [30] Speeding Up Shortest Path Search in Public Transport Networks
    Martinek, Vladislav
    Zemlicka, Michal
    DATESO 2009 - DATABASES, TEXTS, SPECIFICATIONS, OBJECTS: PROCEEDINGS OF THE 9TH ANNUAL INTERNATIONAL WORKSHOP, 2009, 471 : 1 - 12
12345