Bidirectional A ∗ Search for Time-Dependent Fast Paths
- Cite this paper as:
- Nannicini G., Delling D., Liberti L., Schultes D. (2008) Bidirectional A ∗ Search for Time-Dependent Fast Paths. In: McGeoch C.C. (eds) Experimental Algorithms. WEA 2008. Lecture Notes in Computer Science, vol 5038. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.