Engineering Oracles for Time-Dependent Road Networks
Data Structures and Algorithms
2015-11-30 v1
Abstract
We implement and experimentally evaluate landmark-based oracles for min-cost paths in large-scale time-dependent road networks. We exploit parallelism and lossless compression, combined with a novel travel-time approximation technique, to severely reduce preprocessing space and time. We significantly improve the FLAT oracle, improving the previous query time by and doubling the Dijkstra-rank speedup. We also implement and experimentally evaluate a novel oracle (HORN), based on a landmark hierarchy, achieving even better performance wrt to FLAT.
Cite
@article{arxiv.1511.08303,
title = {Engineering Oracles for Time-Dependent Road Networks},
author = {Spyros Kontogiannis and George Michalopoulos and Georgia Papastavrou and Andreas Paraskevopoulos and Dorothea Wagner and Christos Zaroliagis},
journal= {arXiv preprint arXiv:1511.08303},
year = {2015}
}
Comments
In ALENEX 2016