Research On Optimization Method EMU Delivery Route Based On Maintenance Plan Decomposition

The EMUs reparation path planning problem is very complicated.At present,the manual planning is the main method for solving the problems.In order to reduce the labor intensity for path planning with higher operation and maintenance efficiency of EMUs,the problem of EMU delivery and repair routes is optimized by introducing workshop scheduling algorithms.After that,the information and intelligence level of EMUs could be improved with enhanced maintenance capabilities of EMUs.Through an in-depth study of the path for EMUs to be repaired with the actual situation of the Z EMUs maintenance and repair centre in a company of China Railway Group,it was found that the path planning problem of EMUs for repairs is similar with the workshop scheduling problems.Therefore,it is necessary to transform the repair path problem into a workshop scheduling problem for more detailed research.After studying the maintenance schedule of the EMU,the problem of the repair path of the EMU can be decomposed into the single machine scheduling problem and the multi-machine parallel scheduling problem in the workshop scheduling problem.MATLAB is used to program the algorithm and Simtalk programming language is used to simulate and verify it.The research focus of this article is as follows:(1)The main content of the repair path optimization problem is analyzed in detail,and then according to the related theories of the workshop scheduling problem,it is found that the two have a high degree of similarity.By learning from the workshop scheduling problem,the repair path planning problem is studied from two aspects,of.the single-machine scheduling problem and the multi-machine parallel scheduling problem.The research on the optimization method of the repair path of the EMU based on the decomposition of the maintenance schedule is determined.An optimization plan for the repair path problem is proposed.(2)The single-machine scheduling problem is that when all the path throats are available,and only one EMU is passing through the throat.Through the analysis of the traditional Dijkstra algorithm principle,the backtracking theory is introduced and the hierarchical Dijkstra algorithm is proposed.The single-machine scheduling problem model is established.The algorithm is implemented by MATLAB programming,and the results are verified and analyzed.After optimization,the efficiency of the EMU at the throat area has increased by24.72%.(3)The multi-machine parallel dispatching problem is a situation in which the path throat has been occupied or is about to be occupied,and multiple trains of EMUs will pass through the throat at the same time.Through the analysis of the traditional Floyd algorithm,the theory of matrix customization is proposed,the multi-machine parallel scheduling problem model is established,the algorithm is implemented by MATLAB programming,and the results are verified and analyzed.After optimization,the efficiency of the EMU at the throat area has increased by 12.76%.(4)By using the simulation software Plant Simulation,a model based on the schematic diagram of the EMU station is built.The repair path plans obtained by the algorithm used in the single-machine scheduling problem and the multi-machine parallel scheduling problem are simulated and verified,and the reliability of the algorithm is verified through the error analysis of the algorithm and the simulation result.