The Canadian minimum duration truck driver scheduling problem

Authors:
Asvin Goel
Affiliations:
Zaragoza Logistics Center, Spain and Applied Telematics/e-Business Group, Department of Computer Science, University of Leipzig, Germany
Venue:
Computers and Operations Research
Year:
2012

Citing 8
Cited 1

Solving a Practical Pickup and Delivery Problem

Transportation Science
Vehicle Scheduling and Routing with Drivers' Working Hours

Transportation Science
The Trip Scheduling Problem

Transportation Science
Truck Driver Scheduling in the European Union

Transportation Science
A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation

Transportation Science
European Driver Rules in Vehicle Routing with Time Windows

Transportation Science
Truck driver scheduling in Australia

Computers and Operations Research
Truck Driver Scheduling in the United States

Transportation Science

Long-Haul Vehicle Routing and Scheduling with Working Hour Rules

Transportation Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

In Canada transport companies must ensure that truck drivers can comply with Canadian Commercial Vehicle Drivers Hours of Service Regulations. Canadian regulations comprise the provisions found in US hours of service regulations as well as additional constraints on the maximum amount of driving and the minimum amount of off-duty time on each day. This paper presents a mixed integer programming formulation and an iterative dynamic programming approach for minimising the duration of truck driver schedules complying with Canadian hours of service regulations. Computational experiments show that schedule durations can be significantly reduced compared with a previously presented approach which only focuses on feasibility.