A Mixed Integer Programming Formulation and Effective Cuts for Minimising Schedule Durations of Australian Truck Drivers

Journal of Scheduling, Forthcoming

19 Pages Posted: 9 May 2012 Last revised: 28 Jul 2012

See all articles by Asvin Goel

Asvin Goel

Kühne Logistics University

Date Written: January 11, 2012

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.

Suggested Citation

Goel, Asvin, A Mixed Integer Programming Formulation and Effective Cuts for Minimising Schedule Durations of Australian Truck Drivers (January 11, 2012). Journal of Scheduling, Forthcoming, Available at SSRN: https://ssrn.com/abstract=1852199 or http://dx.doi.org/10.2139/ssrn.1852199

Asvin Goel (Contact Author)

Kühne Logistics University ( email )

Großer Grasbrook 17
Hamburg, 20457
Germany

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
50
Abstract Views
713
PlumX Metrics