Route Planning with Uncertain Information using Dempster-Shafer theory
Gábor Szücs, Gyula Sallai · 2009
The aim of this paper is to find a solution for route planning in a road network, where the costs of roads are uncertain. Our concept is based on the Dempster-Shafer theory and Dijkstra's algorithm, which helps to find the best routes. We model the influencing factors of the traffic congestion on the roads using uncertain probabilities described by probability intervals. Based on these intervals the cost intervals of each road can be calculated. Taking the uncertain values of costs into account an algorithm has been outlined for determination the best routes from a node to all other nodes comparing the cost intervals and using decision rules. Decision rules can be defined by the end user, if necessary node by node.