不确定信息下模糊网络最短路径关键边问题

Critical Edge of the Shortest Path on Fuzzy Traffic Network in Uncertain Information Environment

由于道路中断时常发生,车辆在行驶的过程中并不了解这些不确定的道路中断信息,同时交通网络边的权重也存在不确定性,可以模糊数表达,因此有必要研究在不确定环境下的模糊交通网络最短路径关键边问题。基于OERI积分值的概念,定义了模糊网络的最短路径和不确定环境下的模糊最短路径关键边,给出了模糊网络最短路径的标号算法,同时给出了不确定信息环境下的模糊最短路径关键边的有效算法,最后进行了实例分析,表明了算法的有效性。

It often occurs that the traffic is held up and drivers cannot obtain the information about edge failure during driving. Moreover, the weights of edge on traffic network are expressed by fuzzy numbers because of uncertainty. So it is necessary to study the most critical edge of the shortest path problem on fuzzy traffic network in uncertain information environment. Based on the concept of OERI （overall existence ranking index） integral value, the concept of the shortest path on a fuzzy network and the concept of the most critical edge of fuzzy shortest path in uncertain information were defined ; an algorithm was presented for finding the shortest path on a fuzzy network and an effective algorithm of computing the most critical edge of fuzzy shortest path was discussed. An example was illustrated to show the effectiveness of the algorithms.