Machine Learning for Fairness-Aware Load Shedding: A Real-Time Solution via Identifying Binding Constraints
Yuqi Zhou, Joseph Severino, Sanjana Vijayshankar, Juliette Ugirumurera, Jibo Sanyal
TL;DR
This work tackles real-time fairness-aware load shedding by embedding fairness constraints into a DC power-flow based optimization and then leveraging learning to identify the active (binding) constraints. By predicting the binding set with a deep neural network, the original QP is reduced to an equality-constrained problem whose KKT conditions form a sparse linear system, enabling millisecond-scale solutions. The approach is validated on both a 3-bus toy system and the RTS-GMLC 73-bus network, achieving near-exact results and substantial online speedups (up to ~2e4x) while maintaining high prediction accuracy (≈99.5%). The method supports risk-averse loading via CVaR and demonstrates strong potential for real-time, fairness-aware grid operations in practical settings.
Abstract
Timely and effective load shedding in power systems is critical for maintaining supply-demand balance and preventing cascading blackouts. To eliminate load shedding bias against specific regions in the system, optimization-based methods are uniquely positioned to help balance between economic and fairness considerations. However, the resulting optimization problem involves complex constraints, which can be time-consuming to solve and thus cannot meet the real-time requirements of load shedding. To tackle this challenge, in this paper we present an efficient machine learning algorithm to enable millisecond-level computation for the optimization-based load shedding problem. Numerical studies on both a 3-bus toy example and a realistic RTS-GMLC system have demonstrated the validity and efficiency of the proposed algorithm for delivering fairness-aware and real-time load shedding decisions.
