Premium
Bidirectional A * search on time‐dependent road networks
Author(s) -
Nannicini Giacomo,
Delling Daniel,
Schultes Dominik,
Liberti Leo
Publication year - 2012
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20438
Subject(s) - dijkstra's algorithm , computer science , computation , set (abstract data type) , shortest path problem , point (geometry) , node (physics) , mathematical optimization , bidirectional search , algorithm , search algorithm , theoretical computer science , mathematics , incremental heuristic search , beam search , graph , geometry , structural engineering , engineering , programming language
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