Optimizing Location and Capacity for Multiple Types of Locomotive Maintenance Shops
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 article 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. 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, while the computational results show that the current maintenance shops are overly built and recommend that two maintenance shops should be closed and an amount of capacities should be reduced from the existing shops. A series of numerical sensitivity analyses are also conducted to draw managerial insights.
Related
- Multi-Variable Conformal Prediction: Optimizing Prediction Sets using Multiple Calibration Variables
- Information-Spectrum General Formulas for the Capacity Region of Classical-Quantum Multiple Access Channels
- Information Spectrum Methods for ε-Capacity Problems in the Theory of Mixed Multiple-Access Channels with Cost Constraint
- Capacity of a Mixed Multiple-Access Channel with Causal Observation
- Unlocking Exponential and Unbounded Robust Gains in Shannon Capacity of Classical Multiple Access Channels with Causal CSIT via Quantum Entanglement Assistance
BibTeX
@article{xie2026optimizing,
title = {{Optimizing Location and Capacity for Multiple Types of Locomotive Maintenance Shops}},
author = {Weijun Xie and Yanfeng Ouyang and Kamalesh Somani},
journal = {Computer Aided Civil and Infrastructure Engineering},
year = {2026},
month = oct,
doi = {10.1111/mice.12114},
url = {https://hal.science/hal-05783714v1},
note = {CC BY-NC-ND},
}
RIS
TY - JOUR
TI - Optimizing Location and Capacity for Multiple Types of Locomotive Maintenance Shops
AU - Weijun Xie
AU - Yanfeng Ouyang
AU - Kamalesh Somani
PY - 2026
DA - 2026/10/07
JO - Computer Aided Civil and Infrastructure Engineering
DO - 10.1111/mice.12114
UR - https://hal.science/hal-05783714v1
AB - 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 article 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. 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, while the computational results show that the current maintenance shops are overly built and recommend that two maintenance shops should be closed and an amount of capacities should be reduced from the existing shops. A series of numerical sensitivity analyses are also conducted to draw managerial insights.
ER -