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

DOI:10.4121/uuid:508b228d-e542-40c9-95cc-1b985d86e3b2

Datacite citation style:

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

Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite

Dataset

Usage statistics

1149

views

173

downloads

Keywords

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

Geolocation

Europe. The test used HERE map NBNL4DEGB3Eur1C09, but can also be used with other maps., Europe

Licence

4TU General Terms of Use

Export as...

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.

History

2018-03-01 first online, published, posted

Publisher

TU Delft

Format

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

References

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

Organizations

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