Synchronized Optimization for Service Scheduling, Train Parking and Routing at High-Speed Rail Maintenance Depot

To meet the operational requirements and to ensure safe operations, train units of a passenger railway operator require inspection and/or cleaning at the maintenance depots after running a specified mileage or time period. Accordingly, these inspection and cleaning activities are called depot services. In this paper, we propose an integer linear programming (ILP) model for the integrated optimization problem of depot service scheduling, train parking, and train routing. Both short trains (8 marshaling) and long trains (16 marshaling) are considered in the ILP model which is a combinational optimization problem in the dead-end tracks scenario. Moreover, a real-world case study of the Shanghai South Depot, China is carried out to further examine the effectiveness and efficiency of the proposed methodology. Computational results indicate that our method is able to generate optimized shunting plans for the linearized INLP within reasonable solution time for real-life applications, outperforming the manual method in terms of the solution quality and the computation speed.

Automated summary

An integer linear programming (ILP) model is proposed in this paper for the integrated optimization problem of depot service scheduling, train parking, and train routing. A real-world case study of the Shanghai South Depot is conducted to further examine the effectiveness and efficiency of the proposed methodology. The computational results show that the method is able to generate optimized shunting plans for the linearized INLP within reasonable solution time, outperforming the manual method in terms of solution quality and computation speed.