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(n^3) 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.
The trip scheduling problem
ARCHETTI, Claudia;
2009-01-01
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(n^3) 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.File | Dimensione | Formato | |
---|---|---|---|
paper.pdf
gestori archivio
Tipologia:
Full Text
Licenza:
DRM non definito
Dimensione
403.9 kB
Formato
Adobe PDF
|
403.9 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.