Abstract
It takes a lot of CPU time to calculate the optimal routes between the start links and the destination links in a large scale road network.
We have developed a fast method for route calculation using pre-determined routes between areas. In this method, a large scale road network is divided into many areas. The main parts of the optimal routes from each start area to all destination areas are pre-determined and stored in the data base (area route data base). The route calculator proposed in this method calculates the optimal route from a start link to a destination link using the pre-determined routes from the corresponding start area stored in the area route data base.
This paper describes a way of calculating the exact route using area route data base. Experimental results compared with simple use of Dijkstra's method show that the proposed methodis quite effective for reducing the route calculation time.
