Truck driver scheduling in Canada

This paper presents and studies the Canadian Truck Driver Scheduling Problem (CAN‐TDSP), which is the problem of determining whether a sequence of locations can be visited within given time windows in such a way that driving and working activities of truck drivers 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. We present two heuristics and an exact approach for solving the CAN‐TDSP. Computational experiments demonstrate the effectiveness of our approaches and indicate that Canadian regulations are significantly more permissive than US hours of service regulations.