Author
Listed:
- Zhan, Yuchao
- Zhang, Xiaoqiang
- Ye, Mao
Abstract
Flexible composition and additional train insertion play distinct yet complementary roles in addressing demand imbalances in urban rail transit; however, integrating them into a unified scheduling framework remains challenging due to the combinatorial complexity of coordinating dynamic capacity allocation with fixed infrastructure. This study focuses on the integrated scheduling of in-service and additional trains with flexible composition in extended-length metro corridors, aiming to efficiently match time-varying demand across multiple periods. Leveraging extended station functionalities, we construct a modular Space-Time-State network and develop a lightweight Mixed-Integer Nonlinear Programming (MINLP) model to simultaneously optimize the train service route, composition plan, timetable and rolling stock scheduling to minimize passenger waiting and train operation costs. The model coordinates train composition transitions for dynamic passenger demand matching, while enforcing constraints on rolling stock, depot capacities and turnaround operations. Additionally, linearization techniques convert the MINLP model into an equivalent mixed-integer linear programming model for exact solutions. For large-scale instances, we further propose a customized heuristic search framework based on a Parallel Time-Dependent Shortest Path Algorithm to sequentially search train operation plans within feasible time-composition windows. To mitigate myopic decision-making where local optima dominate individual train planning, we embed three penalty terms with Bayesian optimized weights. Experimental results demonstrate that our algorithm efficiently handles real-world cases involving 132 trains, outperforming Gurobi and the variable-type-based decomposition algorithm. Compared to the original plan from Nanjing Metro, our solution achieves up to 63.64% reduction in combined passenger waiting and operation costs while requiring 72 fewer operational rolling stock units.
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:212:y:2026:i:c:s136655452600298x. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.