CAJ | 학술논문

为了降低道路网连通可靠度计算的复杂度,提出了基于递推分解法的可靠度计算方法.首先阐述了递推分解算法的基础理论,然后对道路网不同于常规网络的特性进行了分析,最后提出了适合于道路网络连通可靠度计算的改进的递推分解算法,同时给出了方便计算机编程实现的具体求解步骤,并对相应的上下限近似算法的优越性进行了分析.改进的递推分解算法打破了传统的先搜索最小路然后进行不交化的连通可靠度求解步骤,直接生成计算中涉及到的不交最小路,并充分考虑了道路网的实际特性,大大简化了计算,避免了可靠度计算中的NP难题.最后通过一简例,说明该算法的实用性.
위료강저도로망련통가고도계산적복잡도,제출료기우체추분해법적가고도계산방법.수선천술료체추분해산법적기출이론,연후대도로망불동우상규망락적특성진행료분석,최후제출료괄합우도로망락련통가고도계산적개진적체추분해산법,동시급출료방편계산궤편정실현적구체구해보취,병대상응적상하한근사산법적우월성진행료분석.개진적체추분해산법타파료전통적선수색최소로연후진행불교화적련통가고도구해보취,직접생성계산중섭급도적불교최소로,병충분고필료도로망적실제특성,대대간화료계산,피면료가고도계산중적NP난제.최후통과일간례,설명해산법적실용성.
In order to decrease the calculation complexity of connectivity reliability of road networks,an improved recursive decomposition arithmetic is proposed.First,the basic theory of recursive decomposition arithmetic is reviewed.Then the characteristics of road networks, which are different from general networks, are analyzed.Under this condition,an improved recursive decomposition arithmetic is put forward which fits road networks better.Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic.This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems.And because the characteristics of road networks are considered,this arithmetic is greatly simplified.Finally, an example is given to prove its validity.