2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/132426Efficiently 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 figuresNetworking and Internet ArchitectureData Structures and AlgorithmsE.1; G.2.2text