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. This has large effects on predicted travel times: 17% of the analysed routes having a night rest obtain an earlier arrival time by 5 hours on average. However, the computation times of this algorithm are long. A novel heuristic version of time-dependent contraction hierarchies leads to significant reductions in computation times from several seconds to several milliseconds per route. Experiments show that the solutions are still optimal for a representative test set consisting of 10,000 route queries.
|Title of host publication||Proceedings of The Twenty-Eighth International Conference on Automated Planning and Scheduling|
|Editors||Mathijs de Weerdt, Sven Koenig, Gabriele Röger, Matthijs Spaan|
|Publisher||American Association for Artificial Intelligence (AAAI)|
|Number of pages||9|
|Publication status||Published - 2018|
|Event||28th International Conference on Automated Planning and Scheduling: KEPS 2018 - Delft, Delft, Netherlands|
Duration: 24 Jun 2018 → 29 Jun 2018
Conference number: 28
|Conference||28th International Conference on Automated Planning and Scheduling|
|Abbreviated title||ICAPS 2018|
|Period||24/06/18 → 29/06/18|
Bibliographical noteGreen Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.