Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Distributed time-dependent contraction hierarchies
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
Core Routing on Dynamic Time-Dependent Road Networks
INFORMS Journal on Computing
| Hi-index | 0.00 |
In a recent work [1], we proposed a point-to-point shortestpaths algorithm which applies bidirectional search ontime-dependent road networks. The algorithm is based on A* and runs a backward search in order to bound the setof nodes that have to be explored by the forward search. In thispaper we extend the bidirectional time-dependent search algorithmin order to allow core routing, which is a very effective techniqueintroduced for static graphs that consists in carrying out most ofthe search on a subset of the original node set. Moreover, wetackle the dynamic scenario where the piecewise lineartime-dependent arc cost functions are not fixed, but can have theircoefficients updated. We provide extensive computational results toshow that our approach is a significant speed-up with respect tothe original algorithm, and it is able to deal with the dynamicscenario requiring only a small computational effort to update thecost functions and related data structures.