Labelling algorithms for the elementary shortest path problem with resource constraints considering EU drivers’ rules

Michael Drexl , Eric Prescott-Gagnon

Original Paper

First online: 12.06.2010

DOI: 10.1007/s12159-010-0022-9

Cite this article as: Drexl, M. & Prescott-Gagnon, E. Logist. Res. (2010) 2: 79. doi:10.1007/s12159-010-0022-9

Abstract

This paper describes how drivers’ rules according to EU social legislation can be formally modelled using the resource concept and how ‘legal’ vehicle routes and schedules can be computed by exact and heuristic labelling algorithms for solving the elementary shortest path problem with resource constraints.

Keywords

Drivers’ working hours EU social legislation Labelling algorithms Elementary shortest path problem with resource constraints