arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.00585math.OC
收藏

大规模安全约束最优潮流的有效解

Computationally Efficient Solutions for Large-Scale Security-Constrained Optimal Power Flow

Mohammadhafez Bazrafshan, Kyri Baker, Javad Mohammadi

摘要:

在本文中,我们讨论了我们的方法和算法框架,解决大规模的安全约束最优潮流(SCOPF)问题。SCOPF是一个混合整数非凸优化问题,其目标是在保证系统N-1安全的前提下,使调度费用最小。在大型网络中找到这个问题的可行解是具有挑战性的,本文提出了应急选择,近似方法和分解技术,以解决这一挑战在很短的时间内。在美国高级研究计划电力能源(ARPA-E)组织的电网优化(GO)竞赛中,通过大规模合成和实际电网验证了所提出方法的性能。由于许多之前的工作都集中在小规模系统上,并且没有使用经过验证的公开数据集进行基准测试,因此我们的目标是为SCOPF提供一个实用的解决方案,该解决方案已被证明在实际规模(30,000条总线)的网络上实现良好的性能。

英文摘要:

In this paper, we discuss our approach and algorithmic framework for solving large-scale security constrained optimal power flow (SCOPF) problems. SCOPF is a mixed integer non-convex optimization problem that aims to obtain the minimum dispatch cost while maintaining the system N-1 secure. Finding a feasible solution for this problem over large networks is challenging and this paper presents contingency selection, approximation methods, and decomposition techniques to address this challenge in a short period of time. The performance of the proposed methods are verified through large-scale synthetic and actual power networks in the Grid Optimization (GO) competition organized by the U.S. Advanced Research Projects Agency-Energy (ARPA-E). As many prior works focus on small-scale systems and are not benchmarked using validated, publicly available datasets, we aim to present a practical solution to SCOPF that has been proven to achieve good performance on realistically sized (30,000 buses) networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