Article

Better landmarks within reach

Authors:

Andrew V. Goldberg,

Renato F. WerneckAuthors Info & Claims

WEA'07: Proceedings of the 6th international conference on Experimental algorithms

Pages 38 - 51

Published: 06 June 2007 Publication History

Abstract

We present significant improvements to a practical algorithm for the point-to-point shortest path problem on road networks that combines A* search, landmark-based lower bounds, and reach-based pruning. Through reach-aware landmarks, better use of cache, and improved algorithms for reach computation, we make preprocessing and queries faster while reducing the overall space requirements. On the road networks of the USA or Europe, the shortest path between two random vertices can be found in about one millisecond after one or two hours of preprocessing. The algorithm is also effective on two-dimensional grids.

References

[1]

Bast, H., Funke, S., Matijevic, D.: TRANSIT: Ultrafast shortest-path queries with linear-time preprocessing. 9th DIMACS Implementation Challenge (2006).

[2]

Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest-path queries in road networks. In: Proc. 9th ALENEX. SIAM, 2007. Available at http://www.mpi-inf.mpg.de/~bast/tmp/transit.pdf

[3]

Delling, D., Holzer, M., Muller, K., Schulz, F., Wagner, D.: High-performance multi-level graphs. In: 9th DIMACS Implementation Challenge (2006).

[4]

Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway hierarchies star. In: 9th DIMACS Implementation Challenge (2006).

[5]

Demetrescu, C., Goldberg, A.V., Johnson, D.S.: 9th DIMACS Implementation Challenge: Shortest Paths. http://www.dis.uniroma1.it/~challenge9/ (2006)

[6]

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

[7]

Fakcharoenphol, J., Rao, S.: Planar graphs, negative weight edges, shortest paths, and near linear time. In: Proc. 42nd FOCS, pp. 232-241 (2001).

Digital Library

[8]

Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: Proc. 16th SODA, pp. 156-165 (2005).

Digital Library

[9]

Goldberg, A.V., Kaplan, H., Werneck, R.F.: Better landmarks within reach. 9th DIMACS Implementation Challenge (2006).

[10]

Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. In: Proc. 8th ALENEX. SIAM (2006).

[11]

Goldberg, A.V., Werneck, R.F.: Computing Point-to-Point Shortest Paths from External Memory. In: Proc. 7th ALENEX, SIAM pp. 26-40(2005).

[12]

Gutman, R.: Reach-based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: Proc. 6th ALENEX, pp. 100-111 (2004).

[13]

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

[14]

Köhler, E., Möhring, R.H., Schilling, H.: Acceleration of shortest path and constrained shortest path computation. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 126-138. Springer, Heidelberg (2005).

Digital Library

[15]

Köhler, E., Möhring, R.H., Schilling, H.: Fast point-to-point shortest path computations with arc-flags. In: 9th DIMACS Implementation Challenge (2006).

[16]

Lauther, U.: An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In: IfGIprints 22, Institut fuer Geoinformatik, Universitaet Muenster (ISBN 3-936616-22-1), pp. 219-230 (2004).

[17]

Lauther, U.: An experimental evaluation of point-to-point shortest path calculation on roadnetworks with precalculated edge-flags. In: 9th DIMACS Implementation Challenge (2006).

[18]

Möhring, R.H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: Partitioning graphs to speed up Dijkstra's algorithm. In: Nikoletseas, S.E. (ed.) WEA (2005). LNCS, vol. 3503, pp. 189-202. Springer, Heidelberg (2005).

Digital Library

[19]

Sanders, P., Schultes, D.: Fast and Exact Shortest Path Queries Using Highway Hierarchies. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 568-579. Springer, Heidelberg (2005).

Digital Library

[20]

Sanders, P., Schultes, D.: Engineering Highway Hierarchies. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 804-816. Springer, Heidelberg (2006).

Digital Library

[21]

Sanders, P., Schultes, D.: Robust, almost constant time shortest-path queries on road networks. In: 9th DIMACS Implementation Challenge (2006).

[22]

Schultes, D.: Fast and Exact Shortest Path Queries Using Highway Hierarchies. Master's thesis, Department of Computer Science, Universität des Saarlandes, Germany (2005).

[23]

Schulz, F., Wagner, D., Weihe, K.: Using Multi-Level Graphs for Timetable Information. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 43-59. Springer, Heidelberg (2002).

