PARP: A Parallel Traffic Condition Driven Route Planning Model on Dynamic Road Networks
Authors:
Open Access
- 16 December 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 12 (6) , 1-24
Abstract
The problem of route planning on road network is essential to many Location-Based Services (LBSs). Road networks are dynamic in the sense that the weights of the edges in the corresponding graph constantly change over time, representing evolving traffic conditions. Thus, a practical route planning strategy is required to supply the continuous route optimization considering the historic, current, and future traffic condition. However, few existing works comprehensively take into account these various traffic conditions during the route planning. Moreover, the LBSs usually suffer from extensive concurrent route planning requests in rush hours, which imposes a pressing need to handle numerous queries in parallel for reducing the response time of each query. However, this issue is also not involved by most existing solutions. We therefore investigate a parallel traffic condition driven route planning model on a cluster of processors. To embed the future traffic condition into the route planning, we employ a GCN model to periodically predict the travel costs of roads within a specified time period, which facilitates the robustness of the route planning model against the varying traffic condition. To reduce the response time, a Dual-Level Path (DLP) index is proposed to support a parallel route planning algorithm with the filter-and-refine principle. The bottom level of DLP partitions the entire graph into different subgraphs, and the top level is a skeleton graph that consists of all border vertices in all subgraphs. The filter step identifies a global directional path for a given query based on the skeleton graph. In the refine step, the overall route planning for this query is decomposed into multiple sub-optimizations in the subgraphs passed through by the directional path. Since the subgraphs are independently maintained by different processors, the sub-optimizations of extensive queries can be operated in parallel. Finally, extensive evaluations are conducted to confirm the effectiveness and superiority of the proposal.Keywords
Funding Information
- National Natural Science Foundation of China (61728204, 62172351)
- Key Laboratory of Safety-Critical Software Ministry of Industry and Information Technology (NJ2018014)
- Fundamental Research
- Ford Motor URP Funding
- CCF-Huawei Database System Innovation Research Plan (CCF-HUAWEI DBIR2020001A)
This publication has 29 references indexed in Scilit:
- Efficient Clue-Based Route Search on Road NetworksIEEE Transactions on Knowledge and Data Engineering, 2017
- Facilitating safe vehicle routing in smart cities2017
- Optimal detection of faulty traffic sensors used in route planning2017
- Dynamic route planning with real-time traffic predictionsInformation Systems, 2017
- Distributed shortest path query processing on dynamic road networksThe VLDB Journal, 2017
- R3Proceedings of the VLDB Endowment, 2014
- Traffic Aware Route Planning in Dynamic Road Networks2012
- Engineering multilevel overlay graphs for shortest-path queriesACM Journal of Experimental Algorithmics, 2009
- Time-Varying Travel Times in Vehicle RoutingTransportation Science, 2004
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968