A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems

Solving realistic security-constrained optimal power flow problems In “A surrogate-based asynchronous decomposition technique for realistic security-constrained optimal power flow problems,” we propose a new algorithm for solving a classical problem in power grid operations: the security-constrained optimal power flow, considering its nonlinearities and realistic transitions between nominal and emergency post-contingency operations. Solving security-constrained optimal power flow problems accurately is a critical function, upon which depends the reliability, security, and efficiency of power systems as well as the correct functioning of other critical infrastructure dependent on electricity. The proposed algorithm was extensively tested against many state-of-the-art approaches using realistic and real instances in the ARPA-E Grid Optimization Competition Challenge 1, where it found the best-known solution for 58% of the instances, attained an average gap of less than 0.2%, and obtained the best overall scores, thereby winning all divisions of Challenge 1 with a very strong first place.