Modeling the train manning problem for a massive rapid transit line

Abstract

This study proposes a practical train manning problem (TMP) for a bi-directional massive rapid transit (MRT) line with a certain number of crew points. The TMP aims to determine a set of manning duties for each rover to man the daily train services subjected to practical constraints by minimizing the total idle time of rovers. It is crucial for the MRT operators to solve the TMP because rovers are able to handle possible train faults and/or emergencies through their fast responses. In this paper, we build a binary nonlinear and nonconvex programming model with explicit constraints for the proposed TMP, by considering three possible train manning scenarios with different idle times. Moreover, we conduct a case study of the Singapore circle line and perform necessary sensitivity analysis of various parameters involved in the TMP. Results indicate that our model can solve the TMP problem effectively and the solutions help to improve the manning duties assignment.