eduzhai > Applied Sciences > Engineering >

Fast Identification of Saturated Cut-sets using Graph Search Techniques

  • king
  • (0) Download
  • 20210506
  • Save

... pages left unread,continue reading

Document pages: 5 pages

Abstract: When multiple outages occur in rapid succession, it is important to knowquickly if the power transfer capability of different interconnections (orcut-sets) of the power network are limited. The algorithm developed in thispaper identifies such limited cut-sets very fast, thereby enhancing thereal-time situational awareness of power system operators. The significance ofthe proposed approach is described using the IEEE 39-bus test system, while itscomputational benefits are demonstrated using relatively large test-casescontaining thousands of buses. The results indicate that the proposed networkanalysis can estimate the impact of an outage on any cut-set of the system andscreen out the cut-set that gets saturated by the largest margin, very quickly.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×