论文部分内容阅读
突发事件造成铁路线路区间的通过能力受损,在成网条件下,铁路行车调度指挥工作客观上需要搜索列车运行k-最短路。根据突发事件的影响程度设定区间距离的事故等级系数,针对突发事件的模糊性定义了模糊隶属度函数,得到了突发事件条件下模糊区间距离;考虑列车模糊停站时分对运行径路的影响,将列车的模糊停站时分转化为广义距离;将模糊区间距离与广义距离应用到突发事件条件下铁路路网构建中,很好地处理了突发事件条件下路网信息的不确定性问题。在应用蚁群算法求解最短路径的基础上,引入了C-enough概念,将其应用于搜索突发事件条件下k-最短路径问题中。以我国部分路网为例,与传统的Dijkstra算法对比验证了模糊蚁群算法的高效性和实用性,可为列车运行调度指挥提供一定的借鉴。
Under the conditions of the network, the command and control of railway traffic dispatching objectively needs to search the k-shortest route of train operation. According to the impact degree of emergency, the accident grade coefficient of interval distance is defined. The fuzzy membership function is defined for the ambiguity of emergency, and the fuzzy interval distance is obtained under the condition of emergency. , The fuzzy stop time of train is converted to a generalized distance. The fuzzy interval distance and generalized distance are applied to the construction of railway network under emergency conditions, and the network information of emergency under conditions is well handled Certainty. Based on the application of ant colony algorithm to solve the shortest path, the C-enough concept is introduced and applied to the k-shortest path problem under the condition of searching for emergencies. Taking part of the road network in our country as an example, compared with the traditional Dijkstra algorithm, the efficiency and practicability of the fuzzy ant colony algorithm are verified, which can provide reference for the train operation dispatching command.