A Benders Decomposition Algorithm for the Passenger Train Service Planning
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 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%).
Dokumentinformationen
A Benders Decomposition Algorithm for the Passenger Train Service Planning
2021
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
Ähnliche Titel
Optimal Train Dispatching by Benders’-Like Reformulation
| Online Contents | 2016
Optimal Train Dispatching by Benders'-Like Reformulation
| British Library Online Contents | 2016
Optimal Train Dispatching by Benders’-Like Reformulation
| Online Contents | 2016