Research On Model And Algorithm Of Train Rescheduling In Case Of Segment Blockage Of High-speed Railway

With the improvement of people’s living standards and the continuous development of high-speed railway,more and more people choose to travel on high-speed railway.High punctuality and safety are the main factors for people to choose high-speed railway.The rescheduling of trains after the blockage of the segment will help railway companies maintain the punctuality and safety of railway and improve service quality.The existing train rescheduling method after the blockage of the segment is poor in real time,which may expand the delay of the train and even lead to security incidents.In order to provide high-quality train rescheduling solutions in real time after the blockage of the high-speed railway segment,this article has conducted in-depth research on the problems of train rescheduling under single priority,multiple priority,and unknown blockage duration.The main research and innovations are as follows:1.Carry on further analysis and research on the model of train rescheduling after segment blockage in high-speed railway.The representation method of high-speed railway network,the target of train rescheduling,and the constraints to be followed for safety of high-speed railway are discussed.Finally,the train rescheduling model under high-speed railway segment blockage is established.2.A multi-stage variable neighborhood descent algorithm(MSVND)is proposed for the problem of poor real-time performance of traditional train rescheduling methods.The MSVND algorithm uses different neighborhood structures to perform neighborhood search at different stages,and limit the train sequence exchange;at the same time,the taboo table is used to prohibit trains that meet certain conditions from continuing to perform neighborhood search.Experiments show that when the blockage duration is 120 minutes,the train rescheduling calculation time of the MSVND algorithm reaches 12.1seconds,which is 99.9% lower than the adaptive large neighborhood search algorithm,and the cost is an increase of 13.5% in total delay.3.In order to firstly reschedule the high-priority trains in certain scenarios,a stepby-step heuristic(SH)algorithm is proposed.The SH algorithm transforms the above two priority problems into multiple two priority problems,and then reschedule the train timetable step by step from high to low priority.For each two priority problems,a step determination heuristic algorithm is used.The experiment determines the priority based on whether the train need to passes the segment that are blocked.The results show that when the blockage duration is 120 minutes,the average train rescheduling calculation time of the SH algorithm is 12.3 seconds;compared with MSVND algorithm,SH algorithm achieves the on-time arrival of high-priority trains at the cost of increasing total delay of low-priority trains by 20.5% and calculation time by 0.2 seconds.4.Aiming at the problem of train rescheduling with unknown duration of segment blockage,a mixed rolling horizon(MRH)is proposed.The algorithm reschedules timetable according to time that are set in advance when there is no blockage duration information,and reschedules timetable according to the predicted value when there is a prediction value;the algorithm reschedules the train after the blockage duration is updated.The experimental results show that,compared with the SH algorithm for train rescheduling,the total delay of train rescheduling using the MRH algorithm increased by7.2%,and the calculation time increased by 39.1%,indicating that it is not conducive to reschedule train if segment blockage duration is unknown.