Digital Library

[24]

Tarjan, R.E.: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA (1983).

Digital Library

[25]

Wagner, D., Willhalm, T.: Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 776-787. Springer, Heidelberg (2003).

Cited By

Hassan MAref WAly AÖzcan FKoutrika GMadden S(2016)Graph Indexing for Shortest-Path Finding over Dynamic Sub-GraphsProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2882933(1183-1197)Online publication date: 26-Jun-2016
https://dl.acm.org/doi/10.1145/2882903.2882933
Abboud AGrandoni FWilliams VIndyk P(2015)Subcubic equivalences between graph centrality problems, APSP and diameterProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722241(1681-1697)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722241
Sommer C(2014)Shortest-path queries in static networksACM Computing Surveys10.1145/253053146:4(1-31)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1145/2530531
Show More Cited By

Recommendations

Reach for A: efficient point-to-point shortest path algorithms
Proceedings of the Meeting on Algorithm Engineering & Expermiments

We study the point-to-point shortest path problem in a setting where preprocessing is allowed. We improve the reach-based approach of Gutman [17] in several ways. In particular, we introduce a bidirectional version of the algorithm that uses implicit ...
Optimal Path for a Car-like Robot to Reach a Given Straight Line
2018 21st International Conference on Intelligent Transportation Systems (ITSC)
This paper presents a closed form solution for the optimal path for a car to reach a given straight line with a specified direction, i.e., the shortest distance between an arbitrary pose <tex>$(x, y,\theta_{0})$</tex> and a target line (<tex>$d, \theta$</...
Building a better air defence system using genetic algorithms
KES'06: Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I

It is the aim of every country to have a good and strong defence system for the protection of its people and its assets. In this paper we have shown the application of Genetic Algorithms (GA'S) for optimizing the expected survival value of an asset ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

WEA'07: Proceedings of the 6th international conference on Experimental algorithms

June 2007

447 pages

ISBN:9783540728443

Editor:
Camil Demetrescu
Univ. Roma "La Sapienza", Facoltà di Ingegneria, Rome, Italy

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 06 June 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
8
Total Downloads

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

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hassan MAref WAly AÖzcan FKoutrika GMadden S(2016)Graph Indexing for Shortest-Path Finding over Dynamic Sub-GraphsProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2882933(1183-1197)Online publication date: 26-Jun-2016
https://dl.acm.org/doi/10.1145/2882903.2882933
Abboud AGrandoni FWilliams VIndyk P(2015)Subcubic equivalences between graph centrality problems, APSP and diameterProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722241(1681-1697)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722241
Sommer C(2014)Shortest-path queries in static networksACM Computing Surveys10.1145/253053146:4(1-31)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1145/2530531
Geisberger RSanders PSchultes DVetter C(2012)Exact Routing in Large Road Networks Using Contraction HierarchiesTransportation Science10.1287/trsc.1110.040146:3(388-404)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.1287/trsc.1110.0401
Delling DNannicini G(2012)Core Routing on Dynamic Time-Dependent Road NetworksINFORMS Journal on Computing10.1287/ijoc.1110.044824:2(187-201)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1287/ijoc.1110.0448
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
Machuca EMandow LDe La Cruz JIovanella A(2011)Heuristic multiobjective search for hazmat transportation problemsProceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence10.5555/2075561.2075590(243-252)Online publication date: 7-Nov-2011
https://dl.acm.org/doi/10.5555/2075561.2075590
He FZhang YChen JZhang L(2011)Path queries on massive graphs based on multi-granular graph partitioningProceedings of the 6th international conference on Rough sets and knowledge technology10.5555/2050461.2050543(569-578)Online publication date: 9-Oct-2011
https://dl.acm.org/doi/10.5555/2050461.2050543
Hliněný PMoriš O(2011)Scope-based route planningProceedings of the 19th European conference on Algorithms10.5555/2040572.2040622(445-456)Online publication date: 5-Sep-2011
https://dl.acm.org/doi/10.5555/2040572.2040622
Wagner D(2011)Algorithm engineering for route planningProceedings of the 22nd international conference on Algorithms and Computation10.1007/978-3-642-25591-5_1(1-5)Online publication date: 5-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25591-5_1
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten