Power System Extreme Event Screening using Graph Partitioning
- 1 September 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 503-510
Abstract
We propose a partitioning problem in a power system context that weighs the two objectives of minimizing cuts between partitions and maximizing the power imbalance between partitions. We then pose the problem in a purely graph theoretic sense. We offer an approximate solution through relaxation of the integer problem and suggest refinement using stochastic methods. Results are presented for the IEEE 30-bus and 118-bus electric power systems.Keywords
This publication has 7 references indexed in Scilit:
- Identification of severe multiple contingencies in electric power networks2005
- The influence modelIEEE Control Systems, 2001
- Multiphase mesh partitioningApplied Mathematical Modelling, 2000
- A simple min-cut algorithmJournal of the ACM, 1997
- Spectral partitioning1995
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- A property of eigenvectors of nonnegative symmetric matrices and its application to graph theoryCzechoslovak Mathematical Journal, 1975