Dynamic Route Guidance via Road Network Matching and Public Transportation Data
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Dynamic route guidance (DRG) finds the fastest path from a source to a destination location considering thereal-time congestion information. In Korea, the traffic state information is available by the public transportationdata (PTD) which is indexed on top of the node-link map (NLM). While the NLM is the authoritative low-detailedroad network for major roads only, the OpenStreetMap road network (ORN) supports not only a high-detailed roadnetwork but also a few open-source routing engines, such as OSRM and Valhalla. In this paper, we propose a DRGframework based on road network matching between the NLM and ORN. This framework regularly retrieves theNLM-indexed PTD to construct a historical speed profile which is then mapped to ORN. Next, we extend theValhalla routing engine to support dynamic routing based on the historical speed profile. The numerical results atthe Yeoui-do island with collected 11-month PTD show that our DRG framework reduces the travel time up to15.24 % and improves the estimation accuracy of travel time more than 5 times.
Abstract
Dynamic route guidance (DRG) finds the fastest path from a source to a destination location considering thereal-time congestion information. In Korea, the traffic state information is available by the public transportationdata (PTD) which is indexed on top of the node-link map (NLM). While the NLM is the authoritative low-detailedroad network for major roads only, the OpenStreetMap road network (ORN) supports not only a high-detailed roadnetwork but also a few open-source routing engines, such as OSRM and Valhalla. In this paper, we propose a DRGframework based on road network matching between the NLM and ORN. This framework regularly retrieves theNLM-indexed PTD to construct a historical speed profile which is then mapped to ORN. Next, we extend theValhalla routing engine to support dynamic routing based on the historical speed profile. The numerical results atthe Yeoui-do island with collected 11-month PTD show that our DRG framework reduces the travel time up to15.24 % and improves the estimation accuracy of travel time more than 5 times.
참고문헌 (8)
- "Public Traffic Information Service"[URL]
- "Node Link Map"[URL]
- "OpenStreetMap"[URL]
- "Valhalla"[URL]
- "An Area Partitioning and Subgraph Growing Approach to the Conflation of Road Networks"[URL]
- "Ko: Map Features"[URL]
- P. Hart, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths", IEEE Trans. Syst. Sci. Cybern, 4(2), pp.100~107 (1968)[DOI]
- L. Zhao, T. Ohshima, and H. Nagamochi, "A*algorithm for the time-dependent shortest path problem", Proc. of the 11th Japan-Korea Joint Workshop on Algorithms and Computation(WAAC08), pp, pp.36~43 (2008)
