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, the authors 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, the authors analyze the computational complexities of the model and develop a Benders decomposition algorithm with valid inequalities to solve this problem. Finally, the authors' model and algorithm are tested on a real-world instance of the Beijing-Shanghai high-speed railwthe ay line. The computational results show that the authors' approach can solve these problems within reasonable solution time and small optimality gaps (less than 2.5%).

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01766138
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Feb 19 2021 10:04AM