Planning Location and Capacity for Multiple Types of Locomotive Maintenance Shops

Weijun Xie, Yanfeng Ouyang, Kamalesh SomaniTransportation 2014

Abstract

Thousands of locomotives run in the North America railroad network and each of them must receive periodic maintenance service; meanwhile, the locomotives may break down during shipment operations and demand repair. Maintenance shops are characterized by the types of locomotives they can handle and the level of service they can provide. This paper formulates a mixed-integer program model to optimize location and capacity of locomotive maintenance shops. The objective is to minimize the sum of the costs for building new (or shutting down existing) maintenance shops, the costs for capacity expansion (or reduction), and the costs for shipping broken locomotives to a suitable shop. The authors develop a multi-graph representation of the railroad network so that the cost for moving broken locomotives via various means can be computed by a standard shortest path algorithm. A Lagrangian relaxation based heuristic algorithm is proposed to solve the shop location and capacity planning problem. The model and solution techniques are applied to a full-scale real-world case study; numerical sensitivity analyses are also conducted to draw managerial insights. The proposed modeling framework has been adopted by a Class-1 railroad company and has helped achieve multiple million dollars of savings in a recent year.
BibTeX
@inproceedings{xie2014planning,
  author = {Weijun Xie and Yanfeng Ouyang and Kamalesh Somani},
  title = {{Planning Location and Capacity for Multiple Types of Locomotive Maintenance Shops}},
  booktitle = {Transportation},
  year = {2014},
}

Loading related content...

Figure