Paths Generating in Emergency on China New Railway Network

摘要

To find the optimal paths for the highspeed trains in emergency, an approach is proposed to solve the i-shortest path problem, which can be considered as the first shortest path problem. The essence of the k-shortest path problem is analyzed and the feasibility of problem converting is discussed. Then the algorithm is designed by steps and verified by the data from Beijing-Shanghai highspeed railway and its neighbor existed railway in emergency. The computing example shows the algorithm generating i-shortest paths is efficient. The paths generated by this method are accessible and reasonable. The approach is proved to solve the paths generating problem on the China new railway network effectively. And the algorithm can be applied to the decision support software tool for train dispatchers.