Research On Optimization Of Operation Plan In Depots Of Electric Multiple Units

In recent years,China has accelerated the construction of a high-speed railway network,and the mileage of high-speed railways and the number of EMU units have increased rapidly,resulting in a rapid increase in the number of EMU maintenance tasks.As a necessary operation in the maintenance process,the shunting operation of the EMU train operation accounts for a large proportion of the maintenance operation.When performing shunting operation,it is necessary to consider the approach conflict of shunting operation and the occupation of the operation line.Therefore,shunting operation itself has a certain complexity.With the increase of maintenance tasks,the scale of the applied shunting operation grows rapidly,the shunting operation plan becomes more and more complex,and it is more and more difficult to prepare the shunting operation plan.Therefore,the demand for automatic planning is also more and more urgent.The shunting operation connects different maintenance operations and operation tracks.In order to perform the shunting operation,the shunting driver needs to travel to and from different line areas.The unreasonable shunting plan will first cause the shunting driver to wait unnecessarily,which will affect the completion of the shunting tasks;secondly,it may increase the walking distance of the shunting driver,increase the workload of the driver and affect the quality of shunting operation.Therefore,it is of great significance to study the preparation and application of shunting plan in the operation of high-speed train.In this paper,two problems of shunting operation scheduling and depot driver scheduling will be studied:(1)The shunting operation scheduling problem in the depot of EMU train is to formulate a maintenance and shunting scheme for the EMU,considering the constraints such as occupancy conflict of the operation track,under the condition that all maintenance tasks of EMU trains are known.The greedy algorithm designed in this paper combined with the heuristic algorithm of neighborhood search can solve the problem quickly.Finally,different examples are designed to verify the effectiveness of the algorithm.(2)The depot driver scheduling problem in the depot of EMU train is carried out on the basis of the first problem.This problem takes the shunting operation plan as the input,and shunting driver to perform the shunting operation,which satisfies the constraints of labor laws and regulations and the actual layout of the station Firstly,a spatiotemporal network is constructed for the problem,and on this basis,a multi-commodity network flow problem with minimum cost is constructed.A Lagrange relaxation heuristic is proposed to solve the network flow problem,in which the upper bound heuristic is a twostage method composed of greedy heuristic and local search method.Computational experiments are designed to test the validity of the Lagrange relaxation heuristic.The calculation results also reflect the importance of the ratio of driver size to task size in the depot,which can help railway operator estimate the number of drivers needed for depots with different layouts and sizes.