Retour aux résultats
Articles (2009), Transportation Science, 43 (4), pp. 417-431

The Trip Scheduling Problem

ARCHETTI Claudia , SAVELSBERGH Martin W. P.

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³) 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. Lien vers l'article

ARCHETTI, C. and SAVELSBERGH, M.W.P. (2009). The Trip Scheduling Problem. Transportation Science, 43(4), pp. 417-431.

Mots clés : #truckload-transportation, #driver, #scheduling, #hours-of-service, #dispatch-windows