Engineering Route Planning Algorithms

Authors:
Daniel Delling;Peter Sanders;Dominik Schultes;Dorothea Wagner
Affiliations:
Universität Karlsruhe (TH), Karlsruhe, Germany 76128;Universität Karlsruhe (TH), Karlsruhe, Germany 76128;Universität Karlsruhe (TH), Karlsruhe, Germany 76128;Universität Karlsruhe (TH), Karlsruhe, Germany 76128
Venue:
Algorithmics of Large and Complex Networks
Year:
2009

Citing 36
Cited 48

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Single-source shortest-paths on arbitrary directed graphs in linear average-case time

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Dijkstra's algorithm on-line: an empirical case study from public railroad transport

Journal of Experimental Algorithmics (JEA)
Using Multi-level Graphs for Timetable Information in Railway Systems

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Integer priority queues with decrease key in constant time and the single source shortest paths problem

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Multiple-source shortest paths in planar graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric containers for efficient shortest-path computation

Journal of Experimental Algorithmics (JEA)
Planar graphs, negative weight edges, shortest paths, and near linear time

Journal of Computer and System Sciences - Special issue on FOCS 2001
Combining speed-up techniques for shortest-path computations

Journal of Experimental Algorithmics (JEA)
Partitioning graphs to speedup Dijkstra's algorithm

Journal of Experimental Algorithmics (JEA)
Efficient models for timetable information in public transportation systems

Journal of Experimental Algorithmics (JEA)
Engineering highway hierarchies

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering multilevel overlay graphs for shortest-path queries

Journal of Experimental Algorithmics (JEA)
Engineering Label-Constrained Shortest-Path Algorithms

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Time-Dependent SHARC-Routing

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Mobile Route Planning

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
SHARC: Fast and robust unidirectional routing

Journal of Experimental Algorithmics (JEA)
Engineering fast route planning algorithms

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Better landmarks within reach

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Landmark-based routing in dynamic graphs

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Dynamic highway-node routing

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Fast and compact oracles for approximate distances in planar graphs

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Bidirectional A* search for time-dependent fast paths

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Multi-criteria shortest paths in time-dependent train networks

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Timetable information: models and algorithms

ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Finding all attractive train connections by multi-criteria Pareto search

ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Goal directed shortest path queries using precomputed cluster distances

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Highway hierarchies hasten exact shortest path queries

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Acceleration of shortest path and constrained shortest path computation

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Partitioning graphs to speed up dijkstra's algorithm

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

SHARC: Fast and robust unidirectional routing

Journal of Experimental Algorithmics (JEA)
Synthetic road networks

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
n-level graph partitioning

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Fast routing in very large public transportation networks using transfer patterns

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
Optimization of heuristic search using recursive algorithm selection and reinforcement learning

Annals of Mathematics and Artificial Intelligence
Dynamic arc-flags in road networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Efficient routing in road networks with turn costs

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Hierarchy decomposition for faster user equilibria on road networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Customizable route planning

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Generating time dependencies in road networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
VC-dimension and shortest path algorithms

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Scope-based route planning

ESA'11 Proceedings of the 19th European conference on Algorithms
Real-time routing with OpenStreetMap data

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Alternative routes in road networks

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Space-efficient SHARC-routing

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Contraction of timetable networks with realistic transfers

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Distributed time-dependent contraction hierarchies

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Time-dependent contraction hierarchies and approximation

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Route planning with flexible edge restrictions

Journal of Experimental Algorithmics (JEA)
Shortest path and distance queries on road networks: an experimental evaluation

Proceedings of the VLDB Endowment
Recommending routes in the context of bicycling: algorithms, evaluation, and the value of personalization

Proceedings of the ACM 2012 conference on Computer Supported Cooperative Work
Preprocessing speed-up techniques is hard

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Generalized maneuvers in route planning

MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Algorithm engineering for route planning: an update

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A highway-centric labeling approach for answering distance queries on large sparse graphs

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Shortest-path queries for complex networks: exploiting low tree-width outside the core

Proceedings of the 15th International Conference on Extending Database Technology
Core Routing on Dynamic Time-Dependent Road Networks

INFORMS Journal on Computing
Bidirectional A* search on time-dependent road networks

Networks
Engineering highway hierarchies

Journal of Experimental Algorithmics (JEA)
Parallel computation of best connections in public transportation networks

Journal of Experimental Algorithmics (JEA)
Exact Routing in Large Road Networks Using Contraction Hierarchies

Transportation Science
Fully dynamic maintenance of arc-flags in road networks

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
A label correcting algorithm for the shortest path problem on a multi-modal route network

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Hierarchical hub labelings for shortest paths

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
HLDB: location-based services in databases

Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Energy-efficient air-indices for distance queries on road networks

Proceedings of the 20th International Conference on Advances in Geographic Information Systems
An evaluation of multiobjective urban tourist route planning with mobile devices

UCAmI'12 Proceedings of the 6th international conference on Ubiquitous Computing and Ambient Intelligence
Noah: a dynamic ridesharing system

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Shortest path and distance queries on road networks: towards bridging theory and practice

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Efficient single-source shortest path and distance queries on large graphs

Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment

Journal of Intelligent and Robotic Systems
Energy-optimal routes for electric vehicles

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Customizable point-of-interest queries in road networks

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Algorithms for hub label optimization

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Shortest-path queries in static networks

ACM Computing Surveys (CSUR)
Optimizing Landmark-Based Routing and Preprocessing

Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra's algorithm. We give an overview of the techniques enabling this development and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-dependent routing, and flexible objective functions.