Optimal Method of EMU Routing Planning for Railway Network Based on Variable Formation
摘要
With more and more flexible marshaling of EMUs and movement across lines train operation, in view of the fact that the movement across lines trains have been determined in advance when they operate on this line, and the trains on this line are considered to participate in it when the connection time allows, this paper aims at minimizing the operation cost, constructs a dynamic connection network model, which considers the constraints of reconnection and disconnection, and designs an alternating direction multiplier method (ADMM). By decomposing the original problem into a group of independent EMU connection problems, the sub-problem is effectively solved by the shortest path algorithm. A case study on Beijing-Baotou Railway, a high- EMU Routing Planning can reduce the use of three groups of EMUs, improve the use efficiency of EMUs and save operating costs.