Memory-Restricted Routing with Tiled Map Data

Modern routing algorithms reduce query time by depending heavily on preprocessed data. The recently developed Navigation Data Standard (NDS) enforces a separation between algorithms and map data, rendering preprocessing inapplicable. Furthermore, map data is partitioned into tiles with respect to their geographic coordinates. With the limited memory found in portable devices, the number of tiles loaded becomes the major factor for run time. We study routing under these restrictions and present new algorithms as well as empirical evaluations. Our results show that, on average, the most efficient algorithm presented uses more than 20 times fewer tile loads than a normal A.

[1]  Ira Sheldon Pohl,et al.  Bi-directional and heuristic search in path problems , 1969 .

[2]  Peter Sanders,et al.  In Transit to Constant Time Shortest-Path Queries in Road Networks , 2007, ALENEX.

[3]  Peter Sanders,et al.  Mobile Route Planning , 2008, ESA.

[4]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[5]  Stefan Edelkamp,et al.  Localizing A* , 2000, AAAI/IAAI.

[6]  Stefan Edelkamp.  Improving the Cache-Efficiency of Shortest Path Search , 2017, KI.

[7]  Ronald J. Gutman,et al.  Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.

[8]  Jeffrey Scott Vitter,et al.  Algorithms for parallel memory, I: Two-level memories , 2005, Algorithmica.

[9]  Andrew V. Goldberg,et al.  Computing Point-to-Point Shortest Paths from External Memory , 2005, ALENEX/ANALCO.

[10]  Andrew V. Goldberg,et al.  Customizable Route Planning in Road Networks , 2017, Transp. Sci..

[11]  Robert Geisberger,et al.  Efficient Routing in Road Networks with Turn Costs , 2011, SEA.

[12]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[13]  Andrew V. Goldberg,et al.  PHAST: Hardware-accelerated shortest path trees , 2013, J. Parallel Distributed Comput..

[14]  Rolf H. Möhring,et al.  Acceleration of Shortest Path and Constrained Shortest Path Computation , 2005, WEA.

[15]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[16]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[17]  S. VitterJ.,et al.  Algorithms for parallel memory, I , 1994 .

[18]  Peter Sanders,et al.  Minimum time-dependent travel times with contraction hierarchies , 2013, JEAL.