skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

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

Journal Article · · Operations Research

Here we present a decomposition approach for obtaining good feasible solutions for the security-constrained, alternating-current, optimal power flow (SC-AC-OPF) problem at an industrial scale and under real-world time and computational limits. The approach was designed while preparing and participating in ARPA-E’s Grid Optimization Competition (GOC) Challenge 1. The challenge focused on a near-real-time version of the SC-AC-OPF problem, where a base operating point is optimized, taking into account possible single-element contingencies, after which the system adapts its operating point following the response of automatic frequency droop controllers and voltage regulators. Our solution approach for this problem relies on state-of-the-art nonlinear programming algorithms, and it employs nonconvex relaxations for complementarity constraints, a specialized two-stage decomposition technique with sparse approximations of recourse terms and contingency ranking and prescreening. The paper describes and justifies our approach and outlines the features of its implementation, including functions and derivatives evaluation, warm-starting strategies, and asynchronous parallelism. We discuss the results of the independent benchmark of our approach by ARPA-E’s GOC team in Challenge 1, where it was found to consistently produce high-quality solutions across a wide range of network sizes and difficulty, and conclude by outlining future extensions of the approach.

Research Organization:
Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA); USDOE Office of Science (SC)
Grant/Contract Number:
AC52-07NA27344
OSTI ID:
2282412
Report Number(s):
LLNL-JRNL-820136; 1031331
Journal Information:
Operations Research, Vol. 71, Issue 6; ISSN 0030-364X
Publisher:
INFORMSCopyright Statement
Country of Publication:
United States
Language:
English

References (15)

Strong NP-hardness of AC power flows feasibility journal November 2019
Convex Optimization book January 2004
Local Solutions of the Optimal Power Flow Problem journal November 2013
Critical review of recent advances and further developments needed in AC optimal power flow journal July 2016
Contingency Filtering Techniques for Preventive Security-Constrained Optimal Power Flow journal November 2007
The SC1 property of the squared norm of the SOC Fischer–Burmeister function journal May 2008
Optimizing Primary Response in Preventive Security-Constrained Optimal Power Flow journal March 2018
Contingency Ranking With Respect to Overloads in Very Large Power Systems Taking Into Account Uncertainty, Preventive, and Corrective Actions journal November 2013
New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem journal November 2017
AC-Feasibility on Tree Networks is NP-Hard journal January 2016
An Augmented Incomplete Factorization Approach for Computing the Schur Complement in Stochastic Optimization journal January 2014
A Generic Approach for Solving Nonlinear-Discrete Security-Constrained Optimal Power Flow Problems in Large-Scale Systems journal May 2014
Tutorial on Stochastic Optimization in Energy—Part I: Modeling and Policies journal March 2016
Verification of Neural Network Behaviour: Formal Guarantees for Power System Applications journal January 2021
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming journal April 2005