Production of locomotive rosters for a multi-class multi-locomotive problem

D H Noble (), M Al-Amin and R G J Mills
Additional contact information
D H Noble: Staffordshire University
M Al-Amin: Swinburne University of Technology
R G J Mills: CSIRO Mathematical and Information Sciences, Glen Osmond

Journal of the Operational Research Society, 2001, vol. 52, issue 11, 1191-1200

Abstract: Abstract This paper describes a problem faced by the Public Transport Corporation (PTC) in the Australian State of Victoria. It involved the allocation of locomotives to the freight trains operated by the Corporation. Such a problem can be classified as a multi-class multi-locomotive problem since different types (or classes) of locomotive are available to pull the trains and some of the trains are heavy enough to require more than one locomotive. Because of the features of the services operated by the PTC, formulation of this problem as a pure integer program is straightforward, provided the objective function can be linearised. However, obtaining the optimal solution from this formulation is not. Large optimality gaps remained after various attempts to tighten the problem. Other authors have reported similar difficulties with similar problems. The original problem was therefore reformulated using special ordered covering sets of type 1. After reformulation, the optimal solution was obtained in less than a second of CPU time. This enabled alternative methods of linearising the objective function to be evaluated, resulting eventually in the decision to extend the concept of minimal covering sets so that each integer variable in the problem was expressed as a linear sum of a special ordered covering set of binary variables. In this way, the objective function was both exact and linear and the model, although much larger, still solved in under a second of CPU time. The methods of solution proposed in this paper should be capable of extension to more general resource allocation problems exhibiting similar features.

Keywords: rail transport; integer programming; resource allocation (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601210 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:52:y:2001:i:11:d:10.1057_palgrave.jors.2601210

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601210

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().