Citation metrics can be found on Google Scholar.
The Canadian Minimum Duration Truck Driver Scheduling Problem
| Type of publication: | Article |
| Citation: | Go12_CANMDTDSP |
| Journal: | Computers & Operations Research |
| Volume: | 39 |
| Number: | 10 |
| Year: | 2012 |
| Pages: | 2359-2367 |
| DOI: | 10.1016/j.cor.2011.12.016 |
| Abstract: | In Canada transport companies must ensure that truck drivers can comply with Canadian Commercial Vehicle Drivers Hours of Service Regulations. Canadian regulations comprise the provisions found in U.S. hours of service regulations as well as additional constraints on the maximum amount of driving and the minimum amount of off-duty time on each day. This paper presents a mixed integer programming formulation and an iterative dynamic programming approach for minimising the duration of truck driver schedules complying with Canadian hours of service regulations. Computational experiments show that schedule durations can be significantly reduced compared with a previously presented approach which only focusses on feasibility. |
| Userfields: | Cited by (Google Scholar) |
| Keywords: | |
| Authors | |
| Added by: | [ADM] |
| Total mark: | 0 |
|
Attachments
|
|
|
|
|
Notes
|
|
|
|
|
|
Topics
|
|
|
|
|
