Engineering Route Planning Algorithms
From MaRDI portal
Recommendations
Cites work
- A note on two problems in connexion with graphs
- Algorithms – ESA 2005
- Bidirectional A ∗ Search for Time-Dependent Fast Paths
- Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
- Combining speed-up techniques for shortest-path computations
- Computing the shortest path: A^ search meets graph theory
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
- Dijkstra's algorithm on-line
- Efficient models for timetable information in public transportation systems
- Engineering Highway Hierarchies
- Engineering Label-Constrained Shortest-Path Algorithms
- Engineering multilevel overlay graphs for shortest-path queries
- Experimental and Efficient Algorithms
- Experimental and Efficient Algorithms
- Fast and Compact Oracles for Approximate Distances in Planar Graphs
- Fast Routing in Road Networks with Transit Nodes
- Geometric containers for efficient shortest-path computation
- Geometric speed-up techniques for finding shortest paths in large sparse graphs
- Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
- scientific article; zbMATH DE number 5734725 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1926659 (Why is no real title available?)
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Minimum time-dependent travel times with contraction hierarchies
- Multiple-source shortest paths in planar graphs
- Partitioning graphs to speedup Dijkstra's algorithm
- Planar graphs, negative weight edges, shortest paths, and near linear time
- SHARC, fast and robust unidirectional routing
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Single-source shortest-paths on arbitrary directed graphs in linear average-case time
- The shortest route through a network with time-dependent internodal transit times
- Time-Dependent SHARC-Routing
Cited in
(31)- Line planning with user-optimal route choice
- Shells structure in uncorrelated scale-free networks
- Vertex labeling and routing for Farey-type symmetrically-structured graphs
- Unconstrained and curvature-constrained shortest-path distances and their approximation
- Computation of the optimal value function in time-dependent networks
- Core routing on dynamic time-dependent road networks
- Efficient computation of shortest paths in time-dependent multi-modal networks
- Candidate sets for alternative routes in road networks
- User-constrained multimodal route planning
- Bidirectional A^* search on time-dependent road networks
- A survey on route planning algorithms, focusing on its touristic applications
- VC-dimension and shortest path algorithms
- Algorithm engineering for route planning: an update
- Multiple-path selection for new highway alignments using discrete algorithms
- A lower bound for the quickest path problem
- Decremental algorithm for adaptive routing incorporating traveler information
- Study on planning method of optimum route in multi-scale road network based on Dijkstra's algorithm
- GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
- Shortest-path queries in static networks
- Personalised hiking time estimation
- Optimizing Dijkstra algorithm design and accomplishment for parking routine programming based on weight caculation
- Time-dependent SHARC-routing
- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
- Efficient large-scale multi-drone delivery using transit networks
- Better Process Mapping and Sparse Quadratic Assignment
- Point-to-point shortest paths on dynamic time-dependent road networks
- Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication
- Categorification of Negative Information using Enrichment
- Optimization of heuristic search using recursive algorithm selection and reinforcement learning
- DBLnet: navigation algorithm based on dynamic Bayesian LSTM
- Path-reporting distance oracles with linear size
This page was built for publication: Engineering Route Planning Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637315)
