DOI: 
10.3846/16484142.2012.667835
Gábor Szűcsa* 

pages 79-85
Available online: 30 Mar 2012

Keywords
Dijkstra's algorithm, Dempster–Shafer theory, transportation planning, cost interval, route search

Abstract
The goal of this paper is to find a solution for route planning in a transport network where the network type can be arbitrary: a network of bus routes, a network of tram rails, a road network or any other type of a transport network. Furthermore, the costs of network elements are uncertain. The concept is based on the Dempster–Shafer theory and Dijkstra's algorithm which helps with finding the best routes. The paper focuses on conventional studies without considering traffic accidents or other exceptional circumstances. The concept is presented by an undirected graph. In order to model conventional real transport, the influencing factors of traffic congestion have been applied in the abstract model using uncertain probabilities described by probability intervals. On the basis of these intervals, the cost intervals of each road can be calculated. Taking into account the uncertain values of costs, an algorithm has been outlined for determining the best routes from one node to all other nodes comparing cost intervals and using decision rules that can be defined by the end user, and if necessary, node by node. The suggested solution can be applied for both one type of network as well as for a combination of a few of those.