Generally, when optimizing a rolling stock schedule, the locations of the depots, or places in the network where the composition changes and maintenance occurs, are assumed known. The locations where maintenance is performed naturally influence the quality of any resulting rolling stock schedules. In this paper, the problem of selecting new depot locations and their corresponding capacities is considered. A two-stage mixed integer programming approach for rolling stock scheduling with maintenance requirements is extended to account for depot selection. First, a conventional flow-based model is solved, ignoring maintenance requirements, to obtain a variety of rolling stock schedules with multiple depot locations and capacity options. Then, a maintenance feasible rolling stock schedule can be obtained by solving a series of assignment problems by using the schedules found in the first stage. The proposed methodology is tested on real-life instances, and the numerical experiments of different operational scenarios are discussed.
Keywords: Depot location and capacity; Maintenance requirements; Mixed integer programming; Rolling stock scheduling.
© 2024. The Author(s).