scholarly journals A Hierarchical Approach for Fast Calculating Minimal Cut Sets of a Microgrid

2017 ◽  
Vol 2017 ◽  
pp. 1-8
Author(s):  
Yanbo Che ◽  
Yuancheng Zhao ◽  
Jianmei Xu ◽  
Jinhuan Zhou

Minimal cut sets are the basis of reliability analysis using analytical techniques. At the present stage, minimal cut sets are mainly obtained by dealing with minimal path sets, which involves cumbersome steps and slower operational speed. The speed of reliability analysis is limited by that of calculating minimal cut sets. In consideration of the characteristics of microgrid, a hierarchical approach for fast calculating minimal cut sets is proposed in this paper. Firstly, an equivalent principle is proposed to convert topology structure into network node diagram; then grades of nodes are designated based on their original connection and the breadth-first search approach; afterwards, root-leaf matrices and selected matrix are created to specify the direction and order of the search. Next, all possible combinations of minimal cut sets are vertically traversed out by replacing root nodes with leaf nodes to achieve a more rapid access to minimal cut sets. Finally, taking the electrical structure of type A380 more electric aircraft as an example, mainstream methods are compared to show the correctness and advantage of our proposed method.

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Yuancheng Zhao ◽  
Yanbo Che ◽  
Tingjun Lin ◽  
Chuanyan Wang ◽  
Jiaxuan Liu ◽  
...  

The More Electric Aircraft (MEA) stands for the direction of aviation development in the new era, and the reliability of power systems on the MEA has attracted widespread attention. Based on the characteristics of MEA power systems, an equivalent method of electrical topology structure is presented in this article, and evaluation method is proposed which shows the reliability of the overall system with the reliability of specific nodes. Firstly, electrical topology structure of a MEA power system is converted into a network node diagram according to the proposed equivalent method. Then, the minimal path sets of specific nodes are obtained by the adjacent matrix algorithm, and the low-order minimal cut sets of disjointed are obtained. After that, the actual failure rate of components is converted to node failure rate, and the reliability of the overall system is evaluated by operational reliability indexes of specific nodes. Finally, taking the MEA A380 as an example, this paper compares and analyzes the reliability of AC loads, DC loads, and key loads to verify the validity and feasibility of the proposed evaluation method. This evaluation system can predict the weak points existing in the MEA power system, as well as providing theoretical support for maintenance schedule.


Information ◽  
2021 ◽  
Vol 12 (4) ◽  
pp. 175
Author(s):  
Daniele Codetta-Raiteri

Fault Trees are well-known models for the reliability analysis of systems, used to compute several kinds of qualitative and quantitative measures, such as minimal cut-sets, system failure probability, sensitivity (importance) indices, etc [...]


Author(s):  
Gaurav Khanna ◽  
Sanjay K. Chaturvedi ◽  
Sieteng Soh

Background: Several techniques are available to evaluate the two-terminal reliability (2TR) of static networks; however, the advent of dynamic networks in recent past, e.g., Delay Tolerant Networks (DTNs), has made this task extremely challenging due to their peculiar characteristics with an associated disruptive operational environment. Recently, a Cartesian product-based method has been proposed to enumerate time-stamped-minimal path sets (TS-MPS)-a precursor to compute the 2TR of such networks. However, it cannot be used to generate time-stamped-minimal cut sets (TS-MCS). TS-MCS cannot only be used as an alternative to generate 2TR but also to compute other unexplored reliability metrics in DTNs, e.g., the weakest link. Objective: To propose a novel approach to enumerate both TS-MPS and TS-MCS of a dynamic network, thereby computing the 2TR of such networks. Methods: The proposed technique converts the time aggregated graph model of a dynamic network into a Line Graph (LG) while maintaining the time-varying graph’s node reachability information. This LG is used thereafter to generate TS-MCS as well as TS-MPS to compute 2TR of the network. Results: The DTN examples are presented to show the efficacy and salient features of our algorithm to obtain 2TR of such networks. Conclusion: The terminologies and techniques used for studying/analyzing network reliability of static networks can be extended to dynamic networks as well, e.g., the notion of minimal path sets to TS-MPS or minimal cut sets to TS-MCS, to assess their network reliability-a potential area of furthering network reliability research.


2018 ◽  
Vol 34 (1) ◽  
pp. 72-91 ◽  
Author(s):  
Rui Fang ◽  
Xiaohu Li

This paper studies the allocation of active redundancies to coherent systems on the context that the base and redundancy components have mutual independent lifetimes. For systems with two symmetric components and systems with one component's minimal cut sets (minimal path sets) covering those of another, we derive sufficient conditions to compare the resultant system lifetimes. Some numerical examples are also presented to illustrate the theoretical results.


Sign in / Sign up

Export Citation Format

Share Document