中文摘要：

突发事件造成铁路线路区间的通过能力受损,在成网条件下,铁路行车调度指挥工作客观上需要搜索列车运行k-最短路。根据突发事件的影响程度设定区间距离的事故等级系数,针对突发事件的模糊性定义了模糊隶属度函数,得到了突发事件条件下模糊区间距离;考虑列车模糊停站时分对运行径路的影响,将列车的模糊停站时分转化为广义距离;将模糊区间距离与广义距离应用到突发事件条件下铁路路网构建中,很好地处理了突发事件条件下路网信息的不确定性问题。在应用蚁群算法求解最短路径的基础上,引入了C-enough概念,将其应用于搜索突发事件条件下k-最短路径问题中。以我国部分路网为例,与传统的Dijkstra算法对比验证了模糊蚁群算法的高效性和实用性,可为列车运行调度指挥提供一定的借鉴。

英文摘要：

The capacity of railways is affected when emergencies occur on the existed network. Objectively it needs to search for the k-shortest paths of train operation for trains dispatching work. In this paper, the accident grade coefficient of interval distance is set according to the degree of emergencies＇ influence, and a fuzzy membership function is defined aimed at the fuzziness of the emergencies. At last we get the fuzzy interval distance in emergency. With the consideration of the fuzzy dwell time＇s influence on the train routine, the fuzzy dweU time is converted to the generalized distance. The fuzzy interval distance and generalized distance are applied to construction of the railway network in emergency, which deals well with the uncertainty problem of railway network. In this paper, C-enough concept is proposed for finding the k-shortest paths in emergencies based on ant colony algorithm. Taking part of China railway network as an example, it shows that the fuzzy ant colony algorithm for solving the k-shortest paths in emergencies has an obvious advantage compared to typical Dijkstra algorithm, which can be embedded in trains dispatching system on the railway network.