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.
https://doi.org/10.1002/net.20438Cite as:
@article{Nannicini_2011,
doi = {10.1002/net.20438},
url = {https://doi.org/10.1002%2Fnet.20438},
year = 2011,
month = {may},
publisher = {Wiley},
volume = {59},
number = {2},
pages = {240--251},
author = {Giacomo Nannicini and Daniel Delling and Dominik Schultes and Leo Liberti},
title = {Bidirectional A{ast} search on time-dependent road networks},
journal = {Networks}
}