Citation

Zhu Z, Xu R, Wang F, Vansteenwegen P. Transportmetrica A: Transp. Sci. 2024; 20(2): e2147407.

Copyright

(Copyright © 2024, Informa - Taylor and Francis Group)

DOI

10.1080/23249935.2022.2147407

PMID

unavailable

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.

Language: en

Keywords

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