Engineering Route Planning Algorithms
From MaRDI portal
Publication:3637315
DOI10.1007/978-3-642-02094-0_7zbMath1248.90017WikidataQ55924035 ScholiaQ55924035MaRDI QIDQ3637315
Peter Sanders, Dorothea Wagner, Daniel Delling, Dominik Schultes
Publication date: 9 July 2009
Published in: Algorithmics of Large and Complex Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02094-0_7
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90B10: Deterministic network models in operations research
Related Items
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks, Time-dependent SHARC-routing, Point-to-point shortest paths on dynamic time-dependent road networks, Optimization of heuristic search using recursive algorithm selection and reinforcement learning, Bidirectional A* search on time-dependent road networks, VC-Dimension and Shortest Path Algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Planar graphs, negative weight edges, shortest paths, and near linear time
- The shortest route through a network with time-dependent internodal transit times
- Fast Routing in Road Networks with Transit Nodes
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
- Bidirectional A ∗ Search for Time-Dependent Fast Paths
- Combining speed-up techniques for shortest-path computations
- Partitioning graphs to speedup Dijkstra's algorithm
- Efficient models for timetable information in public transportation systems
- Engineering Label-Constrained Shortest-Path Algorithms
- Fast and Compact Oracles for Approximate Distances in Planar Graphs
- Time-Dependent SHARC-Routing
- Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
- Minimum time-dependent travel times with contraction hierarchies
- Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
- Engineering multilevel overlay graphs for shortest-path queries
- SHARC
- Engineering Highway Hierarchies
- Dijkstra's algorithm on-line
- Algorithms – ESA 2005
- Experimental and Efficient Algorithms
- Experimental and Efficient Algorithms
- Geometric containers for efficient shortest-path computation
- Algorithms - ESA 2003
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
