Time-dependent contraction hierarchies

DMCA

Time-dependent contraction hierarchies (2009)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by G. Veit Batz , Daniel Delling , Peter Sanders , Christian Vetter

Venue:	IN PROC. 11TH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS (ALENEX
Citations:	23 - 10 self

BibTeX

@INPROCEEDINGS{Batz09time-dependentcontraction,
    author = {G. Veit Batz and Daniel Delling and Peter Sanders and Christian Vetter},
    title = {Time-dependent contraction hierarchies},
    booktitle = {IN PROC. 11TH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS (ALENEX},
    year = {2009},
    pages = {97--105},
    publisher = {SIAM}
}

OpenURL

Abstract

Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks with time-dependent edge weights. This is the first hierarchical speedup technique for timedependent routing that allows bidirectional query algorithms. For large realistic networks with considerable time-dependence (Germany, weekdays) our method outperforms previous techniques with respect to query time using comparable or lower preprocessing time.

Keyphrases

time-dependent contraction hierarchy first hierarchical speedup technique timedependent routing time-dependent edge weight considerable time-dependence static road network simple hierarchical routing technique previous technique large realistic network contraction hierarchy bidirectional query algorithm preprocessing time

DMCA