pith. sign in

arxiv: 1709.04324 · v1 · pith:FZO762VAnew · submitted 2017-09-13 · 🧮 math.OC

A short-term planning model for high-speed train assignment and maintenance scheduling

classification 🧮 math.OC
keywords maintenancehigh-speedmodelschedulingstatetrainassignmentcapacity
0
0 comments X
read the original abstract

This paper considers the simultaneous high-speed train assignment and maintenance scheduling problem. For the maintenance scheduling module, our focus is the second-level maintenance, which is carried out once a month on average. We propose a binary non-linear programming model to mathematically describe the problem. The objective aims to minimize the mileage losses for all high-speed trains and the constraints cover various operational requirements and capacity restrictions. To model the difficult operational requirements, a novel cumulative mileage update function is developed; meanwhile, to describe the depot maintenance capacity restriction, we employ a state function that is able to identify whether a train is in the maintenance state or in the operation state.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.