基于改进的不交化最小路集的网络系统可靠性算法

史玉芳1，陆宁2，李慧民3

doi:10.3969/j.issn.1007130X.2011.

计算机工程与科学 >

2011 , Vol. 33 >Issue 1: 31 - 35

DOI: https://doi.org/10.3969/j.issn.1007130X.2011.

论文

基于改进的不交化最小路集的网络系统可靠性算法

展开

（1.长安大学建筑工程学院，陕西西安 710061;2.西安建筑科技大学土木学院，陕西西安 710055;
3.西安科技大学管理学院，陕西西安 710054）

史玉芳(1980),女,陕西西安人，硕士，讲师，研究方向为工程项目管理、系统工程。陆宁(1953),男,河北乐亭人，硕士，教授，研究方向为工程管理、技术经济和系统工程。李慧民(1954),男,陕西宝鸡人，硕士，教授，研究方向为土木工程建造与工程项目管理。

收稿日期: 2010-02-28

修回日期: 2010-05-23

网络出版日期: 2011-01-25

基金资助

陕西省自然科学基金资助项目（2005E211）

收起

An Algorithm of Network System Reliabiilty Based on an Improved Disjointed Minimal Path Set

Expand

（1.School of Civil Engineering,Chang’an University,Xi’an 710061;
2.School of Civil Engineering,Xi’an University of Architecture and Technology,Xi’an 710055;
3.School of Management,Xi’an University of Science and Technology,Xi’an 710054,China）

SHI Yufan,born in 1980,MS,lecturer,her research interests include engineering project management,system engineering.LU Ning,born in 1953,MS,professor,his research interests include project management,technical economy and system engineering.LI Huimin,born in 1954,MS,professor,his research interests include civil engineering and project management.

Received date: 2010-02-28

Revised date: 2010-05-23

Online published: 2011-01-25

Fold

摘要

本文根据不交化布尔代数及BDD原理提出了一种简化的求解不交化最小路集的改进算法。对最小路集的路长进行排序，按最小路集的不同路长分两种方法不交化：对于长度为n-1的最小路集，在保持原有弧不变外，将网络图中其余未包含在该条最小路内的弧取逆加入，直接获得不交化运算结果；其余最小路集采用BDD方法进行不交化。最后的实例计算表明，改进的算法有较小的分枝树、较高的计算效率和精度，为大型网络系统的可靠性分析提供了一种新的途径。

关键词： 网络系统; 可靠性; 不交化最小路集; BDD算法

本文引用格式

史玉芳1，陆宁2，李慧民3 . 基于改进的不交化最小路集的网络系统可靠性算法[J]. 计算机工程与科学, 2011 , 33(1) : 31 -35 . DOI: 10.3969/j.issn.1007130X.2011.

Abstract

Constructing a disjoint minimal path set is an important approach for the reliability analysis of networks. Based on the disjoint theory and the BDD algorithm, an improved algorithm is presented for directly and simplily constructing disjointed minimal paths in which different disjoint methods are used for the minimal path set with different path lengths. According to the improved algorithm, a program is provided to obtian the disjointed minimal path set of the network system,and network reliability can be effectively worked out.Finally, a numerical example is given. It is shown that the method is efficient and accurate. It provides a new approach for the reliability analysis of largescale network systems.

Key words： network system;reliability；disjointed minimal paths set;BDD algorithm

Options

文章导航

模态框（Modal）标题

摘要

本文引用格式

Abstract