The shortest path problem on large-scale real-road networks

DOI10.1002/net.20131zbMath1148.90346OpenAlexW4248634500MaRDI QIDQ3418206

H. N. Post, G. A. Klunder

Publication date: 2 February 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20131

zbMATH Keywords

shortest path problemlandmarkspreprocessingbidirectional searchgraph reductionlabel settingheuristic estimatelabel correctingreal-road network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (5)

Dynamic graph generation for the shortest path problem in time expanded networks ⋮ Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps ⋮ Heuristic estimates in shortest path algorithms ⋮ A new bidirectional search algorithm with shortened postprocessing ⋮ A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

Cites Work

• Threshold assignment algorithm
• A Shortest Path Algorithm for Edge-Sparse Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The shortest path problem on large-scale real-road networks