| Article ID: | iaor20171669 |
| Volume: | 51 |
| Issue: | 2 |
| Start Page Number: | 737 |
| End Page Number: | 754 |
| Publication Date: | May 2017 |
| Journal: | Transportation Science |
| Authors: | Irnich Stefan, Goel Asvin |
| Keywords: | personnel & manpower planning, combinatorial optimization, heuristics, government, law & law enforcement |
In most developed countries working hours of truck drivers are constrained by hours of service regulations. When optimizing vehicle routes, trucking companies must consider these constraints to assure that drivers can comply with the regulations. This paper studies the combined vehicle routing and truck driver scheduling problem (VRTDSP), which generalizes the well‐known vehicle routing problem with time windows by considering working hour constraints. A branch‐and‐price algorithm for solving the VRTDSP is presented. This is the first algorithm that solves the VRTDSP to proven optimality.