FINDING A ROUTE IN A HIERARCHICAL URBAN TRANSPORTATION NETWORK
Myeong-Eon Seong · 1998
One of the properties of urban road networks is their hierarchical structure. These networks consist of several grades of roads ranging from dense, low-speed local roadways to sparse, high-speed motorways. When drivers seek how to go from an origin to a destination, they use this property to find a route quickly. Imitating this human procedure, we suggested an algorithm for finding a route in a hierarchical urban transportation network. Applying the procedure, the size of networks was reduced and consequently the computation time for finding a route was reduced to about 1/6 when the density of the motorway was greater than 5%. The routes found by our algorithm were the shortest ones so long as the travel times of arcs of each grade did not overlap. For the covering abstract see IRRD E102946.