View article

Efficient rolling stock schedules have always been the focus of railway companies. At the Chinese High-Speed Railway, rolling stock scheduling is usually done manually by dispatchers. Such an approach often makes it difficult to quickly obtain an optimal rolling stock schedule that can be used to operate the proposed timetable and which is also feasible with respect to the rolling stock maintenance requirements. In this paper, we consider the problem of rolling stock scheduling with maintenance requirements and propose a heuristic approach that decomposes the problem into two main stages. In the first stage, the maintenance restrictions are ignored and a conventional Mixed Integer Programming model is used to generate multiple candidate rolling stock schedules. In the second stage, we check to see whether any of the candidate rolling stock schedules are feasible when maintenance restrictions for the …