Shortest paths in Euclidean graphs
Algorithmica
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Speeding Up Dynamic Shortest-Path Algorithms
INFORMS Journal on Computing
SHARC: Fast and robust unidirectional routing
Journal of Experimental Algorithmics (JEA)
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Fast paths in large-scale dynamic road networks
Computational Optimization and Applications
Landmark-based routing in dynamic graphs
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
Bidirectional A* search for time-dependent fast paths
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Algorithmica - Special Issue: European Symposium on Algorithms
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
IEEE Transactions on Intelligent Transportation Systems
Algorithm engineering for route planning: an update
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On an exact method for the constrained shortest path problem
Computers and Operations Research
Hi-index | 0.00 |
The computation of point-to-point shortest paths on time-dependent road networks has a large practical interest, but very few works propose efficient algorithms for this problem. We propose a novel approach, which tackles one of the main complications of route planning in time-dependent graphs, which is the difficulty of using bidirectional search: because the exact arrival time at the destination is unknown, we start a backward search from the destination node using lower bounds on arc costs to restrict the set of nodes that have to be explored by the forward search. Our algorithm is based on A* with landmarks (ALT); extensive computational results show that it is very effective in practice if we are willing to accept a small approximation factor, resulting in a speed-up of more than one order of magnitude with respect to Dijkstra's algorithm while finding only slightly suboptimal solutions. The main idea presented here can also be generalized to other types of search algorithms. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.