Train Scheduling,EMU Circulation And Maintenance Scheduling And Rescheduling In Different Situations Of High-Speed Railway

The country's 13th Five-Year Plan proposed that the railway lines in China will be 150,000 kilometers,including 30,000 kilometers high speed railway.What is more,the rate of double tracks and electrochemical raiway will be increased to 60 percent and 70 percent respectively.The continueous construction and development of railway lines will bring different management decisions in different scenrios of railway lines.Therefore,the scheduling and rescheduling of railway should be paid much more attention to..This dissertation focuses on train timetabling,Electric Multiple Units(EMU)circulation and maintenance scheduling and rescheduling in situations of the start stage of the railway management,the middle stage of the management,mature stage of the management and the emergency situation respectively.More attention should be focused on the train operation at the start and the middle stages with maximum robustness and minimum costs,while much more attention should be paid on passenger services in situations of the mature stage and the emergency aiming to provide passenger service as good as possible.So main parts of the dissertation is followed as four chapters.(1)An integrated mathematical model of both train timetabling and EMU circulation and maintenance scheduling is constructed at the start management of a new railway line.During this period all sections of the new railway company should learn to cooperate with each other to guarantee the safety and punctuality firstly.This chapter pays more attention to the safety and reliability of railway companies in this stage with aims of maximum robustness and minimum costs.To achieve these two goals,we build an integrated mathematical model and then propose an improved ant colony algorithm to solve it.Finally we tackle the train timetabling and EMU circulation and maintenance scheduling problem in Beijing-Shanghai high speed railway.(2)In the middle stage of railway operation,EMU circulation and maintenance scheduling in a railway network should be studied carefully.More potential passenger demands are attracted due to new railway lines,opening.To serve these passengers,more EMUs are required from railway companies.In this case,to save the cost of EMUs,we should optimize the way these EMUs are used and maintained.This chapter constructs a mathematical model of EMU circulation and maintenance scheduling in a railway network with the minimum number of EMUs and then the minimum number of the EMUs'maintenances.What is more,a manual experience guidance mechanism is introduced to improve the Max&Min ant colony algorithm,which is used to solve the EMU circulation and maintenance scheduling problem.This algorithm provides a basic study for AI calculation in the future to make these schedules automatically based on machine learning.In the end of this chapter,the Beijing-Shanghai high speed railway is chosen for a numerical example to obtain the EMU circulation and maintenance schedule.(3)During the mature stage of the railway operation,the stable matching of passenger-service-EMU is provided.After each section of railroads cooperate with each other skillfully,the railway companies should change their aims from only guaranteeing the safety operation to providing more passenger services with high quality.In that case,railway companies propose candidate services based on history passenger demands for passengers to take on and EMUs to undertake.Then railway companies should make the trade-offs between aims of minimum costs of EMUs and maximum services of passengers to get the stable matching.Finally chosen services are viewed as real train trips in train timetables and service-EMU assignments are the EMU assignment schedule.Referring to the stable marriage problem this chapter constructs the three-dimensional multi-assignment mathematical model of passenger-service-EMU three sides.Then Dantzig Wolfe decomposition is introduced to solve the large-scale problem.At last,the train timetable and the EMU assignment plan is generated through this method in the railway network of Yangtze River Delta Section.(4)Under the emergency situation the rescheduling problem based on passenger service demand is solved in this chapter.In traditional rescheduling way,dispatchers aims to guarantee the safety and recovery of railway lines only without considering passengers'demands.To avoid the loss of passengers,demands,a new rescheduling way referred to VRP is proposed in this chapter:according to demands of passengers and current locations of EMUs,railway companies use nearest EMUs to pickup most passengers to provide maximum services.If necessary,dispatchers could couple EMUs together or adjust some passengers' demands to adapt to most passengers.The new generated services could be used as the timetable rescheduling and the assignment of EMUs would be used as EMU management rescheduling.Referring to VRP problem,this chapter constructs a mathematical model of rescheduling in emergency situations considering passengers' service.Then column generation algorithm is adopted to divide the problem into the main problem and the sub problem.To solve the sub problem efficiently the dynamic programming is introduced.Finally we make a rescheduling of train timetable and EMU assignment plan in the Yangtze River Delta railway network.In the reform process of China Railway Company,these methods illustrated in this disertation could be used as a reference for decision support to make trade-offs between management cost and passenger service.