生命线网络可靠度分析的改进最小路递推分解算法  

A modified minimal path-based recursive decomposition algorithm for seismic reliability evaluation of lifeline networks

作　　者：刘威[1,2] 李杰[1,2] 

机构地区：[1]同济大学建筑工程系,上海200092 [2]同济大学土木工程防灾国家重点试验室,上海200092

出　　处：《地震工程与工程振动》2009年第5期66-72,共7页Earthquake Engineering and Engineering Dynamics

基　　金：国家自然科学基金委创新研究群体资助项目(50621062)

摘　　要：在生命线网络最小路递推分解算法的基础上,充分利用分解过程中的信息,采用合并节点的方法,快速降低分解出来子网的复杂程度,从而达到大幅度减少分解出来的不交最小路(割)数量和提高计算效率的目的。计算实例分析表明,与最小路递推分解算法相比,改进算法能更为高效地给出网络可靠度,是一种有效的生命线工程网络抗震可靠性分析工具。In this paper, a modified recursive decomposition algorithm based on disjoint minimal path is presented to obtain the reliability of lifeline networks. Different from the previous algorithm which only deletes some edges to obtain the subgraphs, combining nodes and edges is introduced into the new algorithm to obtain the simpler subgraphs. As the result, the number of the disjoint minimal paths and cuts which are needed to calculate the reliability of the networks is sharply decreased. In order to compare the efficiency and accuracy of proposed algorithm, three common networks are calculated by previous algorithm and the proposed algorithm. The results show that the proposed algorithm can obtain the reliability of the system in shorter time with much fewer disjoint minimal paths and cuts.

关 键 词：生命线 可靠度 最小路 改进递推分解算法 

分 类 号：P315.967[天文地球—地震学]