Article

Time-Dependent SHARC-Routing

Author:

Daniel DellingAuthors Info & Claims

ESA '08: Proceedings of the 16th annual European symposium on Algorithms

Pages 332 - 343

https://doi.org/10.1007/978-3-540-87744-8_28

Published: 15 September 2008 Publication History

Abstract

During the last years, many speed-up techniques for Dijkstra 's algorithm have been developed. As a result, computing a shortest path in a static road network is a matter of microseconds. However, only few of those techniques work in time-dependent networks. Unfortunately, such networks appear frequentely in reality: Roads are predictably congestured by traffic jams, and efficient timetable information systems rely on time-dependent networks. Hence, a fast technique for routing in such networks is needed. In this work, we present an exact time-dependent speed-up technique based on our recent SHARC-algorithm. As a result, we are able to efficiently compute shortest paths in time-dependent continental-sized transportation networks, both of roads and of railways.

References

[1]

Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269-271 (1959).

[2]

Schultes, D.: Route Planning in Road Networks. PhD thesis, Uni. Karlsruhe (2008).

[3]

Delling, D., Wagner, D.: Landmark-Based Routing in Dynamic Graphs. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 52-65. Springer, Heidelberg (2007).

[4]

Schultes, D., Sanders, P.: Dynamic Highway-Node Routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 66-79. Springer, Heidelberg (2007).

[5]

Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM J. of Exp. Al. 12, 2-4 (2007).

[6]

Cooke, K., Halsey, E.: The Shortest Route Through a Network with Time-Dependent Intermodal Transit Times. Journal of Mathematical Analysis and Applications, 493-498 (1966).

[7]

Kaufman, D.E., Smith, R.L.: Fastest Paths in Time-Dependent Networks for Intelligent Vehicle-Highway Systems Application. Journal of Intelligent Transportation Systems 1, 1-11 (1993).

[8]

Orda, A., Rom, R.: Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length. Journal of the ACM 37, 607-625 (1990).

[9]

Hart, P.E., Nilsson, N., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics 4, 100-107 (1968).

[10]

Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 156-165 (2005).

[11]

Disser, Y., Müller-Hannemann, M., Schnee, M.: Multi-Criteria Shortest Paths in Time-Dependent Train Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 347-361. Springer, Heidelberg (2008).

[12]

Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A* Search for Time-Dependent Fast Paths. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 334-346. Springer, Heidelberg (2008).

[13]

Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 13-26 (2008).

[14]

Hilger, M., Köhler, E., Möhring, R.H., Schilling, H.: Fast Point-to-Point Shortest Path Computations with Arc-Flags. In: 9th DIMACS Implementation Challenge - Shortest Paths (2006).

[15]

Dean, B.C.: Continuous-Time Dynamic Shortest Path Algorithms. Master's thesis, Massachusetts Institute of Technology (1999).

[16]

Pellegrini, F.: SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partitioning, and Parallel and Sequential Sparse Matrix Ordering Package (2007).

[17]

Goldberg, A.V., Kaplan, H., Werneck, R.F.: Better Landmarks Within Reach. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 38-51. Springer, Heidelberg (2007).

[18]

Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway Hierarchies Star. In: 9th DIMACS Implementation Challenge - Shortest Paths (2006).

Cited By

Wang YLi GTang N(2019)Querying shortest paths on time dependent road networksProceedings of the VLDB Endowment10.14778/3342263.334226512:11(1249-1261)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.14778/3342263.3342265
Yuan YLian XWang GMa YWang Y(2019)Constrained shortest path query in a large time-dependent graphProceedings of the VLDB Endowment10.14778/3339490.333949112:10(1058-1070)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.14778/3339490.3339491
Li LKim JXu JZhou X(2018)Time-dependent route scheduling on road networksSIGSPATIAL Special10.1145/3231541.323154510:1(10-14)Online publication date: 5-Jun-2018
https://dl.acm.org/doi/10.1145/3231541.3231545
Show More Cited By

Recommendations

Time-Dependent SHARC-Routing

In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microseconds. However, only few of those techniques work in time-dependent networks ...
Space-efficient SHARC-routing
SEA'10: Proceedings of the 9th international conference on Experimental Algorithms

Accelerating the computation of quickest paths in road networks has been undergoing a rapid development during the last years. The breakthrough idea for handling road networks with tens of millions of nodes was the concept of shortcuts, i.e., additional ...
Least-Latency Routing over Time-Dependent Wireless Sensor Networks

We consider the problem of least-latency end-to-end routing over adaptively duty-cycled wireless sensor networks. Such networks exhibit a time-dependent feature, where the link cost and transmission latency from one node to other nodes vary constantly ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ESA '08: Proceedings of the 16th annual European symposium on Algorithms

September 2008

841 pages

ISBN:9783540877431

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 15 September 2008

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang YLi GTang N(2019)Querying shortest paths on time dependent road networksProceedings of the VLDB Endowment10.14778/3342263.334226512:11(1249-1261)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.14778/3342263.3342265
Yuan YLian XWang GMa YWang Y(2019)Constrained shortest path query in a large time-dependent graphProceedings of the VLDB Endowment10.14778/3339490.333949112:10(1058-1070)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.14778/3339490.3339491
Li LKim JXu JZhou X(2018)Time-dependent route scheduling on road networksSIGSPATIAL Special10.1145/3231541.323154510:1(10-14)Online publication date: 5-Jun-2018
https://dl.acm.org/doi/10.1145/3231541.3231545
Gunturi VShekhar SKwangSoo Yang (2015)A Critical-Time-Point Approach to All-Departure-Time Lagrangian Shortest PathsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2015.242670127:10(2591-2603)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1109/TKDE.2015.2426701
Storandt S(2012)Route planning for bicycles — exact constrained shortest paths made practical via contraction hierarchyProceedings of the Twenty-Second International Conference on International Conference on Automated Planning and Scheduling10.5555/3038546.3038574(234-242)Online publication date: 25-Jun-2012
https://dl.acm.org/doi/10.5555/3038546.3038574
Sanders PSchultes D(2012)Engineering highway hierarchiesACM Journal of Experimental Algorithmics10.1145/2133803.233008017(1.1-1.40)Online publication date: 13-Sep-2012
https://dl.acm.org/doi/10.1145/2133803.2330080
Demiryurek UBanaei-Kashani FShahabi CRanganathan A(2011)Online computation of fastest path in time-dependent spatial networksProceedings of the 12th international conference on Advances in spatial and temporal databases10.5555/2035253.2035263(92-111)Online publication date: 24-Aug-2011
https://dl.acm.org/doi/10.5555/2035253.2035263
Meinert SWagner D(2011)Generating time dependencies in road networksProceedings of the 10th international conference on Experimental algorithms10.5555/2008623.2008662(434-446)Online publication date: 5-May-2011
https://dl.acm.org/doi/10.5555/2008623.2008662
Bast HCarlsson EEigenwillig AGeisberger RHarrelson CRaychev VViger F(2010)Fast routing in very large public transportation networks using transfer patternsProceedings of the 18th annual European conference on Algorithms: Part I10.5555/1888935.1888969(290-301)Online publication date: 6-Sep-2010
https://dl.acm.org/doi/10.5555/1888935.1888969
Demiryurek UBanaei-Kashani FShahabi CAgrawal DZhang PAbbadi AMokbel M(2010)A case for time-dependent shortest path computation in spatial networksProceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems10.1145/1869790.1869865(474-477)Online publication date: 2-Nov-2010
https://dl.acm.org/doi/10.1145/1869790.1869865
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents