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

MaRDI QIDQ3574259zbMATH OpenFDO

Authors Ulrich Lauther

Publication date 9 July 2010

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)

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

Cited in

(6)

• scientific article; zbMATH DE number 5734722 (Why is no real title available?)
• 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)