van der Tuin, Marieke (2018): Break planning with multi-label Dijkstra and time-dependent contraction hierarchies. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:508b228d-e542-40c9-95cc-1b985d86e3b2

Dataset

• Transportation and Freight Services
• Business and Management

break planning, drivers legislation, Europe, master thesis, pareto, time-dependent contraction hierarchies, trucks

4TU General Terms of Use

RefWorks, BibTeX, Reference Manager, Endnote, DataCite, NLM, DC, CFF

by Marieke van der Tuin

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.

• 2018-03-01 first online, published, posted

TU Delft

media types: application/zip, text/plain, text/x-c

• http://resolver.tudelft.nl/uuid:82a5c26e-b9ad-492a-be30-6bf6eeb4a58c

ORTEC;
TU Delft, Faculty of Civil Engineering and Geosciences, Transport & Planning Department;
TU Delft, Faculty of Electrical Engineering, Mathematics and Computer Science, Software Engineering

• Batz, G.V. (Veit)