Fast paths in large-scale dynamic road networks

Simple item page
dc.creatorNannicini, Giacomo
dc.creatorBaptiste, Philippe
dc.creatorBarbier, Gilles
dc.creatorKrob, Daniel
dc.creatorLiberti, Leo
dc.date2007-04-09
dc.date2007-06-27
dc.date.accessioned2026-07-07T08:12:21Z
dc.date.available2026-07-07T08:12:21Z
dc.descriptionEfficiently 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.
dc.description12 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/0704.1068
dc.identifierhttp://arxiv.org/abs/0704.1068
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132426
dc.subjectNetworking and Internet Architecture
dc.subjectData Structures and Algorithms
dc.subjectE.1; G.2.2
dc.titleFast paths in large-scale dynamic road networks
dc.typetext

Files

Collections

arXiv