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)
Speed-up techniques for shortest-path computations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
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
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
IEEE Transactions on Intelligent Transportation Systems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Generating time dependencies in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Online computation of fastest path in time-dependent spatial networks
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Time-dependent contraction hierarchies and approximation
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
On the complexity of time-dependent shortest paths
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Multiobjective heuristic search in road maps
Expert Systems with Applications: An International Journal
An a* algorithm framework for the point-to-point time-dependent shortest path problem
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Core Routing on Dynamic Time-Dependent Road Networks
INFORMS Journal on Computing
A label correcting algorithm for the shortest path problem on a multi-modal route network
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
| Hi-index | 0.00 |
The computation of point-to-point shortest paths on time-dependent road networks has many practical applications, but there have been very few works that propose efficient algorithms for large graphs. One of the difficulties of route planning on time-dependent graphs is that we do not know the exact arrival time at the destination, hence applying bidirectional search is not straightforward; we propose a novel approach based on A with landmarks (ALT) that starts a search from both the source and the destination node, where the backward search is used to bound the set of nodes that have to be explored by the forward search. Extensive computational results show that this approach is very effective in practice if we are willing to accept a small approximation factor, resulting in a speed-up of several times with respect to Dijkstra's algorithm while finding only slightly suboptimal solutions.