%0 Journal Article
%A Alexandre Moreira
%A Alan Valenzuela
%A Miguel Heleno
%B IEEE Transactions on Power Systems
%D 2022
%G eng
%P 1 - 13
%R 10.1109/TPWRS.2022.3228211
%T Solving Market-Based Large-Scale Security-Constrained AC Optimal Power Flows
%U https://ieeexplore.ieee.org/document/9978710/
%8 12/2022
%! IEEE Trans. Power Syst.
%X <p><span>The security-constrained AC optimal power flow (SCACOPF) is one of the most important problems that the industry has to solve on a daily basis in several electricity markets across the globe within strict time limits. Mathematically, the SCACOPF is formulated as a mixed-integer non-convex program, which is a very challenging class of problems to be solved in practice, and even obtaining feasible solutions can be difficult. In addition, most independent system operators (ISOs) impose a deterministic&nbsp;</span><span id="MathJax-Element-2-Frame" class="MathJax"><span id="MathJax-Span-6" class="math"><span><span><span id="MathJax-Span-7" class="mrow"><span id="MathJax-Span-8" class="mi">n</span><span id="MathJax-Span-9" class="mo">−</span><span id="MathJax-Span-10" class="mn">1</span></span></span></span></span></span><span>&nbsp;security criterion and, consequently, further increase the dimensionality of the problem. In this paper, we present an algorithmic approach that obtains a feasible solution to this problem with a 1-hour time limit. Our approach combines contingency selection, decomposition, and tailored warm start to the non-convex problem, and its performance is illustrated with our results in Challenge 2 of the Grid Optimization (GO) competition created by the U.S. Advanced Research Projects Agency-Energy (ARPA-E).</span></p>