[KSCI] Korea Science Citation Index Service

On Finding a Convenient Path in the Hierarchical Road Network

Sung, Ki-Seok (Dept. of Industrial and Systems Engineering, Kangnung National University)
Park, Chan-Kyoo (Dept. of Management, Dongguk University)
Lee, Sang-Wook (Samsung SDS Co.)
Doh, Seung-Yong (IE & Software Group, Samsung Electronics Inc.)
Park, Soon-Dal (Dept. of Industrial Engineering, Seoul National University)

Publication Information

Management Science and Financial Engineering / v.12, no.2, 2006 , pp. 87-110 More about this Journal

Abstract

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 highlevel 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 driver's 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.

Keywords

Route Planning; Convenient Path; Shortest Path; Hierarchical Road Network;

Citations & Related Records

Reference

1	Liu, B., 'Route finding by using knowledge about the road network,' IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, 27 (1997), 436-448 DOI ScienceOn
2	Shapiro, J., J. Waxman, and D. Nir, 'Level graphs and approximate shortest path algorithms,' Networks, 22 (1992), 691-717 DOI
3	Campbell, J. F., 'Selecting routes to minimize urban travel time,' Transportation Research-Part, 26B (1992), 261-274
4	Seong, M., K. Sung, and S. Park, 'Finding a route in a hierarchical urban transportation network,' Proceedings of 5th World Congress on Intelligent Transport Systems(10.12-16, 1998), Korea
5	Ahuja, R. K., T. L. Magnanti, and J. B. Orlin, Networks flows: Theory, algorithms and applications, Prentice-Hall, 1993
6	Chou, Y.-L., H. E. Romeijn, and R. L. Smith, 'Approximating shortest paths in large-scale networks with an application to intelligent transportation systems,' INFORMS Journal on Computing, 10 (1998), 163-179 DOI ScienceOn
7	Duckham, M. and L. Kulik, 'Simpliest paths: Automated route selection for navigation,' In W. Kuhn, M. F. Worboys, and S. Timpf(Eds), Spatial Information Theory: Foundations of Geographic Information Science, Lecture Notes in Computer Science, Vol.2825 (2003), 182-199, Springer, Berlin