Theory And Method Studies On EMU Scheduling Problem For High Speed Railway

Scheduling of Electric Multiple Units (EMU) is the keylink in the process of passenger transport organization of high-speed railway, and directly relates to the running safety of trains, the service quality, and the economic benefit. With the development of high-speed railway in our country, the characteristics of EMU scheduling problems present a trend of diversification and complication, so new requirements are put forward for the scheduling of EMU. Based on the actual production environment of the high-speed railway, this thesis carries out theory and method studies on the EMU scheduling problem. The main work and achievements can be summarized as follows:1. The basis of EMU scheduling problem is analyzed, and the characteristics of the EMU scheduling problem are concluded, including the wide range of time-space, the multiple optimization objective, and the complex constraints.2. The EMU scheduling problem comes down to one special class of travelling salesman problem. Learning from the modeling method of the typical travelling salesman problem, the EMU scheduling model considering the occupancy of maintenance linesis is put forward and the expression method of maintenance accumulative parameters is designed using the "delivering" mechanism. In order to reduce the complexity and the solving difficulty, the solution strategy is proposed, which decomposes the problem from the temporal, spatial and procedural aspects. In the strategy, the EMU scheduling problem is concretely decomposed into the circulation of EMU and the maintenance routing of EMU.3. For the circulation problem of EMU, the planning process with the core of simple circulation is built by decomposing the circulation programs in different scenarios. Then, for the basic circulation process, an integer programming model is presented and a modified solving algorithm is designed using the idea of particle swarm optimization. In order to improve the particle optimization ability, the optimum connecting network of EMU is introduced to be the reference to the particle flying. The proposed circulation planning method is tested and verified by an example.4. For the maintenance routing problem of EMU, the planning process is divided into two parts, the maintenance routing planning for the first and second levels and the maintenance routing planning for the high level, by decomposing the maintenance routing programs in different scenarios. For the maintenance routing planning of the first and second levels, an integer programming model is expressed and a modified ant colony optimization algorithm is designed to solve the model. The travel mileage and the travel time are added as parameters of calculating the probability of the ant routing choice, which improve the optimizing character of the algorithm for the target of maximizing the utilization of maintenance cycle mileage standard. The proposed maintenance routing planning method is also tested and verified by an example.