Daily Line Planning Optimization for High-Speed Railway Lines

Abstract

Daily line planning in the operation stage should satisfy the fluctuating travel demand on different days and ensure the operation stability. In this paper, we propose an approach of daily line planning optimization for high-speed railway (HSR) lines to trade off the system costs and operation stability. The line plan is optimized by adjusting the reference line plan based on the baseline plan. A bi-level programming model is constructed based on Stackelberg game theory to describe the interaction and conflicts between railway companies and passengers. We propose the thought of “trigger decision, space-time coupling and joint iteration” to solve the model under the framework of the Simulated Annealing Algorithm (SAA). The case study on the Beijing–Shanghai HSR Line demonstrates that the adjusted line plan can not only optimize the system costs but also ensure the operation stability. It can provide sufficient transit capacity to satisfy the travel requirements of passengers and present the obvious advantage of operation cost reduction.