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.
The Shortest Path Problem with Uncertain Information in Transport Networks
2016-01-01
12 pages
Article/Chapter (Book)
Electronic Resource
English
Improved shortest path algorithms for transport networks
Elsevier | 1977
|Shortest Path of Emergency Vehicles Under Uncertain Urban Traffic Conditions
Online Contents | 1996
|The Variance-Constrained Shortest Path Problem
Online Contents | 1994
|Shortest path problem with arc failure scenarios
Online Contents | 2017
|