Power system extreme event screening using graph partitioning
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.