论文标题
安全受限的交流最佳功率流的最新发展：ARPA-E网格优化竞赛中挑战1的概述
Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition
论文作者
论文摘要
最佳功率流问题对于电动电网的设计和操作中的许多任务至关重要。此问题寻求电力网格的最低成本运营点，同时满足工程要求和描述电力如何流过电网的物理定律。另外，考虑到组件故障的可能性并使用电动网络的准确交流电流模型，安全受限的AC最佳功率流（SC-AC-OPF）问题是最重要的实用相关性。为了评估SC-AC-OPF问题和刺激新创新的解决方案算法的最新进展，美国能源部的高级研究项目局 - Energy（ARPA-E）组织了网格优化（GO）竞争的挑战1。本文介绍了竞争中使用的SC-AC-OPF问题表述，概述了SC-AC-OPF算法中的历史发展和艺术状况，讨论了竞争，并总结了挑战赛中前三名团队使用的算法（团队GOLLNLP，GOLLNLP，GO-SNIP，GOMI-GO）。
The optimal power flow problem is central to many tasks in the design and operation of electric power grids. This problem seeks the minimum cost operating point for an electric power grid while satisfying both engineering requirements and physical laws describing how power flows through the electric network. By additionally considering the possibility of component failures and using an accurate AC power flow model of the electric network, the security-constrained AC optimal power flow (SC-AC-OPF) problem is of paramount practical relevance. To assess recent progress in solution algorithms for SC-AC-OPF problems and spur new innovations, the U.S. Department of Energy's Advanced Research Projects Agency--Energy (ARPA-E) organized Challenge 1 of the Grid Optimization (GO) competition. This paper describes the SC-AC-OPF problem formulation used in the competition, overviews historical developments and the state of the art in SC-AC-OPF algorithms, discusses the competition, and summarizes the algorithms used by the top three teams in Challenge 1 of the GO Competition (Teams gollnlp, GO-SNIP, and GMI-GO).
