A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Fast priority queues for cached memory
Journal of Experimental Algorithmics (JEA)
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Algorithms and Data Structures: The Basic Toolbox
Algorithms and Data Structures: The Basic Toolbox
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
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
A hub-based labeling algorithm for shortest paths in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
PHAST: Hardware-Accelerated Shortest Path Trees
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Efficient data management in support of shortest-path computation
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Hierarchical hub labelings for shortest paths
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Crowdsourcing computing resources for shortest-path computation
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Towards a Flexible and Scalable Fleet Management Service
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Towards a Flexible and Scalable Fleet Management Service
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Hi-index | 0.00 |
Many acceleration techniques exist for the single-pair shortest path problem on road networks. Most of them have been significantly improved over the years to achieve faster preprocessing times and superior performance. In this spirit, our current work significantly improves the classic ALT (A* + Landmarks + Triangle equality) algorithm. By carefully optimizing both preprocessing and query phases, we managed to effectively minimize preprocessing time to a few seconds, making the ALT algorithm also suitable for dynamic scenarios, i.e., road networks with changing edge weights due to traffic updates. We also accelerated the query phase for both unidirectional and bidirectional versions of the ALT algorithm, providing fast enough query times (including full-path unpacking) suitable for real-time services and continental road networks.