Long-Haul Vehicle Routing and Scheduling with Working Hour Rules

Authors:
Marie-Eve Rancourt;Jean-François Cordeau;Gilbert Laporte
Affiliations:
Canada Research Chair in Distribution Management, Canada Research Chair in Logistics and Transportation and CIRRELT, HEC Montréal, Montréal H3T 2A7, Canada;Canada Research Chair in Logistics and Transportation and CIRRELT, HEC Montréal, Montréal H3T 2A7, Canada;Canada Research Chair in Distribution Management and CIRRELT, HEC Montréal, Montréal H3T 2A7, Canada
Venue:
Transportation Science
Year:
2013

Citing 14
Cited 0

VRP with Time Windows

The vehicle routing problem
Drive: Dynamic Routing of Independent Vehicles

Operations Research
Solving a Practical Pickup and Delivery Problem

Transportation Science
Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems

Transportation Science
A general heuristic for vehicle routing problems

Computers and Operations Research
Vehicle Scheduling and Routing with Drivers' Working Hours

Transportation Science
A Column Generation Algorithm for a Rich Vehicle-Routing Problem

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
The Canadian minimum duration truck driver scheduling problem

Computers and Operations Research
Truck Driver Scheduling in the United States

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Long-haul carriers must comply with various safety rules which are rarely taken into account in models and algorithms for vehicle routing problems. In this paper, we consider the rules on truck driver safety during long-haul trips in the United States. The problem under study has two dominant features: a routing component that consists of determining the sequence of customers visited by each vehicle and a scheduling component that consists of planning the rest periods and the service time of each customer. We have developed different scheduling algorithms embedded within a tabu search heuristic. The overall solution methods were tested on modified Solomon instances, and the computational results confirm the benefits of using a sophisticated scheduling procedure when planning long-haul transportation.