A Rescheduling Algorithm of Train-group for Railway Emergencies and its Parallelization
In order to reduce the delays of train groups when suffering from railroad emergeacies,we propose a rescheduling algorithm of train groups to reschedule trains,instead of previous just waiting.A heuristic algorithm is designed to search the proper path for the trains involved in the railroad emergencies.An evaluation criterion based on the extent of the disturbance towards the original timetable and limited time is designed to eeleet the optimal path for each train.And a conflicts resolution strategy is designed to deal with the path and time conflicts among trains when rescheduling.In the end,due to the real-time needs of the railroad scheduling,we implement the parallel proeessing for the train-group rescheduling referring to the allocation of loads.Experimental results show that the rescheduling algorithm is efficient to reduce the delays of train groups and the parallel processing meets the real-time response of the train-group rescheduling well.
train groups rescheduling railroad emergencies parallel processing
Zifeng Wang Li Ruan Limin Xiao
School of Computer Science and Engineering Beihang University Beijing 100191, China
国际会议
太原
英文
530-534
2012-12-08（万方平台首次上网日期，不代表论文的发表时间）