Abstract
When you drive to somewhere 'far away', you will leave your current location via one of only a few 'important' traffic junctions. Starting from this informal observation, we develop an algorithmic approach-transit node routing-that allows us to reduce quickest-path queries in road networks to a small number of table lookups. We present two implementations of this idea, one based on a simple grid data structure and one based on highway hierarchies. For the road map of the United States, our best query times improve over the best previously published figures by two orders of magnitude. Our results exhibit various trade-offs between average query time (5 μs to 63 μs), preprocessing time (59 min to 1200min), and storage overhead (21 bytes/node to 244 bytes/node),.
Cite
CITATION STYLE
Bast, H., Funke, S., Matijevic, D., Sanders, P., & Schultes, D. (2007). In transit to constant time shortest-path queries in road networks. In Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics (pp. 46–59). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.1137/1.9781611972870.5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
