Optimizing Train Routing Problem in a Multistation High-Speed Railway Hub by a Lagrangian Relaxation Approach
As the intersection of multiple high-speed railway lines, the multi-station high-speed railway hub is the key to improve the transport efficiency of the high-speed railway network. This paper focuses on the optimization of the multi-station high-speed railway hub and models it as a train routing pro...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9792257/ |
| _version_ | 1811338320666427392 |
|---|---|
| author | Yidong Wang Rui Song Shiwei He Zilong Song Jushang Chi |
| author_facet | Yidong Wang Rui Song Shiwei He Zilong Song Jushang Chi |
| author_sort | Yidong Wang |
| collection | DOAJ |
| description | As the intersection of multiple high-speed railway lines, the multi-station high-speed railway hub is the key to improve the transport efficiency of the high-speed railway network. This paper focuses on the optimization of the multi-station high-speed railway hub and models it as a train routing problem (TRP). Considering the capacity of railway infrastructures and the demand of passengers, a mixed integer linear programming model is proposed to minimize the total cost of train routes and passenger routes. The optimized train routes include the macroscopic routes between stations and the microscopic track allocation inside stations and Electric Multiple Units (EMUs) depots. A Lagrangian relaxation (LR) approach is developed to dualize the hard constraints and decompose the origin model into train and passenger subproblems, then a shortest path algorithm is designed to solve the subproblems independently. Numerical experiments based on an illustrative railway hub network and a real-world network are implemented to demonstrate the effectiveness of the model and algorithm. The solution results prove that the LR approach can obtain high-quality solutions within an acceptable computational time. Compared with the existing fixed scheme, the optimization scheme can reduce the total cost by 37.18% and utilize the railway lines and tracks more reasonably. |
| first_indexed | 2024-04-13T18:09:17Z |
| format | Article |
| id | doaj.art-66e77491680b4f2189b054b1bb8fb6e8 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-13T18:09:17Z |
| publishDate | 2022-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-66e77491680b4f2189b054b1bb8fb6e82022-12-22T02:35:58ZengIEEEIEEE Access2169-35362022-01-0110619926201010.1109/ACCESS.2022.31818159792257Optimizing Train Routing Problem in a Multistation High-Speed Railway Hub by a Lagrangian Relaxation ApproachYidong Wang0https://orcid.org/0000-0001-5105-4189Rui Song1Shiwei He2Zilong Song3Jushang Chi4Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Beijing Jiaotong University, Beijing, ChinaKey Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Beijing Jiaotong University, Beijing, ChinaKey Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Beijing Jiaotong University, Beijing, ChinaKey Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Beijing Jiaotong University, Beijing, ChinaKey Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Beijing Jiaotong University, Beijing, ChinaAs the intersection of multiple high-speed railway lines, the multi-station high-speed railway hub is the key to improve the transport efficiency of the high-speed railway network. This paper focuses on the optimization of the multi-station high-speed railway hub and models it as a train routing problem (TRP). Considering the capacity of railway infrastructures and the demand of passengers, a mixed integer linear programming model is proposed to minimize the total cost of train routes and passenger routes. The optimized train routes include the macroscopic routes between stations and the microscopic track allocation inside stations and Electric Multiple Units (EMUs) depots. A Lagrangian relaxation (LR) approach is developed to dualize the hard constraints and decompose the origin model into train and passenger subproblems, then a shortest path algorithm is designed to solve the subproblems independently. Numerical experiments based on an illustrative railway hub network and a real-world network are implemented to demonstrate the effectiveness of the model and algorithm. The solution results prove that the LR approach can obtain high-quality solutions within an acceptable computational time. Compared with the existing fixed scheme, the optimization scheme can reduce the total cost by 37.18% and utilize the railway lines and tracks more reasonably.https://ieeexplore.ieee.org/document/9792257/Multi-station high-speed railway hubtrain routing problemEMUs depotLagrangian relaxationpassenger demand |
| spellingShingle | Yidong Wang Rui Song Shiwei He Zilong Song Jushang Chi Optimizing Train Routing Problem in a Multistation High-Speed Railway Hub by a Lagrangian Relaxation Approach IEEE Access Multi-station high-speed railway hub train routing problem EMUs depot Lagrangian relaxation passenger demand |
| title | Optimizing Train Routing Problem in a Multistation High-Speed Railway Hub by a Lagrangian Relaxation Approach |
| title_full | Optimizing Train Routing Problem in a Multistation High-Speed Railway Hub by a Lagrangian Relaxation Approach |
| title_fullStr | Optimizing Train Routing Problem in a Multistation High-Speed Railway Hub by a Lagrangian Relaxation Approach |
| title_full_unstemmed | Optimizing Train Routing Problem in a Multistation High-Speed Railway Hub by a Lagrangian Relaxation Approach |
| title_short | Optimizing Train Routing Problem in a Multistation High-Speed Railway Hub by a Lagrangian Relaxation Approach |
| title_sort | optimizing train routing problem in a multistation high speed railway hub by a lagrangian relaxation approach |
| topic | Multi-station high-speed railway hub train routing problem EMUs depot Lagrangian relaxation passenger demand |
| url | https://ieeexplore.ieee.org/document/9792257/ |
| work_keys_str_mv | AT yidongwang optimizingtrainroutingprobleminamultistationhighspeedrailwayhubbyalagrangianrelaxationapproach AT ruisong optimizingtrainroutingprobleminamultistationhighspeedrailwayhubbyalagrangianrelaxationapproach AT shiweihe optimizingtrainroutingprobleminamultistationhighspeedrailwayhubbyalagrangianrelaxationapproach AT zilongsong optimizingtrainroutingprobleminamultistationhighspeedrailwayhubbyalagrangianrelaxationapproach AT jushangchi optimizingtrainroutingprobleminamultistationhighspeedrailwayhubbyalagrangianrelaxationapproach |