An Efficient Direct Cut Set Algorithm For Power System Network Reliability Evaluation
Enumeration of all minimal cut sets is an Amportant problem in power system network reliability studies. In this paper, an efficient direct algorithm for the generation of system minimal cut sets is developed. This does not require generation of minimal paths. All minimal cut sets of each load point...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Enumeration of all minimal cut sets is an Amportant problem in power system network reliability studies. In this paper, an efficient direct algorithm for the generation of system minimal cut sets is developed. This does not require generation of minimal paths. All minimal cut sets of each load point can be easily deduced from these system minimal cut sets, Necessary computations for both load point and system reliability indices can be carried out only once using system minimal cut sets unlike in an existing method. |
---|---|
DOI: | 10.1109/TENCON.1991.712621 |