Models And Algorithms For High-Speed Train Rescheduling In Typical Disrupted Scenarios

Serving as the nerve center of the train operation organization for high-speed railway,the high-speed train dispatching system has a prominent part to play in assuring the safe and efficient operation of trains.Under normal circumstances,trains run properly in accordance with the scheduled train diagram generated in advance.Nevertheless,high-speed trains are inevitably affected by disturbances and disruptions from outside or within the railway system,deviating the planned train operation,which leads to delays short and long.If left unchecked,the propagation of delays will prompt huge delays of trains,diminishing the quality of the railway service as well as the transportation efficiency.The current measures of adjusting trains under these situations are principally through manual operations by train dispatchers.With the expansion of the railway network and the high frequency of emergencies,the transition of the train rescheduling from adjusting by hand to automatic adjustment is surely a must.Therefore,the research of train rescheduling has become a hot spot in academia.This thesis explores the issue of the high-speed train rescheduling under typical disrupted scenarios,i.e.,disturbances and disruptions respectively.To be detailed,the contents of this thesis are as follows:First,aimed at the disturbance scenario epitomized by relatively small train delays and the disruption scenario represented by the temporary segment blockage,the high-speed train rescheduling mix-integer linear programming(MILP)mathematical models are built respectively.Concerning disturbance conditions,the objective function of the model is set to minimize the weighted sum of departure delays and arrival delays of trains,and constraints such as headway of trains are considered.With regard to disruption circumstances,the objective function and constraints are further explored considering the cancellation of trains so as to enrich the mathematical model.Second,based upon the proposed mathematical model,the algorithms for the disturbance scenario are proposed,which are an exact CPLEX-based branch-and-cut algorithm and a meta-heuristic grey wolf optimization algorithm(GWO).From the perspective of departure delays and arrival delays,the case studies are conducted in an effort to demonstrate the superiority of the proposed approach in comparison with a commonly used rescheduling approach FSFS(first scheduled first served).Last,on the basis of the proposed model,a rolling horizon approach is proposed for the temporary segment blockage scenario by dividing the whole time horizon into several time spans,in which CPLEX-based branch-and-cut algorithm is applied to solve the model.Compared with the FSFS approach,the effectiveness and practicability of the proposed approach are proved in terms of total delays reduction by approximately 22.5% and real-time performance by around 12.7% through simulated experiments.There are 40 pictures,9 tables and 78 references.