In Transit to Constant Time Shortest-Path Queries in Road Networks

DMCA

In Transit to Constant Time Shortest-Path Queries in Road Networks

Cached

Download Links

by Holger Bast , Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes

Citations:

15 - 4 self

BibTeX

@MISC{Bast_intransit,
    author = {Holger Bast and Stefan Funke and Domagoj Matijevic and Peter Sanders and Dominik Schultes},
    title = { In Transit to Constant Time Shortest-Path Queries in Road Networks },
    year = {}
}

OpenURL

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 (6 µs to 63 µs), preprocessing time (62 min to 1200 min), and storage overhead (27 bytes/node to 247 bytes/node).

Keyphrases

road network time shortest-path query various trade-off average query time road map storage overhead algorithmic approach transit node highway hierarchy simple grid data structure united state query time quickest-path query current location table lookup small number informal observation important traffic junction

DMCA