Algorithm Engineering for Route Planning in Realistic Scenarios Dorothea Wagner, Karlsruhe Institute of Technology (KIT) Nowadays, route planning systems belong to the most frequently used information systems. The algorithmic core problem of such systems, i.e., the fast computation of shortest paths is a classical problem that can be solved by Dijkstra's shortest paths algorithm. However, 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 algorithm. In particular, computing shortest paths in huge networks has become a showpiece of Algorithm Engineering demonstrating the engineering cycle that consists of design, analysis, implementation and experimental evaluation of practicable algorithms. We will provide a condensed overview of the techniques enabling this development. The main part of the talk will focus on variants of the problem that occur in more realistic traffic scenarios.