On Finding a Convenient Path in the Hierarchical Road Network
In a hierarchical road network, all roads can be classified according to their attributes such as speed limit, number of lanes, etc. By splitting the whole road network into the subnetworks of the high-level and low-level roads, we can reduce the size of the network to be calculated at once, and fin...
Saved in:
| Published in | Management science & financial engineering pp. 87 - 110 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | Korean |
| Published |
한국경영과학회
01.11.2006
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 2287-2043 2287-2361 |
Cover
| Summary: | In a hierarchical road network, all roads can be classified according to their attributes such as speed limit, number of lanes, etc. By splitting the whole road network into the subnetworks of the high-level and low-level roads, we can reduce the size of the network to be calculated at once, and find a path in the way that drivers usually adopt when searching out a travel route. To exploit the hierarchical property of road networks, we define a convenient path and propose an algorithm for finding convenient paths. We introduce a parameter indicating the drivers tolerance to the difference between the length of a convenient path and that of a shortest convenient path. From this parameter, we can determine how far we have to search for the entering and exiting gateway. We also propose some techniques for reducing the number of pairs of entries and exits to be searched in a road network. A result of the computational experiment on a real road network is given to show the efficiency of the proposed algorithm. KCI Citation Count: 0 |
|---|---|
| Bibliography: | G704-000073.2006.12.2.003 |
| ISSN: | 2287-2043 2287-2361 |