Break planning with multi-label Dijkstra and time-dependent contraction hierarchies

Mandatory breaks for truck drivers are nowadays scheduled after the route has been decided. However, in some cases it is beneficial to plan these breaks during waiting time caused by truck driving bans. Optimally planning a single break considering driving bans can be done using Dijkstra's algorithm with multiple labels (Algorithm SBG in dataset). To improve the computation times, a single-label variant (SBG-SL) as well as a novel heuristic version of multi-label and single-label time-dependent contraction hierarchies (TCH) are introduced.The algorithms are tested using a generated dataset of 10,000 start-destination pairs based on the European ETIS database of freight flows through Europe.