Scheduling method for pairing night-shift and morning-shift duties on metro lines with complex structure

Abstract

Scheduling the night-shift and morning-shift duties pairing plan (NMDPP) is a common process in Chinese metro crew management. Since metro crews work in a special working environment, sufficient rest is essential for them. NMDPP will affect the rest time of crews on metro lines with multiple depots and handover points. To improve the rest time of crews, this paper proposes a binary programming model to optimise the NMDPP. Moreover, a hybrid algorithm combining General Variable Neighbourhood Search (GVNS) with an Assignment Algorithm is designed to find high-quality solutions for this problem. Finally, computational experiments with both artificial data and real-life data are conducted. The results indicate that the GVNS can obtain high-quality solutions efficiently for various NMDPPs. Besides, the proposed method can effectively increase the rest time of crews compared to the practical method used in metro companies.

KEYWORDS:

• Metro
• crew management
• duties pairing plan
• binary programming model
• general variable neighbourhood search

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This work was supported by the National Natural Science Foundation of China [grant number 72171174]; and China Scholarship Council.