Journal of IKEEE (전기전자학회논문지)

Institute of Korean Electrical and Electronics Engineers (한국전기전자학회)
권호 표지
DOI QR코드

DOI QR Code

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)
  • Received : 2021.12.07
  • Accepted : 2021.12.31
  • Published : 2021.12.31
Download PDF
⟨ Previous Next ⟩

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

Acknowledgement

This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education(2019R1I1A3A01060890).

References

  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. 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
  8. 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.