华侨大学学报（自然科学版）2016，Vol.37Issue(4)：511-514,4.DOI:10.11830/ISSN.1000-5013.201604024
采用节点流守恒求取多状态网络d?最小路集的改进算法
Improved Algorithm for d?Minimal Path Set of Multistate Network Using Node Flow Conservation
摘要
Abstract
To consider the calculation problem of the multistate network reliability,an improved algorithm for multistate network d-minimal path set was proposed.The two?way side of the network is equivalent to one side by introducing feasible flow vector.The capacity of the edge of the network is not special required.And it can be used for a network with two sides.The algorithm is more applicable.By the introduction the capacity of the edge.The reverse side of the network is equivalent to one side.Therefore,it educe the the viable solution enumerated number of the d?minimal path set,and the complexity of the algorithm.To verify the results,it shows that the proposed algorithm can acuurately obtain all d?minimal path set of the multistate network.关键词
网络可靠度/多状态网络/最小路集/可行流向量Key words
network reliability/multistate network/minimal path set/feasible flow vector分类
数理科学引用本文复制引用
褚洪彦..采用节点流守恒求取多状态网络d?最小路集的改进算法[J].华侨大学学报（自然科学版）,2016,37(4):511-514,4.基金项目
国家自然科学基金资助项目 （）
