Fast paths in large-scale dynamic road networks
Networking and Internet Architecture
2007-06-27 v2 Data Structures and Algorithms
Abstract
Efficiently computing fast paths in large scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by several traffic information service providers who wish to offer a realistic fast path computation to GPS terminal enabled vehicles. The heuristic solution method we propose is based on a highway hierarchy-based shortest path algorithm for static large-scale networks; we maintain a static highway hierarchy and perform each query on the dynamically evaluated network.
Cite
@article{arxiv.0704.1068,
title = {Fast paths in large-scale dynamic road networks},
author = {Giacomo Nannicini and Philippe Baptiste and Gilles Barbier and Daniel Krob and Leo Liberti},
journal= {arXiv preprint arXiv:0704.1068},
year = {2007}
}
Comments
12 pages, 4 figures