A heuristic approach to passenger-oriented high-speed train schedule mode

Abstract

A better railway timetable for high-speed railway, HSR, can provide a more convenient service to passengers, which may attract more consumers transferring from domestic air flights and cars. In this study, a schedule model, which minimizes the total path cost of passengers and is subjected to both standard train schedule and passenger path choice constraints, is proposed to generate conflictfree and convenient schedule plan. A heuristic HSR scheduling algorithm is proposed to solve our model. This heuristic algorithm is based on the decomposition approach and the iterative approach. The South China HSR network is used to test the optimality, efficiency, and applicability.