Engineering Route Planning Algorithms

By Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner. Algorithmics of Large and Complex Networks, 2009

540 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Real-time routing with OpenStreetMap data (2011, background): “We refer the interested reader to [2] for an overview of the the research on route planning algorithms.”
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks (2011, methodology): “Note that the (scaled) data for CH, CHASE, and TNR is taken from [12].”
Route Planning in Transportation Networks (2015, background): “[94] has appeared fairly recently, it has become outdated due to significant developments in the last half-decade.”
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment (2017, methodology): “When a network representation of the map is available, standard techniques for efficiently computing shortest paths can be used [1].”
Exact Routing in Large Road Networks Using Contraction Hierarchies (2012, methodology): “To accelerate the path unpacking, we reﬁne the approach of Delling et al. (2009) to store explicit descriptions of the paths underlying the external shortcuts.”
A Review of Motion Planning for Highway Autonomous Driving (2020, background): “This function is outside the scope of this paper; see [30] for a related review.”