In a hierarchical road network, all roads can be classified into two groups according to their attributes, such as their speed limit and the number of lanes. By splitting the whole network into high-level and low-level subnetworks, the size of the road network to be searched can be reduced, and more human-oriented paths can be obtained. In this paper, we define a convenient path in the hierarchical road network and propose an algorithm for finding that path. The proposed algorithm produces a convenient and approximately shortest path with little computational effort by reducing the number of nodes to be considered. The difference between the length of the paths produced by the proposed algorithm and by existing algorithms and that of the shortest path of the whole network is discussed. Some experimental results are given to show the efficiency of the proposed algorithm.
Finding a path in the hierarchical road networks
01.01.2001
714251 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Finding a Path in the Hierarchical Road Networks
British Library Conference Proceedings | 2001
|Efficient solution algorithm for finding spatially dependent reliable shortest path in road networks
Online Contents | 2016
|Optimizing Road Networks: A Graph-Based Analysis with Path-finding and Learning Algorithms
Springer Verlag | 2025
|Optimizing Road Networks: A Graph-Based Analysis with Path-finding and Learning Algorithms
Springer Verlag | 2025
|