2007/04/09 by Nannicini, Giacomo, Baptiste, Philippe, Barbier, Gilles +2
#Data Structures and Algorithms (cs.DS) #E.1 #FOS: Computer and information sciences #G.2.2 #Networking and Internet Architecture (cs.NI)
paper · doi:10.48550/arxiv.0704.1068
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.