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