论文部分内容阅读
为了降低道路网连通可靠度计算的复杂度,提出了基于递推分解法的可靠度计算方法.首先阐述了递推分解算法的基础理论,然后对道路网不同于常规网络的特性进行了分析,最后提出了适合于道路网络连通可靠度计算的改进的递推分解算法,同时给出了方便计算机编程实现的具体求解步骤,并对相应的上下限近似算法的优越性进行了分析.改进的递推分解算法打破了传统的先搜索最小路然后进行不交化的连通可靠度求解步骤,直接生成计算中涉及到的不交最小路,并充分考虑了道路网的实际特性,大大简化了计算,避免了可靠度计算中的NP难题.最后通过一简例,说明该算法的实用性.
In order to reduce the complexity of road network connectivity reliability calculation, a reliability calculation method based on recursive decomposition is proposed.First, the basic theory of recursive decomposition algorithm is expounded, and then the characteristics of road network which is different from the conventional network are analyzed, Finally, an improved recursive decomposition algorithm suitable for the calculation of road network connectivity reliability is put forward. At the same time, some concrete solution steps to facilitate computer programming are given, and the advantages of the corresponding upper and lower bound approximation algorithms are analyzed. The push decomposition algorithm breaks the traditional first search minimum path and then does the non-intersecting solution to solve the connectivity reliability, directly generates the non-minimum paths involved in the calculation, fully considers the actual characteristics of the road network, greatly simplifies the calculation, Which avoids the NP problem in the reliability calculation.Finally, a simple example is given to illustrate the practicability of the algorithm.