Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition

Aravena, Ignacio; Molzahn, Daniel K.; Zhang, Shixuan; Petra, Cosmin G.; Curtis, Frank E.; Tu, Shenyinying; Wächter, Andreas; Wei, Ermin; Wong, Elizabeth; Gholami, Amin; Sun, Kaizhao; Sun, Xu Andy; Elbert, Stephen T.; Holzer, Jesse T.; Veeramany, Arun

doi:10.1287/opre.2022.0315

Cited by 8 publications

(1 citation statement)

References 64 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the problem is of key interest to critical infrastructure systems, there have been research competitions dedicated to solving the SCOPF efficiently. This includes the ARPA-E Grid Optimization competition [11][12][13]. This contest focused on solving large cases of this problem and successful teams used convex relaxations, contingency-screening heuristics, problem decompositions and various solvers (IPOPT, KNITRO, Gurobi).…”

Section: Introductionmentioning

confidence: 99%

Optimization with Neural Network Feasibility Surrogates: Formulations and Application to Security-Constrained Optimal Power Flow

Kilwein,

Jalving,

Eydenberg

et al. 2023

Energies

View full text Add to dashboard Cite

In many areas of constrained optimization, representing all possible constraints that give rise to an accurate feasible region can be difficult and computationally prohibitive for online use. Satisfying feasibility constraints becomes more challenging in high-dimensional, non-convex regimes which are common in engineering applications. A prominent example that is explored in the manuscript is the security-constrained optimal power flow (SCOPF) problem, which minimizes power generation costs, while enforcing system feasibility under contingency failures in the transmission network. In its full form, this problem has been modeled as a nonlinear two-stage stochastic programming problem. In this work, we propose a hybrid structure that incorporates and takes advantage of both a high-fidelity physical model and fast machine learning surrogates. Neural network (NN) models have been shown to classify highly non-linear functions and can be trained offline but require large training sets. In this work, we present how model-guided sampling can efficiently create datasets that are highly informative to a NN classifier for non-convex functions. We show how the resultant NN surrogates can be integrated into a non-linear program as smooth, continuous functions to simultaneously optimize the objective function and enforce feasibility using existing non-linear solvers. Overall, this allows us to optimize instances of the SCOPF problem with an order of magnitude CPU improvement over existing methods.

show abstract

Section: Introductionmentioning

confidence: 99%