LAUSR

Traditional optimal route selection procedures in traffic network usually take into account distance and/or travelling time between nodes. These two values are not always directly proportional, but they both influence travelling costs. Most of modern navigational systems dynamically check proposed route in certain time interval and correct it if necessary (congestion, road works, road accidents etc.). Provided route is, in most cases, compatible only with the traffic management requirements, but not necessarily with road safety conditions. In this paper we use the well-known method for finding the shortest paths between all pairs of nodes in transport network known as Floyd’s algorithm. In order to obtain the optimal solution while having two criteria simultaneously we propose integration of travelling time and a road safety parameter. Proposed methodology was tested on a real network which consists of 101 nodes in northern part of the Republic of Serbia.