A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF
A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF
复制标题
一种快速识别大规模安全受限AC-OPF关键突发事件的分解算法
DOI：
10.1287/opre.2023.2453
复制
发表时间：
2023
期刊：
影响因子：
--
通讯作者：
Elizabeth Wong
中科院分区：
文献类型：
--
作者：
Frank E. Curtis;D. Molzahn;Shenyinying Tu;A. Wächter;Ermin Wei;Elizabeth Wong
文章“一种快速识别大规模安全约束AC-OPF关键事件的分解算法”介绍了GO- snip团队在2018年11月至2019年10月举行的ARPA-E网格优化（GO）竞赛挑战1中使用的分解算法。该算法采用独特的权变排序和评估策略，以确定主问题中包含的重要权变，从而近似于原始的大规模安全约束问题。它还涉及处理模型中出现的互补性约束和处理产生的退化的有效策略。描述了软件实现的细节，并提供了一组广泛的数值实验结果，以说明每种使用技术的有效性。Go - snip团队在第一轮围棋比赛中获得第二名。
The article “A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF” presents the decomposition algorithm used by Team GO-SNIP for the ARPA-E Grid Optimization (GO) Competition Challenge 1, held from November 2018 through October 2019. The algorithm involves unique contingency ranking and evaluation strategies for determining the important contingencies to include in a master problem that approximates the original large-scale security-constrained problem. It also involves efficient strategies for handling the complementarity constraints that appear in the model and for handling the arising degeneracies. Software implementation details are described, and the results of an extensive set of numerical experiments are provided to illustrate the effectiveness of each of the used techniques. Team GO-SNIP received a second-place finish in Challenge 1 of the Go Competition.