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) |
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 |
![]() |