Railway Passenger Train Crew Scheduling Problem

The reasonable using of crew is important and meaningful to railway passenger transportation in locomotive efficient working, train safe running and fast and convenient service for passengers. At present, many problems on the railway crew scheduling have been studied at home and abroad, but the problem of locomotive crew routings is need to be studied further. Based on the existing research conclusions, correlate theories of railway crew scheduling problem have been summarized, and the problem of locomotive crew routings of railway passenger transportation have been discussed deeply. The main research content is as follows:Firstly, the current development trend of railway passenger transportation is analyzed, with comparing the advantages and disadvantages of the locomotive crew working system. It highlights the important role of locomotive crew routings. With the existing research results, qualitative and quantitative methods, multidisciplinary methods, computer-aided tools and data processing technologies are used to solve the problem.Secondly, the problem of locomotive crew routings of railway passenger transportation has been defined, then the process has been elaborated and its pattern has been divided, at last the problem has been described with common language.Thirdly, the mathematical programming model of the problem is constructed, and the Shortest Neighborhood Search algotithm and the Simulated Annealing algorithm are designed to solve the model. With the actual situation of the Nanchang Depot, we use the algorithm to solve the problem and analyze the results to prove it.