Fast paths in large-scale dynamic road networks

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
12 pages, 4 figures

Keywords

Networking and Internet Architecture, Data Structures and Algorithms, E.1; G.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/132426

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0704.1068
 http://arxiv.org/abs/0704.1068

Collections

arXiv