More Web Proxy on the site http://driver.im/

research-article

Free access

Finding time-dependent shortest paths over large graphs

Authors:

Lu QinAuthors Info & Claims

EDBT '08: Proceedings of the 11th international conference on Extending database technology: Advances in database technology

Pages 205 - 216

https://doi.org/10.1145/1353343.1353371

Published: 25 March 2008 Publication History

Abstract

The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minimizes the total travel time from a place to another, over a road network, where the traffic conditions dynamically change from time to time. We study a generalized form of this problem, called the time-dependent shortest-path problem. A time-dependent graph G_T is a graph that has an edge-delay function, w_{i, j}(t), associated with each edge (v_i, v_j), to be stored in a database. The edge-delay function w_{i, j}(t) specifies how much time it takes to travel from node v_i to node v_j, if it departs from v_i at time t. A user-specified query is to ask the minimum-travel-time path, from a source node, v_s, to a destination node, v_e, over the time-dependent graph, G_T, with the best departure time to be selected from a time interval T. We denote this user query as LTT(v_s, v_e, T) over G_T. The challenge of this problem is the added complexity due to the time dependency in the time-dependent graph. That is, edge delays are not constants, and can vary from time to time. In this paper, we propose a novel algorithm to find the minimum-travel-time path with the best departure time for a LTT(v_s, v_e, T) query over a large graph G_T. Our approach outperforms existing algorithms in terms of both time complexity in theory and efficiency in practice. We will discuss the design of our algorithm, together with its correctness and complexity. We conducted extensive experimental studies over large graphs and will report our findings.

References

[1]

X. Cai, T. Kloks, and C. K. Wong. Time-varying shortest path problems with constraints. Networks, 29(3):141--150, 1997.

[2]

I. Chabini. Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transportation Research Record, 1645:170--175, 1998.

[3]

H. D. Chon, D. Agrawal, and A. E. Abbadi. Fates: Finding a time dependent shortest path. In Mobile Data Management, pages 165--180, 2003.

Digital Library

[4]

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press.

Digital Library

[5]

C. Demetrescu, S. Emiliozzi, and G. F. Italiano. Experimental analysis of dynamic all pairs shortest path algorithms. In SODA, pages 369--378, 2004.

Digital Library

[6]

C. Demetrescu and G. F. Italiano. A new approach to dynamic all pairs shortest paths. J. ACM, 51(6):968--992, 2004.

Digital Library

[7]

D. Frigioni, M. Ioffreda, U. Nanni, and G. Pasquale. Experimental analysis of dynamic algorithms for the single-source shortest-path problem. ACM Journal of Experimental Algorithms, 3:5, 1998.

Digital Library

[8]

D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic output bounded single source shortest path problem (extended abstract). In SODA, pages 212--221, 1996.

Digital Library

[9]

S. Handley, P. Langley, and F. A. Rauscher. Learning to predict the duration of an automobile trip. In KDD, pages 219--223, 1998.

[10]

Y.-W. Huang, N. Jing, and E. A. Rundensteiner. Effective graph clustering for path queries in digital map databases. In CIKM, pages 215--222, 1996.

Digital Library

[11]

B. Jiang. I/O-efficiency of shortest path algorithms: An analysis. In ICDE, pages 12--19, 1992.

Digital Library

[12]

N. Jing, Y.-W. Huang, and E. A. Rundensteiner. Hierarchical optimization of optimal path finding for transportation applications. In CIKM, pages 261--268, 1996.

Digital Library

[13]

N. Jing, Y.-W. Huang, and E. A. Rundensteiner. Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans. Knowl. Data Eng., 10(3):409--432, 1998.

Digital Library

[14]

S. Jung and S. Pramanik. Hiti graph model of topographical roadmaps in navigation systems. In ICDE, pages 76--84, 1996.

Digital Library

[15]

E. Kanoulas, Y. Du, T. Xia, and D. Zhang. Finding fastest paths on a road network with speed patterns. In ICDE, pages 10--19, 2006.

Digital Library

[16]

V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In FOCS, pages 81--91, 1999.

Digital Library

[17]

K. Nachtigall. Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research, 83:154--166, 1995.

[18]

P. Narváez, K.-Y. Siu, and H.-Y. Tzeng. New dynamic algorithms for shortest path tree computation. IEEE/ACM Trans. Netw., 8(6):734--746, 2000.

Digital Library

[19]

P. Narváez, K.-Y. Siu, and H.-Y. Tzeng. New dynamic SPT algorithm based on a ball-and-string model. IEEE/ACM Trans. Netw., 9(6):706--718, 2001.

Digital Library

[20]

A. Orda and R. Rom. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM, 37(3):607--625, 1990.

Digital Library

[21]

S. Pallottino and M. G. Scutellà. Shortest path algorithms in transportation models: classical and innovative aspects. In Equilibrium and Advanced Transportation Modelling, pages 245--281, 1998.

[22]

L. Roditty and U. Zwick. On dynamic shortest paths problems. In ESA, pages 580--591, 2004.

[23]

S. Shekhar, A. Fetterer, and B. Goyal. Materialization trade-offs in hierarchical shortest path algorithms. In SSD, pages 94--111, 1997.

Digital Library

[24]

S. Shekhar, A. Kohli, and M. Coyle. Path computation algorithms for advanced traveller information system (ATIS). In ICDE, pages 31--39, 1993.

Digital Library

[25]

S. Shekhar and D.-R. Liu. CCAM: A connectivity-clustered access method for networks and network computations. IEEE Trans. Knowl. Data Eng., 9(1):102--119, 1997.

Digital Library

[26]

K. Sung, M. G. Bell, M. Seong, and S. Park. Shortest paths in a network with time-dependent flow speeds. European Journal of Operational Research, 121(12):32--39, 2000.

