Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 5154740, 8 pages
Research Article

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

Key Laboratory of Smart Grid of Ministry of Education, Tianjin University, Tianjin 300072, China

Correspondence should be addressed to Yanbo Che

Received 26 March 2017; Revised 23 July 2017; Accepted 20 August 2017; Published 25 September 2017

Academic Editor: David Bigaud

Copyright © 2017 Yanbo Che et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.