Research on K- shortest path algorithm in train operation in emergency events based on ant colony algorithm

In view of the complexity and timeliness of train operation plan adjustment, a new algorithm of revolvingly calling ant colony algorithm is proposed in this paper. This new algorithm is proposed in consideration of train dispatching command process based on ant colony algorithm and is proposed based on the shortest path analysis of trains in emergency according to the idea that many shortest paths should be found for train operation path. With the (k-1)shortest path found, this algorithm can be used to search the K-th shortest path to solve or mitigate the problem of reasonable path allocation in adjustment of train operation plan and avoid the lack of passing capacity in local sections.