Fast Routing in Road Networks with Transit Nodes
From MaRDI portal
Publication:3101693
DOI10.1126/science.1137521zbMath1226.90023OpenAlexW2083019227WikidataQ43913660 ScholiaQ43913660MaRDI QIDQ3101693
Dominik Schultes, Stefan Funke, Peter Sanders, Holger Bast
Publication date: 30 November 2011
Published in: Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1126/science.1137521
Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Related Items (23)
A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels ⋮ Bidirectional A* search on time-dependent road networks ⋮ A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs ⋮ Bidirectional A ∗ Search for Time-Dependent Fast Paths ⋮ Running time analysis of ant colony optimization for shortest path problems ⋮ A simple ant colony optimizer for stochastic shortest path problems ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Optimization of heuristic search using recursive algorithm selection and reinforcement learning ⋮ Boosting the Exploration of Huge Dynamic Graphs ⋮ The compressed differential heuristic ⋮ Sublinear search spaces for shortest path planning in grid and road networks ⋮ VC-Dimension and Shortest Path Algorithms ⋮ True scale-invariant random spatial networks ⋮ Shortest-path queries in static networks ⋮ Travelling on graphs with small highway dimension ⋮ Engineering Route Planning Algorithms ⋮ Candidate Sets for Alternative Routes in Road Networks ⋮ User-Constrained Multimodal Route Planning ⋮ Car or Public Transport—Two Worlds ⋮ Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies ⋮ Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks ⋮ Unnamed Item
This page was built for publication: Fast Routing in Road Networks with Transit Nodes