Optimization of Train Diagram Structure for High-Speed Railway

To improve the carrying capacity of high-speed railway, the structure of the train diagram was optimized by drawing compact train diagram and designing reasonable operation scheduling for trains. The optimization problem of the train diagram structure was transformed into a traveling salesman problem (TSP). Taking the total cost of the all routes as a goal, a 0-1 integer programming model was proposed, and then solved using the genetic algorithm. Finally, the model was verified through a real case study using the data of Beijing-Shanghai high-speed railway in 2015, and the optimized train diagram was compared with the original scheme. Computation results show that the total operation time of 39 trains was reduced from the 628 min in the original scheme to the 495 min in the optimized schedule, a reduction by about 21.2%. Therefore, the optimal alternative can meet better the demand for intensive dispatching during the peak period or in sudden burst condition of passenger flow.