Key Problem of EMU Routing Scheme

As one of the fundamental operation plans of passenger dedicated line, EMU routing plan directly affects operation efficiency and the quantity of the EMU. The connotation and significance of EMU routing plan are introduced; constraint conditions and evaluation standard of routing plan are analyzed. Through analyzing connection relation of EMU, inspection and repair system, capacity of maintenance depot, evaluation standard of plan, etc, the EMU scheduling problem is transformed into the Traveling Salesman Problem (TSP) which contains many constraint conditions and objective functions. The problem has been proved to be NP-complete. Because Ant Colony Optimization (ACO) algorithm is multi-agent based intelligent algorithm which has good ability for dealing with complex constraint conditions, it can adapt characteristics of the problem better. Practical solutions with actual track data are tested; the algorithm is proved to be effective by comparing some appraisal indices of auto-generating scheme and artificial scheme.