An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems

2016/08/29 by Asvin Goel, Stefan Irnich · 1 voice
Engineering · #Smart Parking Systems Research #Transportation and Mobility Innovations #Vehicle Routing Optimization Methods

paper · doi:10.1287/trsc.2016.0678

openalex publication_date 2016/08/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31

Abstract

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.

Citations

• Truck Driver Scheduling in the United States
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Hours of Service Regulations in Road Freight Transport: An Optimization-Based International Assessment

Discussions

• You might benefit from the mini break planning review I did for myself a few years ago. Asvin Goel has done a lot of work in this area. For your setting, I think particularly Goel and Kok (2011) , Goe [stackexchange, 0 points]