An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags

zbMATH Open1195.90016MaRDI QIDQ3574259FDOQ3574259

Authors: Ulrich Lauther 

Publication date: 9 July 2010

Recommendations

• Shortest path calculation in large road networks
• Engineering Highway Hierarchies
• scientific article; zbMATH DE number 5734722
• The shortest path problem on large-scale real-road networks
• Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille

zbMATH Keywords

shortest pathpreprocessingnavigation system

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cited In (6)

• Title not available (Why is that?)
• Candidate sets for alternative routes in road networks
• An exact combinatorial algorithm for minimum graph bisection
• Time-dependent SHARC-routing
• Generating node coordinates for shortest-path computations in transportation networks
• Geometric containers for efficient shortest-path computation

This page was built for publication: An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574259)