Engineering and Augmenting Route Planning Algorithms

In this work, we introduce the first efficient, provably correct, algorithms for route planning in time-dependent and multi-criteria scenarios. Therefore, we follow the concept of algorithm engineering by designing, analyzing, implementing, and evaluating speed-up techniques for Dijkstra's algorithm. As a result, we are able to compute best connections in continental-sized time-dependent transportatios networks (both of roads and railways) in the matter of a few milliseconds.