摘要
在应用d-最小割(路)集计算多状态网络可靠度精确值算法中,运用容斥原理求解d-最小割(路)集较为复杂。为此,提出一种不需d-最小割(路)集直接计算多状态网络可靠度精确值的算法。该算法按一定规则分割状态空间,在此基础上生成无效状态空间,通过迭代计算直接获得可靠度精确值,同时通过定义边的容量下界及剩余网络。实例分析结果表明,运用该算法可减少计算量,并能精确求解d-最小割(路)集。
According to the complexity of obtaining d-minimal cuts（paths） and inclusion-exclusion for calculating exact multistate networks reliability,a direct,exact algorithm for solving multistate networks reliability without requiring a priori d-minimal cuts（paths） is presented.The proposed algorithm generates the invalid state spaces based on dividing state spaces according to given rules,obtains the exact multistate networks reliability by iteration.Moreover,the algorithm defines edge capability lower boundary and residual network.Example analysis shows the algorithm can reduce calculation burden,avoid the solution complexity of d-minimal cuts（paths）.
出处
《计算机工程》
CAS
CSCD
2012年第23期95-100,共6页
Computer Engineering
基金
国家部委基金资助项目
第二炮兵工程学院创新性探索研究基金资助项目(XY2010JJB23)
关键词
网络可靠性
多状态网络
无效状态空间
状态空间分割
容量下届
剩余网络
network reliability
multistate network
invalid state spaces
state spaces dividing
capability lower boundary
residual network
