Dear guest, welcome to this publication database. As an anonymous user, you will probably not have edit rights. Also, the collapse status of the topic tree will not be persistent. If you like to have these and other options enabled, you might ask Admin for a login account.
This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies.
 [BibTeX] [RIS]
A mixed integer programming formulation and effective cuts for minimising schedule durations of Australian truck drivers
Type of publication: Article
Citation: Go12_AUSMDTDSP
Journal: Journal of Scheduling
Volume: 15
Number: 6
Year: 2012
Pages: 733-741
DOI: 10.1007/s10951-012-0282-0
Abstract: Transport companies seek to maximise vehicle utilisation and minimise labour costs. Both goals can be achieved if the time required to fulfil a sequence of transportation tasks is minimised. However, if schedule durations are too short drivers may not have enough time for recuperation and road safety is impaired. In Australia transport companies must ensure that truck drivers can comply with Australian Heavy Vehicle Driver Fatigue Law and schedules must give enough time for drivers to take the amount of rest required by the regulation. This paper shows how transport companies can minimise the duration of truck driver schedules without violating Australian Heavy Vehicle Driver Fatigue Law. A mixed integer programming formulation is presented and effective cuts are given which provide significant reduction in computational effort.
Keywords:
Authors Goel, A.
Added by: [ADM]
Total mark: 0
Attachments
  • Go12_AUSMDTDSP.pdf
       (Preprint)
Notes
    Topics