Time-dependent routing amounts to design “best” routes in a graph in which arc traversal
times may vary over the planning horizon. In the last decade, a number of technological …

We survey recent advances in algorithms for route planning in transportation networks. For
road networks, we show that one can compute driving directions in milliseconds or less even …

Algorithms for route planning in transportation networks have recently undergone a rapid
development, leading to methods that are up to three million times faster than Dijkstra's …

We study the problem of computing all Pareto-optimal journeys in a dynamic public transit
network for multiple criteria, such as arrival time and number of transfers. Existing algorithms …

During recent years, impressive speed-up techniques for Dijkstra's have been developed.
Unfortunately, the most advanced techniques use bidirectional search, which makes it hard …

We show how to route on very large public transportation networks (up to half a billion arcs)
with average query times of a few milliseconds. We take into account many realistic features …

Abstract In [1], we presented a shortest path algorithm that allows fast point-to-point queries
in graphs using preprocessed data. Here, we give an extensive revision of our method. It …

In recent years, highly effective hierarchical and goal-directed speed-up techniques for
routing in large road networks have been developed. This article makes a systematic study …

A public transportation network can often be modeled as a timetable graph where (i) each
node represents a station; and (ii) each directed edge (u, v) is associated with a timetable …

For real-world time dependent road networks (TDRNs), answering shortest path-based route
queries and plans in real-time is highly desirable by many industrial applications …