The Minimum Duration Truck Driver Scheduling Problem
| Type of publication: | Article |
| Citation: | Go12_MDTDSP |
| Journal: | EURO Journal on Transportation and Logistics |
| Volume: | 1 |
| Number: | 4 |
| Year: | 2012 |
| Pages: | 285-306 |
| DOI: | 10.1007/s13676-012-0014-9 |
| Abstract: | Truck driver scheduling problems are important subproblems of real-life vehicle routing and scheduling problems because rest periods required by government regulations have a significant impact on travel and arrival times and vehicle routes generated without considering these regulations are often practically infeasible. This paper presents a mixed integer programming formulation and a dynamic programming approach for solving a variant of the truck driver scheduling problem in which truck drivers may only rest at customer locations and at suitable parking lots. The objective of the problem is to find a truck driver schedule with minimal duration. The model presented in this paper is very flexible and can be configured to consider different sets of rules imposed by government regulations and union contracts. The effectiveness of the dynamic programming approach is demonstrated for working hour regulations in the United States and in the European Union. |
| Userfields: | Cited by (Google Scholar) |
| Keywords: | |
| Authors | |
| Added by: | [ADM] |
| Total mark: | 0 |
|
Attachments
|
|
|
|
|
Notes
|
|
|
|
|
|
Topics
|
|
|
|
|
