The Trip Scheduling Problem

Authors:
Claudia Archetti;Martin Savelsbergh
Affiliations:
Department of Quantitative Methods, University of Brescia, 25122 Brescia, Italy;H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
Venue:
Transportation Science
Year:
2009

Citing 5
Cited 6

Implementing Real-Time Optimization Models: A Case Application From The Motor Carrier Industry

Operations Research
Solving a Practical Pickup and Delivery Problem

Transportation Science
Rendezvous Search on the Labeled Line

Operations Research
Real-Time Multivehicle Truckload Pickup and Delivery Problems

Transportation Science
Efficient feasibility testing for dial-a-ride problems

Operations Research Letters

Truck Driver Scheduling in the European Union

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
Long-Haul Vehicle Routing and Scheduling with Working Hour Rules

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The hours of service (HOS) regulations of the department of transportation severely restrict the set of feasible driver schedules. So much so that establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can feasibly be executed by a driver is no longer a matter of simple forward simulation. We consider this problem and prove that the feasibility of a driver schedule can be checked in polynomial time by providing an O(n3) algorithm for establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can be executed by a driver.