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

Yanbo Che, Yuancheng Zhao, Jianmei Xu and Jinhuan Zhou

Mathematical Problems in Engineering, 2017, vol. 2017, 1-8

Abstract:

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.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2017/5154740.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2017/5154740.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5154740

DOI: 10.1155/2017/5154740

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().