Fast Routing in Road Networks with Transit Nodes

DOI10.1126/SCIENCE.1137521zbMATH Open1226.90023OpenAlexW2083019227WikidataQ43913660 ScholiaQ43913660MaRDI QIDQ3101693FDOQ3101693

Authors: Stefan Funke, Peter Sanders, Dominik Schultes, 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

Recommendations

• Fast paths in large-scale dynamic road networks
• Fast routing in very large public transportation networks using transfer patterns
• Quickest path queries on transportation network
• Space-efficient, fast and exact routing in time-dependent road networks
• Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Cited In (30)

• Transit nodes -- lower bounds and refined construction
• Fixed parameter approximations for \(k\)-center problems in low highway dimension graphs
• Candidate sets for alternative routes in road networks
• Sublinear search spaces for shortest path planning in grid and road networks
• Engineering Route Planning Algorithms
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Exact distance oracles for planar graphs
• Quickest path queries on transportation network
• Real-time traffic assignment using engineered customizable contraction hierarchies
• Robust, almost constant time shortest-path queries in road networks
• Car or Public Transport—Two Worlds
• Running time analysis of ant colony optimization for shortest path problems
• True scale-invariant random spatial networks
• Fast paths in large-scale dynamic road networks
• A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
• Shortest-path queries in static networks
• Travelling on graphs with small highway dimension
• A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels
• VC-dimension and shortest path algorithms
• Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• A simple ant colony optimizer for stochastic shortest path problems
• Optimization of heuristic search using recursive algorithm selection and reinforcement learning
• Title not available (Why is that?)
• A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
• The compressed differential heuristic
• Title not available (Why is that?)
• Bidirectional \(A^*\) search on time-dependent road networks
• Boosting the exploration of huge dynamic graphs
• User-constrained multimodal route planning

This page was built for publication: Fast Routing in Road Networks with Transit Nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3101693)