Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Bi-directional and heuristic search in path problems
Bi-directional and heuristic search in path problems
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
SHARC: Fast and robust unidirectional routing
Journal of Experimental Algorithmics (JEA)
Goal-directed shortest-path queries using precomputed cluster distances
Journal of Experimental Algorithmics (JEA)
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Robust and Online Large-Scale Optimization
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
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
Route Planning in Road Networks
Route Planning in Road Networks
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A hub-based labeling algorithm for shortest paths in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Generalized maneuvers in route planning
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
| Hi-index | 0.00 |
A new approach to the static route planning problem, based on a multi-staging concept and a scope notion, is presented. The main goal (besides implied efficiency of planning) of our approach is to address--with a solid theoretical foundation--the following two practically motivated aspects: a route comfort and a very limited storage space of a small navigation device, which both do not seem to be among the chief objectives of many other studies. We show how our novel idea can tackle both these seemingly unrelated aspects at once, and may also contribute to other established route planning approaches with which ours can be naturally combined. We provide a theoretical proof that our approach efficiently computes exact optimal routes within this concept, as well as we demonstrate with experimental results on publicly available road networks of the US the good practical performance of the solution.