Show simple item record

dc.contributor.authorAhuja, Ravindra
dc.contributor.authorLiu, Jian
dc.contributor.authorOrlin, James
dc.contributor.authorSharma, Dushyant
dc.contributor.authorShughart, Larry
dc.date.accessioned2003-01-27T17:49:33Z
dc.date.available2003-01-27T17:49:33Z
dc.date.issued2003-01-27T17:49:33Z
dc.identifier.urihttp://hdl.handle.net/1721.1/1799
dc.description.abstractThe locomotive scheduling problem (or the locomotive assignment problem) is to assign a consist (a set of locomotives) to each train in a pre-planned train schedule so as to provide them sufficient power to pull them from their origins to their destinations. Locomotive scheduling problems are among the most important problems in railroad scheduling. In this paper, we report the results of a study of the locomotive scheduling problem faced by CSX Transportation, a major US railroad company. We consider the planning version of the locomotive scheduling model (LSM), where there are multiple types of locomotives and we need to decide the set of locomotives to be assigned to each train. We present an integrated model that determines the set of active and deadheaded locomotives for each train, light traveling locomotives from power sources to power sinks, and train-to-train connections (specifying which inbound train and outbound trains can directly connect). An important feature of our model is that we explicitly consider consist-bustings and consistency. A consist is said to be busted when the set of locomotives coming on an inbound train is broken into subsets to be reassigned to two or more outbound trains. A solution is said to be consistent over a week with respect to a train, if the train gets the same locomotive assignment each day it runs. We give a mixed integer programming (MIP) formulation of the problem that contains about 197 thousand integer variables and 67 thousand constraints. An MIP of this size cannot be solved to optimality or near-optimality in acceptable running times using commercially available software. Using problem decomposition, integer programming, and very large-scale neighborhood search, we developed a solution technique to solve this problem within 30 minutes of computation time on a Pentium III computer. When we compared our solution with the solution obtained by the software in-house developed by CSX, we obtained a savings of over 400 locomotives, which translates into savings of over one hundred million dollars annuallen
dc.format.extent383049 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesMIT Sloan School of Management Working Paper;4389-02
dc.subjectlocomotive scheduling problemen
dc.subjectCSX transportationen
dc.subjectlocomotive scheduling model (LSM)en
dc.titleSOLVING REAL-LIFE LOCOMOTIVE SCHEDULING PROBLEMSen
dc.typeWorking Paperen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record