Time-dependent routing with contraction hierarchies

In this master’s thesis, research on finding the time-dependent shortest path in combination with the contraction hierarchies algorithm is conducted. A new method of finding time intervals for the time-dependent sampling heuristic, the interval selection method, is developed. Experiments with different numbers of time intervals and ways of selecting time intervals are conducted. The interval selection method shows promising results on preprocessing times, query times and performance.