A Lagrangian Method for Calculation of Passing Capacity on a Railway Hub Station

Lu Yang, Leishan Zhou, Hanxiao Zhou (), Chang Han and Wenqiang Zhao
Additional contact information
Lu Yang: School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Leishan Zhou: School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Hanxiao Zhou: School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Chang Han: School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Wenqiang Zhao: School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China

Mathematics, 2023, vol. 11, issue 6, 1-20

Abstract: This research paper proposes a Lagrangian method to address the passing capacity of the calculation problem (PCCP) for a hub station in a high-speed railway (HSR) system. The passing capacity of a hub station is critical for determining the train timetable and maximizing the number of trains that can operate on different lines. The objective of this study is to determine the maximum number of trains that can pass through, start at, or end at a hub station. To achieve this objective, a mathematical model was introduced to solve the PCCP. The model was decomposed into two parts using a Lagrangian relaxation algorithm. The first part of the model was a simple train arrival problem (TAP) that reflected the timing of trains at the hub station with simultaneous arrival and departure time constraints. The second part of the model was a train spatio-temporal routing problem (TSRP) that aimed to solve the shortest spatio-temporal path of trains with free conflict with the train’s trajectory. A real instance was provided to demonstrate the feasibility of the proposed approach and the effectiveness of the Lagrangian method. The results showed that the proposed method can efficiently solve the PCCP and maximize the passing capacity of a hub station in an HSR system.

Keywords: railway hub station; passing capacity; arrival train problem; train spatio-temporal routing problem; Lagrangian algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/6/1418/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/6/1418/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:6:p:1418-:d:1097948

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().