Dijkstra's algorithm on-line: an empirical case study from public railroad transport
Journal of Experimental Algorithmics (JEA)
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
The Shortcut Problem --- Complexity and Approximation
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
SHARC: Fast and robust unidirectional routing
Journal of Experimental Algorithmics (JEA)
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Fast paths in large-scale dynamic road networks
Computational Optimization and Applications
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Bidirectional A* search for time-dependent fast paths
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Fast routing in very large public transportation networks using transfer patterns
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Graph indexing of road networks for shortest path queries with label restrictions
Proceedings of the VLDB Endowment
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Alternative route graphs in road networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Dynamic arc-flags in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Efficient routing in road networks with turn costs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
A hub-based labeling algorithm for shortest paths in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
ESA'11 Proceedings of the 19th European conference on Algorithms
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Route planning with flexible edge restrictions
Journal of Experimental Algorithmics (JEA)
Preprocessing speed-up techniques is hard
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Core Routing on Dynamic Time-Dependent Road Networks
INFORMS Journal on Computing
Engineering highway hierarchies
Journal of Experimental Algorithmics (JEA)
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
Fully dynamic maintenance of arc-flags in road networks
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Efficient computation of the shapley value for game-theoretic network centrality
Journal of Artificial Intelligence Research
A group based approach for path queries in road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
CrowdRoute: a crowd-sourced routing algorithm in public transit networks
Proceedings of the Second ACM SIGSPATIAL International Workshop on Crowdsourced and Volunteered Geographic Information
| Hi-index | 0.00 |
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in present-day navigation systems: When an edge weight changes (e.g., due to a traffic jam), we can update the preprocessed information in 2-40ms allowing subsequent fast queries in about one millisecond on average. When we want to perform only a single query, we can skip the comparatively expensive update step and directly perform a prudent query that automatically takes the changed situation into account. If the overall cost function changes (e.g., due to a different vehicle type), recomputing the preprocessed information takes typically less than two minutes. The foundation of our dynamic method is a new static approach that generalises and combines several previous speedup techniques. It has outstandingly low memory requirements of only a few bytes per node.