| Article ID: | iaor20118725 |
| Volume: | 39 |
| Issue: | 5 |
| Start Page Number: | 1122 |
| End Page Number: | 1132 |
| Publication Date: | May 2012 |
| Journal: | Computers and Operations Research |
| Authors: | Savelsbergh Martin, Archetti Claudia, Goel Asvin |
| Keywords: | vehicle routing & scheduling, combinatorial optimization |
In September 2008 new regulations for managing heavy vehicle driver fatigue entered into force in Australia. According to the new regulations there is a chain of responsibility ranging from drivers to dispatchers and shippers and thus, carriers must explicitly consider driving and working hour regulations when generating truck driver schedules. This paper presents and studies the Australian Truck Driver Scheduling Problem (AUS‐TDSP) which is the problem of determining whether a sequence of locations can be visited within given time windows in such a way that driving and working activities of truck drivers comply with Australian Heavy Vehicle Driver Fatigue Law.