Yong Wang
Abstract
For real-world time dependent road networks (TDRNs), answering shortest path-based route queries and plans in real-time is highly desirable by many industrial applications. Unfortunately, traditional (Dijkstra- or A*-like) algorithms are computationally expensive for such tasks on TDRNs.
Naturally, indexes are needed to meet the real-time constraint required by real applications. In this paper, we propose a novel height-balanced tree-structured index, called TD-G-tree, which supports fast route queries over TDRNs. The key idea is to use hierarchical graph partitioning to split a road network into hierarchical partitions. This will produce a balanced tree, where each tree node corresponds to a partition and each parent-child relationship corresponds to a partition and its sub-partition. We then compute and index time dependent shortest paths (TDSPs) only for borders (i.e., vertices whose edges are cut by a partition). Based on TD-G-tree, we devise efficient algorithms to support TDSP queries, as well as time-interval based route planning, for computing optimal solutions through dynamic programming and chronological divide-and-conquer. Extensive experiments on real-world datasets show that our method significantly outperforms existing approaches.
- H. Bast, D. Delling, A. Goldberg, M. Müller-Hannemann, T. Pajor, P. Sanders, D. Wagner, and R. F. Werneck. Route planning in transportation networks. In Algorithm engineering, pages 19--80. 2016.Google Scholar
Cross Ref
- G. V. Batz, D. Delling, P. Sanders, and C. Vetter. Time-dependent contraction hierarchies. In ALENEX, pages 97--105, 2009. Google ScholarDigital Library
- R. Bauer and D. Delling. Sharc: Fast and robust unidirectional routing. JEA, 14:4, 2009. Google ScholarDigital Library
- K. L. Cooke and E. Halsey. The shortest route through a network with time-dependent internodal transit times. Journal of mathematical analysis and applications, 14(3):493--498, 1966.Google Scholar
- F. Dehne, M. T. Omran, and J.-R. Sack. Shortest paths in time-dependent fifo networks. Algorithmica, 62(1-2):416--435, 2012. Google ScholarDigital Library
- D. Delling. Time-dependent sharc-routing. In ESA, pages 332--343, 2008. Google ScholarDigital Library
- D. Delling and G. Nannicini. Core routing on dynamic time-dependent road networks. INFORMS JOC, 24(2):187--201, 2012. Google ScholarDigital Library
- U. Demiryurek, F. Banaei-Kashani, C. Shahabi, and A. Ranganathan. Online computation of fastest path in time-dependent spatial networks. In SSTD, pages 92--111. Springer, 2011. Google ScholarDigital Library
- E. W. Dijkstra. A note on two problems in connexion with graphs. Numer. Math, 1(1):269--271, 1959. Google ScholarDigital Library
- B. Ding, J. X. Yu, and L. Qin. Finding time-dependent shortest paths over large graphs. In EDBT, pages 205--216, 2008. Google ScholarDigital Library
- S. E. Dreyfus. An appraisal of some shortest-path algorithms. Operations research, 17(3):395--412, 1969. Google ScholarDigital Library
- E. Eser, F. Kocayusufoğlu, B. Eravci, H. Ferhatosmanoğlu, and J. L. Larriba-Pey. Generating time-varying road network data using sparse trajectories. In ICDMW, pages 1118--1124. IEEE, 2016.Google ScholarCross Ref
- R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In International Workshop on Experimental and Efficient Algorithms, pages 319--333. Springer, 2008. Google ScholarDigital Library
- M. Gendreau, G. Ghiani, and E. Guerriero. Time-dependent routing problems: A review. Computers & operations research, 64:189--197, 2015. Google ScholarDigital Library
- A. V. Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In SODA, pages 156--165, 2005. Google ScholarDigital Library
- A. V. Goldberg, H. Kaplan, and R. F. Werneck. Reach for a*: Shortest path algorithms with preprocessing. In The Shortest Path Problem, pages 93--140, 2006.Google Scholar
- H. Heni, L. C. Coelho, and J. Renaud. Determining time-dependent minimum cost paths under several objectives. Computers & Operations Research, 2019.Google ScholarCross Ref
- H. Hu, G. Li, Z. Bao, Y. Cui, and J. Feng. Crowdsourcing-based real-time urban traffic speed estimation: From trends to speeds. In ICDE, pages 883--894. IEEE, 2016.Google ScholarCross Ref
- M. Hua and J. Pei. Probabilistic path queries in road networks: traffic uncertainty aware path selection. In EDBT, pages 347--358. ACM, 2010. Google ScholarDigital Library
- W. Huang and J. X. Yu. Investigating TSP heuristics for location-based services. DSE, 2(1):71--93, 2017.Google ScholarCross Ref
- E. Kanoulas, Y. Du, T. Xia, and D. Zhang. Finding fastest paths on A road network with speed patterns. In ICDE, page 10, 2006. Google ScholarDigital Library
- G. Karypis and V. Kumar. Analysis of multilevel graph partitioning. In SC, pages 29--29. IEEE, 1995. Google ScholarDigital Library
- D. E. Kaufman and R. L. Smith. Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. Journal of Intelligent Transportation Systems, 1(1):1--11, 1993.Google Scholar
- K. Li and G. Li. Approximate query processing: What is new and where to go? DSE, 3(4):379--397, 2018.Google ScholarCross Ref
- L. Li, W. Hua, X. Du, and X. Zhou. Minimal on-road time route scheduling on time-dependent graphs. PVLDB, 10(11):1274--1285, 2017. Google ScholarDigital Library
- L. Li, J. Kim, J. Xu, and X. Zhou. Time-dependent route scheduling on road networks. SIGSPATIAL Special, 10(1):10--14, 2018. Google ScholarDigital Library
- L. Li, K. Zheng, S. Wang, W. Hua, and X. Zhou. Go slow to go fast: Minimal on-road time route scheduling with parking facilities using historical trajectory. The VLDB Journal, 27(3):321--345, June 2018. Google ScholarDigital Library
- X. Lian and L. Chen. Trip planner over probabilistic time-dependent road networks. TKDE, 2014.Google ScholarCross Ref
- G. Nannicini, D. Delling, D. Schultes, and L. Liberti. Bidirectional a* search on time-dependent road networks. Networks, 59(2):240--251, 2012. Google ScholarDigital Library
- A. Orda and R. Rom. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. JACM, 37(3):607--625, 1990. Google ScholarDigital Library
- B. Shen, Y. Zhao, G. Li, W. Zheng, Y. Qin, B. Yuan, and Y. Rao. V-tree: Efficient knn search on moving objects with road-network constraints. In ICDE, pages 609--620, 2017.Google ScholarCross Ref
- N. Ta, G. Li, T. Zhao, J. Feng, H. Ma, and Z. Gong. An efficient ride-sharing framework for maximizing shared route. TKDE, 30(2):219--233, 2018.Google ScholarCross Ref
- E. Turunen. Using GUHA data mining method in analyzing road traffic accidents occurred in the years 2004-2008 in finland. DSE, 2(3):224--231, 2017.Google ScholarCross Ref
- H. Wang, G. Li, H. Hu, S. Chen, B. Shen, H. Wu, W.-S. Li, and K.-L. Tan. R3: a real-time route recommendation system. PVLDB, 7(13):1549--1552, 2014. Google ScholarDigital Library
- S. Wang, W. Lin, Y. Yang, X. Xiao, and S. Zhou. Efficient route planning on public transportation networks: A labelling approach. In SIGMOD, pages 967--982. ACM, 2015. Google ScholarDigital Library
- H. Yuan and G. Li. Distributed in-memory trajectory similarity search and join on road network. In ICDE, pages 1262--1273, 2019.Google ScholarCross Ref
- R. Zhong, G. Li, K. Tan, and L. Zhou. G-tree: an efficient index for KNN search on road networks. In CIKM, pages 39--48, 2013. Google ScholarDigital Library
- R. Zhong, G. Li, K. Tan, L. Zhou, and Z. Gong. G-tree: An efficient and scalable index for spatial search on road networks. TKDE, 27(8):2175--2189, 2015.Google ScholarDigital Library
Recommendations
Shortest Paths in Time-Dependent FIFO Networks
In this paper, we study the time-dependent shortest paths problem for two types of time-dependent FIFO networks. First, we consider networks where the availability of links, given by a set of disjoint time intervals for each link, changes over time. ...
Shortest paths in piecewise continuous time-dependent networks
We consider a shortest path problem, where the travel times on the arcs may vary with time and waiting at any node is allowed. Simple adaptations of the Dijkstra algorithm may fail to solve the problem, when discontinuities exist. We propose a new ...
Shortest Paths with Shortest Detours
This paper is concerned with a biobjective routing problem, called the shortest path with shortest detour problem, in which the length of a route is minimized as one criterion and, as second, the maximal length of a detour route if the chosen route is ...
Comments