[27]

M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM, 46(3):362--394, 1999.

Digital Library

[28]

S.-H. Woo and S.-B. Yang. An improved network clustering method for I/O-efficient query processing. In ACM-GIS, pages 62--68, 2000.

Digital Library

[29]

J. L. Zhao and A. Zaki. Spatial data traversal in road map databases: A graph indexing approach. In CIKM, pages 355--362, 1994.

Digital Library

Cited By

Wang XChu WZhu J(2024)Resource-Aware Time-Varying Routing For Deterministic Latency and Throughput OptimizationProceedings of the 2024 Asia Pacific Conference on Computing Technologies, Communications and Networking10.1145/3685767.3685769(7-14)Online publication date: 26-Jul-2024
https://dl.acm.org/doi/10.1145/3685767.3685769
Sui HYan HZheng THuang WZhuang YLi Y(2024)Congestion-aware Spatio-Temporal Graph Convolutional Network-based A* Search Algorithm for Fastest Route SearchACM Transactions on Knowledge Discovery from Data10.1145/365764018:7(1-19)Online publication date: 19-Jun-2024
https://dl.acm.org/doi/10.1145/3657640
Xu YLi LZhang MXu ZZhou X(2024)Global Optimal Travel Planning for Massive Travel Queries in Road NetworksIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.343940936:12(8377-8394)Online publication date: Dec-2024
https://doi.org/10.1109/TKDE.2024.3439409
Show More Cited By

Index Terms

Finding time-dependent shortest paths over large graphs

Recommendations

Shortest paths in Sierpiński graphs

In 23], Klav ar and Milutinović (1997) proved that there exist at most two different shortest paths between any two vertices in Sierpiński graphs S k n , and showed that the number of shortest paths between any fixed pair of vertices of S k n can be ...
Reconfiguration graphs of shortest paths
Abstract
For a graph G anda , b ∈ V ( G ), the shortest path reconfiguration graph of G with respect to a andb is denoted by S ( G , a , b ). The vertex set of S ( G , a , b ) is the set of all shortest paths between a andb in G. Two vertices ...
On shortest disjoint paths in planar graphs

For a graph G and a collection of vertex pairs {(s"1,t"1),...,(s"k,t"k)}, the k disjoint paths problem is to find k vertex-disjoint paths P"1,...,P"k, where P"i is a path from s"i to t"i for each i=1,...,k. In the corresponding optimization problem, the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences

EDBT '08: Proceedings of the 11th international conference on Extending database technology: Advances in database technology

March 2008

762 pages

ISBN:9781595939265

DOI:10.1145/1353343

Conference Chair:
Noureddine Mouaddib,
General Chair:
Patrick Valduriez,
Program Chairs:
Alfons Kemper
Technische Universität München, Germany
,
Mokrane Bouzeghoub,
Volker Markl,
Laurent Amsaleg,
Ioana Manolescu,
Publications Chair:
Jens Teubner

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 March 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Research Grants Council, University Grants Committee, Hong Kong

Conference

EDBT '08

EDBT '08: 11th International Conference on Extending Database Technology

March 25 - 29, 2008

Nantes, France

Acceptance Rates

Overall Acceptance Rate 7 of 10 submissions, 70%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

196
Total Citations
View Citations
2,586
Total Downloads

Downloads (Last 12 months)244
Downloads (Last 6 weeks)35

Reflects downloads up to 20 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang XChu WZhu J(2024)Resource-Aware Time-Varying Routing For Deterministic Latency and Throughput OptimizationProceedings of the 2024 Asia Pacific Conference on Computing Technologies, Communications and Networking10.1145/3685767.3685769(7-14)Online publication date: 26-Jul-2024
https://dl.acm.org/doi/10.1145/3685767.3685769
Sui HYan HZheng THuang WZhuang YLi Y(2024)Congestion-aware Spatio-Temporal Graph Convolutional Network-based A* Search Algorithm for Fastest Route SearchACM Transactions on Knowledge Discovery from Data10.1145/365764018:7(1-19)Online publication date: 19-Jun-2024
https://dl.acm.org/doi/10.1145/3657640
Xu YLi LZhang MXu ZZhou X(2024)Global Optimal Travel Planning for Massive Travel Queries in Road NetworksIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.343940936:12(8377-8394)Online publication date: Dec-2024
https://doi.org/10.1109/TKDE.2024.3439409
Zhao JLi LZhang MLuo ZZhao XZhou X(2024)A Just-In-Time Framework for Continuous Routing2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00350(4600-4613)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00350
Xu ZLi LZhang MXu YZhou X(2024)Managing the Future: Route Planning Influence Evaluation in Transportation Systems2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00347(4558-4572)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00347
Gong ZZeng YChen L(2024)Querying Shortest Path on Large Time-Dependent Road Networks with Shortcuts2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00345(4532-4544)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00345
Wang YChu JYuan YGu YJi HZhang H(2024)Label Constrained Reachability Queries on Time Dependent Graphs2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00251(3244-3256)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00251
Cui XCheng YZhang SYuan YWang G(2024)Cooperative Global Path Planning for Multiple Platforms2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00030(303-316)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00030
Erlebach TMorawietz NSpooner JWolf P(2024)A cop and robber game on edge-periodic temporal graphsJournal of Computer and System Sciences10.1016/j.jcss.2024.103534144:COnline publication date: 18-Jul-2024
https://dl.acm.org/doi/10.1016/j.jcss.2024.103534
Graf LHarks TKollias KMarkl M(2023)Prediction equilibrium for dynamic network flowsThe Journal of Machine Learning Research10.5555/3648699.364900924:1(14663-14695)Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.5555/3648699.3649009
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents