Citation metrics can be found on Google Scholar.

 [BibTeX] [RIS]
Truck Driver Scheduling in the United States
Type of publication: Article
Citation: GK12_USTDSP
Journal: Transportation Science
Volume: 46
Number: 3
Year: 2012
Pages: 317-326
DOI: 10.1287/trsc.1110.0382
Abstract: The U.S. Truck Driver Scheduling Problem (US-TDSP) is the problem of visiting a sequence of n locations within given time windows in such a way that driving and working activities of truck drivers comply with U.S. hours of service regulations. In the case of single time windows it is known that the US-TDSP can be solved in O(n^3) time. In this paper we present a scheduling method for the US-TDSP which solves the single time window problem in O(n^2) time. We show that in the case of multiple time windows the same complexity can be achieved if the gap between subsequent time windows is at least 10 hours. This situation occurs, for example, if, because of opening hours of docks, handling operations can only be performed between 8.00 AM and 10.00 PM. Furthermore, we empirically show that for a wide range of other problem instances the computational effort is not much higher if multiple time windows are considered.
Userfields: Cited by (Google Scholar)
Goel, A.
Kok, L.
Added by: [ADM]
Total mark: 0

  • GK12_USTDSP.pdf