Daniel Delling

Core Routing on Dynamic Time-Dependent Road Networks

  • Daniel Delling
  • Giacomo Nannicini
    • Categories Network Optimization Tags , , ,

    Route planning in large scale time-dependent road networks is an important practical application of the shortest paths problem that greatly benefits from speedup techniques. In this paper we extend a two-levels hierarchical approach for point-to-point shortest paths computations to the time-dependent case. This method, also known as core routing in the literature for static graphs, … Read more

    Bidirectional A* Search on Time-Dependent Road Networks

  • Daniel Delling
  • Leo Liberti
  • Giacomo Nannicini
  • Dominik Schultes
    • Categories Network Optimization Tags , , ,

    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: since the exact arrival … Read more