A FAST METHOD FOR ROUTE CALCULATION USING PRE-DETERMINED ROUTES BETWEEN AREAS
Akio Uekawa, Yukio Goto, Haruki Furusawa, I. Nakahori · Intelligent Transportation: Realizing the Future. Abstracts of the Third World Congress on Intelligent Transport SystemsITS America · 1996
Optimal route calculation in a road network is one of the most important computer applications in the transportation industry. However, it takes a lot of CPU time to calculate the optimal routes between the start points and the destination points in a large scale road network. The authors have developed a fast method for route calculation using pre-determined routes between areas. In this paper, a large scale road network is divided into many areas. The main parts of the 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 paper calculates the optimal route from a start point to a destination point 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 pre-determined routes between areas. Experimental results compared with simple use of Dijkstra's method show that the proposed method is quite effective for reducing the route calculation time.