Browse > Article
http://dx.doi.org/10.7471/ikeee.2021.25.4.756

Dynamic Route Guidance via Road Network Matching and Public Transportation Data  

Nguyen, Hoa-Hung (Dept. of Electrical Engineering, Pusan National University)
Jeong, Han-You (Dept. of Electrical Engineering, Pusan National University)
Publication Information
Journal of IKEEE / v.25, no.4, 2021 , pp. 756-761 More about this Journal
Abstract
Dynamic route guidance (DRG) finds the fastest path from a source to a destination location considering the real-time congestion information. In Korea, the traffic state information is available by the public transportation data (PTD) which is indexed on top of the node-link map (NLM). While the NLM is the authoritative low-detailed road network for major roads only, the OpenStreetMap road network (ORN) supports not only a high-detailed road network but also a few open-source routing engines, such as OSRM and Valhalla. In this paper, we propose a DRG framework based on road network matching between the NLM and ORN. This framework regularly retrieves the NLM-indexed PTD to construct a historical speed profile which is then mapped to ORN. Next, we extend the Valhalla routing engine to support dynamic routing based on the historical speed profile. The numerical results at the Yeoui-do island with collected 11-month PTD show that our DRG framework reduces the travel time up to 15.24 % and improves the estimation accuracy of travel time more than 5 times.
Keywords
Dynamic route guidance; road network matching; node-link map; openstreetmap; intelligent transportation systems;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Korean National Transport Information Center, "Public Traffic Information Service," http://openapi.its.go.kr/
2 Korean National Transport Information Center, "Node Link Map," http://www.its.go.kr/nodelink/
3 OpenStreetMap Contributors, "OpenStreetMap," http://www.openstreetmap.org/
4 D. Gearhart, G. Knisely, K. Kreiser, K. DiLuca, and D. Nesbitt, "Valhalla," https://github.com/valhalla
5 H.-H. Nguyen, H.-Y. Jeong, "An Area Partitioning and Subgraph Growing Approach to the Conflation of Road Networks," http://vialab.pusan.ac.kr/lib/exe/fetch.php?media=Publication:apsg_vialab.pdf
6 OpenStreetMap. Ko: Map Features. https://wiki.openstreetmap.org/wiki/Ko:Map_Features
7 L. Zhao, T. Ohshima, and H. Nagamochi, "A* algorithm for the time-dependent shortest path problem," in Proc. of the 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08), pp.36-43, 2008.
8 P. Hart, N. Nilsson, and B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths," IEEE Trans. Syst. Sci. Cybern., vol.4, no.2, pp.100-107, 1968. DOI: 10.1109/TSSC.1968.300136   DOI