Research On Algorithm For Motor Train Sets Scheduling Problem

In the high speed railway trains operating organization system, one of the most important problems is the motor train sets scheduling problem. Because the motor train set is expensive, it is important to make a good use of them. On basis of reading lots of relative literature of science and technology, this paper summaries and analyzes the research situation and existing problems at domestic and abroad on the motor train sets scheduling problem. This paper makes an improvement on the existing research.This paper transforms the connection and turnaround plans of motor train sets into the Traveling Salesman Problem (TSP) in a network which contains many constraint conditions and objective functions. And a mathematical model is derived for the formulation of periodic operation plans of motor train sets of multiple-bases under the conditions of comprehensive maintenance. In the paper, it analyzes the characteristics of motor train sets scheduling problem and all the meta-heuristic algorithms for TSP. Based on it, it puts forward that the Simulated Annealing (SA) is the most suitable algorithm for solving the motor train sets scheduling problem. The algorithm considers many constraint conditions of the problem, including distribution of the mending times among different bases on the basis of their capacities and so on. The software of the motor train set scheduling system is developed for the dedicated passenger lines, which may present the train set circulating diagrams, and the content, time and location of maintenance. Valuable research results are provided for the multi-purpose use and maintenance management of motor train sets on special lines for passenger traffic.