Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

PARP: A Parallel Traffic Condition Driven Route Planning Model on Dynamic Road Networks

Published: 16 December 2021 Publication History

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.

References

[1]
Claudine Badue, Rânik Guidolini, Raphael Vivacqua Carneiro, Pedro Azevedo, Vinicius Brito Cardoso, Avelino Forechi, Luan Jesus, Rodrigo Berriel, Thiago Meireles Paixão, Filipe Mutz et al. 2020. Self-driving cars: A survey. Exp. Syst. Applic. 165, 1 (2020), 113–816.
[2]
Fleischmann Bernhard, Gietz Martin, and Gnutzmann Stefan. 2004. Time-varying travel times in vehicle routing. Transport. Sci. 38, 2 (2004), 121–255.
[3]
Tianlun Dai, Wenchao Zheng, Jiayue Sun, Cun Ji, Tao Zhou, Mingtong Li, Wei Hu, and Ziqiang Yu. 2020. Continuous route planning over a dynamic graph in real-time. Procedia Comput. Sci. 174 (2020), 111–114.
[4]
Ugur Demiryurek, Farnoush Banaei-Kashani, Cyrus Shahabi, and Anand Ranganathan. 2011. Online computation of fastest path in time-dependent spatial networks. In Advances in Spatial and Temporal Databases. 92–111.
[5]
DIMACS. 2006. 9th DIMACS Implementation Challenge - Shortest Paths. Retrieved from http://users.diag.uniroma1.it/challenge9/.
[6]
Amin Ghafouri, Aron Laszka, Abhishek Dubey, and Xenofon Koutsoukos. 2017. Optimal detection of faulty traffic sensors used in route planning. In Proceedings of the 2nd International Workshop on Science of Smart City. 1–6.
[7]
Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems. 1025–1035.
[8]
Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cyber. 4, 2 (1968), 100–107.
[9]
Edward He, N. Boland, G. Nemhauser, M. Savelsbergh, and H. Stewart. 2019. Dynamic discretization discovery algorithms for time-dependent shortest path problems. In Proceeding of CPAIOR 2018.
[10]
Martin Holzer, Frank Schulz, and Dorothea Wagner. 2009. Engineering multilevel overlay graphs for shortest-path queries. ACM J. Exp. Algor. 13 (2009), 156–170.
[11]
Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In Proceedings of the Conference on Learning Representations.
[12]
Jinglin Li, Dawei Fu, Quan Yuan, Haohan Zhang, Kaihui Chen, Shu Yang, and Fangchun Yang. 2019. A traffic prediction enabled double rewarded value iteration network for route planning. IEEE Trans. Vehic. Technol. 68, 5 (2019), 4170–4181.
[13]
Xiang Li, Yan Zhao, Xiaofang Zhou, and Kai Zheng. 2020. Consensus-based group task assignment with social impact in spatial crowdsourcing. Data Sci. Eng. 5, 4 (2020), 375–390.
[14]
Thomas Liebig, Nico Piatkowski, Christian Bockermann, and Katharina Morik. 2017. Route planning with real-time traffic predictions. In Proceedings of the LWA 2014 Information Systems. 258–265.
[15]
Nirmesh Malviya, Samuel R. Madden, and Arnab Bhattacharya. 2011. A continuous query system for dynamic route planning. In Proceedings of the IEEE 27th International Conference on Data Engineering. 792–803.
[16]
OpenStreetMap. 2021. OpenStreetMap. Retrieved from https://www.openstreetmap.org/#map=10/39.8342/116.4957/.
[17]
Dian Ouyang, Long Yuan, Lu Qin, Lijun Chang, Ying Zhang, and Xuemin Lin. 2020. Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees. Proc. VLDB Endow. 13, 5 (2020), 602–615.
[18]
Asli Özal, Anand Ranganathan, and Nesime Tatbul. 2011. Real-time route planning with stream processing systems: A case study for the city of Lucerne. In Proceedings of the 2nd ACM SIGSPATIAL International Workshop on GeoStreaming. 21–28.
[19]
Mahboobe Rezaei, Hamed Noori, Mohsen Mohammadkhani Razlighi, and Mohsen Nickray. 2019. ReFOCUS+: Multi-layers real-time intelligent route guidance system with congestion detection and avoidance. IEEE Trans. Intell. Transport. Syst. 22, 1 (2019), 1–14.
[20]
Sai Shao, Wei Guan, Bin Ran, Zhengbing He, and Jun Bi. 2017. Electric vehicle routing problem with charging time and variable travel time. Math. Prob. Eng. 2017, 1 (2017), 1–13.
[21]
Abd-Elhamid M. Taha. 2017. Facilitating safe vehicle routing in smart cities. In Proceedings of the IEEE International Conference on Communications (ICC). 1–5.
[22]
Vianney Kengne Tchendji and Jerry Lacmou Zeutouo. 2019. An efficient CGM-based parallel algorithm for solving the optimal binary search tree problem through one-to-all shortest paths in a dynamic graph. Data Sci. Eng. 4, 2 (2019), 141–156.
[23]
Daniel Tischner. 2018. Multi-modal route planning in road and transit networks. CoRR abs/1809.05481 (2018).
[24]
Yongxin Tong, Yuxiang Zeng, Zimu Zhou, Lei Chen, and Ke Xu. 2018. A unified approach to route planning for shared mobility. Proc. VLDB Endow. 11, 11 (2018), 1633–1646.
[25]
Henan Wang, Guoliang Li, Huiqi Hu, Shuo Chen, Bingwen Shen, Hao Wu, Wen-Syan Li, and Kian-Lee Tan. 2014. R3: A real-time route recommendation system. Proc. VLDB Endow. 7, 13 (2014), 1549–1552.
[26]
Senzhang Wang, Jiannong Cao, Hao Chen, Hao Peng, and Zhiqiu Huang. SeqST-GAN: Seq2Seq generative adversarial nets for multi-step urban crowd flow prediction. In ACM Trans. Spatial Algor. Syst. 6, 4, 1555–1564.
[27]
S. Wang, J. Cao, and P. Yu. 2020. Deep learning for spatio-temporal data mining: A survey. IEEE Trans. Knowl. Data Eng. 1, 1 (2020).
[28]
Senzhang Wang, Hao Miao, Hao Chen, and Zhiqiu Huang. 2020. Multi-task adversarial spatial-temporal networks for crowd flow prediction. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management.
[29]
Siwei Wu, Demin Li, Guanglin Zhang, Chang Guo, and Leilei Qi. 2016. Density-based dynamic revision path planning in urban area via VANET. In Proceedings of the International Conference on Machine Learning and Intelligent Communications. 129–138.
[30]
Jiajie Xu, Limin Guo, Zhiming Ding, Xiling Sun, and Chengfei Liu. 2012. Traffic aware route planning in dynamic road networks. In Proceedings of the International Conference on Database Systems for Advanced Applications. 576–591.
[31]
Keyu Yang, X. Ding, Yuanliang Zhang, L. Chen, B. Zheng, and Y. Gao. 2019. Distributed similarity queries in metric spaces. Data Sci. Eng. 4, 2 (2019), 93–108.
[32]
Zhong Yang, Bolong Zheng, Guohui Li, Xi Zhao, Xiaofang Zhou, and Christian S. Jensen. 2020. Adaptive top-k overlap set similarity joins. In Proceedings of the International Conference on Data Engineering. IEEE, 1081–1092.
[33]
Ziqiang Yu, Xiaohui Yu, Nick Koudas, Yang Liu, Yifan Li, Yueting Chen, and Dingyu Yang. 2020. Distributed processing of k shortest path queries over dynamic road networks. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 665–679.
[34]
Jing Yuan, Yu Zheng, Xing Xie, and Guangzhong Sun. 2011. Driving with knowledge from the physical world. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 316–324.
[35]
Nicholas Jing Yuan, Yu Zheng, Chengyang Zhang, Wenlei Xie, Xing Xie, Guangzhong Sun, and Yan Huang. 2010. T-drive: Driving directions based on taxi trajectories. In Proceedings of the 18th ACM SIGSPATIAL Conference on Advances in Geographical Information Systems.
[36]
Dongxiang Zhang, Dingyu Yang, Yuan Wang, Kian-Lee Tan, Jian Cao, and Heng Tao Shen. 2017. Distributed shortest path query processing on dynamic road networks. VLDB J. 26, 3 (2017), 399–419.
[37]
Bolong Zheng, Chenze Huang, Christian S. Jensen, Lu Chen, Nguyen Quoc Viet Hung, Guanfeng Liu, Guohui Li, and Kai Zheng. 2020. Online trichromatic pickup and delivery scheduling in spatial crowdsourcing. In Proceedings of the IEEE International Conference on Data Engineering. IEEE, 973–984.
[38]
Bolong Zheng, Han Su, Wen Hua, Kai Zheng, Xiaofang Zhou, and Guohui Li. 2017. Efficient clue-based route search on road networks. IEEE Trans. Knowl. Data Eng. 29, 9 (2017), 1846–1859.
[39]
Bolong Zheng, Xi Zhao, Lianggui Weng, Nguyen Quoc Viet Hung, Hang Liu, and Christian S. Jensen. 2020. PM-LSH: A fast and accurate LSH framework for high-dimensional approximate NN search. Proc. VLDB Endow. 13, 5 (2020), 643–655.
[40]
Bolong Zheng, Kai Zheng, Christian S. Jensen, Nguyen Quoc Viet Hung, Han Su, Guohui Li, and Xiaofang Zhou. 2020. Answering why-not group spatial keyword queries. IEEE Trans. Knowl. Data Eng. 32, 1 (2020), 26–39.

