A Benders Decomposition Algorithm for the Passenger Train Service Planning
Railway transport becomes a more popular transportation in many countries due to its large transport capacity, low energy consumption, and benign environment. The passenger train service planning is the key of the rail operations system to balance the transport service and the passenger demand. In t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2021/6653334 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832550433465303040 |
|---|---|
| author | Song Pu |
| author_facet | Song Pu |
| author_sort | Song Pu |
| collection | DOAJ |
| description | Railway transport becomes a more popular transportation in many countries due to its large transport capacity, low energy consumption, and benign environment. The passenger train service planning is the key of the rail operations system to balance the transport service and the passenger demand. In this paper, we propose a mixed binary linear programming formulation for the passenger train service planning to optimize the train route, frequency, stop schedule, and passenger assignment simultaneously. In addition, we analyze the computational complexities of the model and develop a Benders decomposition algorithm with valid inequalities to solve this problem. Finally, our model and algorithm are tested on a real-world instance of the Beijing-Shanghai high-speed railway line. The computational results show that our approach can solve these problems within reasonable solution time and small optimality gaps (less than 2.5%). |
| format | Article |
| id | doaj-art-8e504ca9bd284ae5bb7db3f0739df40a |
| institution | Kabale University |
| issn | 0197-6729 2042-3195 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj-art-8e504ca9bd284ae5bb7db3f0739df40a2025-02-03T06:06:49ZengWileyJournal of Advanced Transportation0197-67292042-31952021-01-01202110.1155/2021/66533346653334A Benders Decomposition Algorithm for the Passenger Train Service PlanningSong Pu0School of Economics and Management, University of Electronic Science and Technology of China, Chengdu 611731, ChinaRailway transport becomes a more popular transportation in many countries due to its large transport capacity, low energy consumption, and benign environment. The passenger train service planning is the key of the rail operations system to balance the transport service and the passenger demand. In this paper, we propose a mixed binary linear programming formulation for the passenger train service planning to optimize the train route, frequency, stop schedule, and passenger assignment simultaneously. In addition, we analyze the computational complexities of the model and develop a Benders decomposition algorithm with valid inequalities to solve this problem. Finally, our model and algorithm are tested on a real-world instance of the Beijing-Shanghai high-speed railway line. The computational results show that our approach can solve these problems within reasonable solution time and small optimality gaps (less than 2.5%).http://dx.doi.org/10.1155/2021/6653334 |
| spellingShingle | Song Pu A Benders Decomposition Algorithm for the Passenger Train Service Planning Journal of Advanced Transportation |
| title | A Benders Decomposition Algorithm for the Passenger Train Service Planning |
| title_full | A Benders Decomposition Algorithm for the Passenger Train Service Planning |
| title_fullStr | A Benders Decomposition Algorithm for the Passenger Train Service Planning |
| title_full_unstemmed | A Benders Decomposition Algorithm for the Passenger Train Service Planning |
| title_short | A Benders Decomposition Algorithm for the Passenger Train Service Planning |
| title_sort | benders decomposition algorithm for the passenger train service planning |
| url | http://dx.doi.org/10.1155/2021/6653334 |
| work_keys_str_mv | AT songpu abendersdecompositionalgorithmforthepassengertrainserviceplanning AT songpu bendersdecompositionalgorithmforthepassengertrainserviceplanning |