A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems
From MaRDI portal
Publication:6196742
DOI10.1287/OPRE.2022.0229arXiv2110.01669OpenAlexW4384339534MaRDI QIDQ6196742FDOQ6196742
Authors: Cosmin Petra, Ignacio Aravena 
Publication date: 15 March 2024
Published in: Operations Research (Search for Journal in Brave)
Abstract: We present a decomposition approach for obtaining good feasible solutions for the security-constrained alternating-current optimal power flow (SCACOPF) problem at an industrial scale and under real-world time and computational limits. The approach aims at complementing the existing body of literature on bounding the problem via convex relaxations. It was designed for the participation in ARPA-E's Grid Optimization (GO) Competition Challenge 1. The challenge focused on a near-real-time version of the SCACOPF problem where a base case 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 drop controllers and voltage regulators. Our solution approach for this problem relies on state-of-the-art nonlinear programming algorithms and employs nonconvex relaxations for complementarity constraints, a specialized two-stage decomposition technique with sparse approximations of recourse terms, and contingency ranking and pre-screening. The paper also outlines the salient features of our implementation, such as fast model functions and derivatives evaluation, warm-starting strategies, and asynchronous parallelism. We discuss the results of the independent benchmark of our approach done by ARPA-E's GO team in Challenge 1, which found that our methodology consistently produces high quality solutions across a wide range of network sizes and difficulty. Finally, we conclude by outlining potential extensions and improvements of our methodology.
Full work available at URL: https://arxiv.org/abs/2110.01669
Recommendations
- A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF
- Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition
- An ADMM-Based Distributed Optimization Method for Solving Security-Constrained Alternating Current Optimal Power Flow
- Solving security constrained optimal power flow problems by a structure exploiting interior point method
- A decomposition methodology applied to the multi-area optimal power flow problem
Cited In (3)
- A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF
- An ADMM-Based Distributed Optimization Method for Solving Security-Constrained Alternating Current Optimal Power Flow
- Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition
This page was built for publication: A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196742)
