Joint optimization of train timetabling and rolling stock circulation planning: A novel flexible train composition mode

• Published in: Transportation research. Part B: methodological Vol. 162; pp. 352 - 385
• Main Authors: Zhou, Housheng, Qi, Jianguo, Yang, Lixing, Shi, Jungang, Pan, Hanchuan, Gao, Yuan
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.08.2022
• Subjects: Flexible train composition mode; Rolling stock circulation plan; Train timetable; VNS algorithm; Flexible train composition mode; VNS algorithm; Train timetable; Rolling stock circulation plan
• ISSN: 0191-2615; 1879-2367
• DOI: 10.1016/j.trb.2022.06.007

The tidal traffic phenomenon is one of the most prominent problems on some metro lines, where a large number of commuters during the peak hours might cause the non-equilibrium spatial–temporal distribution of passenger flow. In order to better match the passenger demand, this study proposes a mixed-integer linear programming (MILP) model to jointly optimize the train timetable and rolling stock circulation plan, in which the flexible train composition mode is particularly taken into account by allowing rolling stocks to change their compositions through uncoupling/coupling operations at the both ends of the focused metro line. To solve the model, a customized heuristic algorithm based on the variable neighborhood search (VNS) is developed to quickly generate high-quality solutions. Based on a small example and the real-world data from Beijing metro Batong line, two sets of numerical experiments are conducted to verify the effectiveness and applicability of the proposed methodology. The computation results show that in comparison to the fixed train composition mode, the proposed approaches can bring 17.1% reduction of operation costs in morning peak periods, with no increase of passenger waiting time. •Jointly optimize train timetable and rolling stock circulation plan with flexible composition mode.•A Mixed Integer Linear Programming model is proposed.•A heuristic algorithm based on variable neighborhood search is designed.•Several numerical experiments are implemented to show the performance of the approaches.