Model and Algorithm for High-Speed Railway Line Planning

This paper investigates the internal relationship of the line planning problem. A bi-lever model was built according to the mathematical description of the problem. In the model, the top layer aimed at achieving the train's rank, route and service frequencies with the objective to minimize the total operation costs and total travel time for passengers. The bottom layer focused on the stop-schedule defined by the grade of the train and station with the objective of maximizing the total number of stops. The bi-lever model has linear integer programming and solves by a bi-lever iterative algorithm to get the local optimal solution. Finally, this model is also illustrated by the Beijing-Shanghai high-speed railway in China, which proves the feasibility and effectiveness of the proposed method.