Cited By

View all
  • (2024)Research on Automatic Generation of Park Road Network Based on Skeleton AlgorithmApplied Sciences10.3390/app1418847514:18(8475)Online publication date: 20-Sep-2024
  • (2024)Real-Time Insertion Operator for Shared Mobility on Time-Dependent Road NetworksProceedings of the VLDB Endowment10.14778/3654621.365463317:7(1669-1682)Online publication date: 30-May-2024
  • (2024)Improving graph convolutional networks with reinforcement learning for pure electric logistics vehicle routingInternational Conference on Smart Transportation and City Engineering (STCE 2023)10.1117/12.3024076(104)Online publication date: 14-Feb-2024

Index Terms

  1. PARP: A Parallel Traffic Condition Driven Route Planning Model on Dynamic Road Networks

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Transactions on Intelligent Systems and Technology
    ACM Transactions on Intelligent Systems and Technology  Volume 12, Issue 6
    December 2021
    356 pages
    ISSN:2157-6904
    EISSN:2157-6912
    DOI:10.1145/3501281
    • Editor:
    • Huan Liu
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 16 December 2021
    Accepted: 01 March 2021
    Revised: 01 March 2021
    Received: 01 November 2020
    Published in TIST Volume 12, Issue 6

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Route planning
    2. parallel computing
    3. road network
    4. travel cost prediction

    Qualifiers

    • Research-article
    • Refereed

    Funding Sources

    • National Natural Science Foundation of China
    • Key Laboratory of Safety-Critical Software Ministry of Industry and Information Technology
    • Fundamental Research
    • Ford Motor URP Funding
    • CCF-Huawei Database System Innovation Research Plan

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)75
    • Downloads (Last 6 weeks)9
    Reflects downloads up to 17 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Research on Automatic Generation of Park Road Network Based on Skeleton AlgorithmApplied Sciences10.3390/app1418847514:18(8475)Online publication date: 20-Sep-2024
    • (2024)Real-Time Insertion Operator for Shared Mobility on Time-Dependent Road NetworksProceedings of the VLDB Endowment10.14778/3654621.365463317:7(1669-1682)Online publication date: 30-May-2024
    • (2024)Improving graph convolutional networks with reinforcement learning for pure electric logistics vehicle routingInternational Conference on Smart Transportation and City Engineering (STCE 2023)10.1117/12.3024076(104)Online publication date: 14-Feb-2024
    • (2023)Route Planning Based on Parallel Optimization in the Air-Ground Integrated NetworkIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.323493624:12(15762-15772)Online publication date: 16-Jan-2023

    View Options

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Full Text

    View this article in Full Text.

    Full Text

    HTML Format

    View this article in HTML Format.

    HTML Format

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media