A Distributed Rescheduling Approach to Railway Network with Fine Granularity in case of Emergencies

Natural disasters or railway malfunctions usually cause some emergencies in high-speed railway operation. How to reduce the overall influence caused by such emergencies on the railway network is an important topic of high-speed railway operation. In this paper, we proposes a distributed scheduling approach to the railway network with fine granularity in case of emergencies, which handles the rescheduling problem of trains in each local area rather than in the global railway network. A mixed integer linear programming (MILP) model is proposed based on safety and timeliness of train operation. We also consider the constraints of station and line capacity to minimize traffic delays caused by emergencies on the overall railway network. In the case of small and medium-sized road networks, the model can be directly solved by commercial optimization software, which satisfies the real-time requirement.