Yuan, Y. orcid.org/0000-0002-9933-3926, Li, S., Liu, R. orcid.org/0000-0003-0627-3184 et al. (2 more authors) (2023) Decomposition and approximate dynamic programming approach to optimization of train timetable and skip-stop plan for metro networks. Transportation Research Part C: Emerging Technologies, 157. 104393. ISSN 0968-090X
Abstract
Carefully coordinating train timetables of different operating lines can help reduce transfer delays, which in turn reduces station crowding and improves overall service quality. This paper explores the optimization to train timetable and skip-stop plans that aims to minimize the total passenger waiting time and station crowding. The problem is formulated as a mixed-integer non-linear programming model. To effectively address the complexity of the model, a decomposition and approximate dynamic programming approach is designed to convert the original network-level problem into a series of small-scale subproblems, one for each operating line, to be solved quickly in a distributed manner. The effectiveness and practicability of the model and algorithm are demonstrated on two case networks: a small-scale synthetic network of three metro lines and a real-world network based on Beijing metro. The computational results illustrate that the proposed strategy to generate train timetables and skip-stop plans can effectively reduce passenger waiting time and station crowing. The proposed decomposition and approximate dynamic programming approach is also shown to perform more efficiently than traditional heuristic algorithms, such as genetic algorithm and simulated annealing algorithm for large-scale networks.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2023, Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/. This is an author produced version of an article published in Transportation Research Part C: Emerging Technologies. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Urban metro networks, Timetable optimization, Transfer coordination, Skip-stop pattern, Approximate dynamic programming |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Environment (Leeds) > Institute for Transport Studies (Leeds) > ITS: Spatial Modelling and Dynamics (Leeds) |
Funding Information: | Funder Grant number Rail Safety & Standards Board Not Known |
Depositing User: | Symplectic Publications |
Date Deposited: | 15 Nov 2023 15:38 |
Last Modified: | 25 Oct 2024 00:13 |
Published Version: | https://www.sciencedirect.com/science/article/pii/... |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.trc.2023.104393 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:205332 |