Author
Listed:
- Feng Zhou
(Tongji University
Tongji University
Tongji University)
- Wenyu Wang
(Tongji University
Tongji University
Tongji University)
- Fangsheng Wang
(Tongji University
Tongji University
Tongji University)
- Ruihua Xu
(Tongji University
Tongji University
Tongji University)
Abstract
Under the increasingly prosperous nighttime economy, it is necessary to develop an operation extension strategy to optimize last train connections to improve urban rail transit service levels. A novel MILP model is proposed that aims to optimize operation extension strategy for last train timetables. Pareto's principle is adopted to deal with two goals: maximizing the social benefits and minimizing the operation costs. Given the large scale of urban rail transit (URT) networks, a hybrid "Pareto + Cplex" solution algorithm is devised. The algorithm decomposes the integrated optimization problem into two subproblems: adjusted line identification, and last train timetable optimization. To verify its performance, the proposed methodology was applied to the Beijing subway network. The ratio of successfully transferred passengers for the last trains across the thirteen lines increased from 46.33% to a maximum of 63.91%. Interestingly, the results show that the lines adjusted to achieve the optimized results went against common sense; the highest successful transfer rate of the last train in the network would be reached before all lines were considered as adjusted objects, and the operator could focus on a few crucial lines to significantly improve the last train connection effect. Consequently, the proposed optimization scheme assists operators in making informed decisions regarding the connections of last train timetables, leading to more scientific and refined management of URT networks.
Suggested Citation
Feng Zhou & Wenyu Wang & Fangsheng Wang & Ruihua Xu, 2025.
"Operation extension strategy on last train timetables in urban rail transit network: A Pareto optimality-based approach,"
Transportation, Springer, vol. 52(5), pages 2007-2026, October.
Handle:
RePEc:kap:transp:v:52:y:2025:i:5:d:10.1007_s11116-024-10483-8
DOI: 10.1007/s11116-024-10483-8
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:kap:transp:v:52:y:2025:i:5:d:10.1007_s11116-024-10483-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.