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

联合机会约束AC最优潮流的有效松弛算法

Efficient Relaxations for Joint Chance Constrained AC Optimal Power Flow

Kyri Baker, Bridget Toomey

摘要:

随着电力系统随机性水平的不断提高,需要求解含有大量随机变量的最优潮流问题。天气预报、电价和转移负荷模式引入了更高级别的不确定性,并且可能产生难以以有效方式解决的最优化问题。在文献中已经考虑了最优潮流问题中单个机会约束的有效解方法;然而,联合机会约束主要通过基于神经网络的方法或利用过于保守的布尔不等式作为上界来解决。在本文中,联合机会约束被用来解决交流最优潮流问题,保持在配电网的电压幅值的高渗透率下的光伏系统。一个更紧密的版本的布尔不等式推导和使用提供一个新的联合机会约束的上限,和模拟结果表明所提出的上界的好处。

英文摘要:

Evolving power systems with increasing levels of stochasticity call for a need to solve optimal power flow problems with large quantities of random variables. Weather forecasts, electricity prices, and shifting load patterns introduce higher levels of uncertainty and can yield optimization problems that are difficult to solve in an efficient manner. Efficient solution methods for single chance constraints in optimal power flow problems have been considered in the literature; however, joint chance constraints have predominantly been solved via scenario-based approaches or by utilizing the overly conservative Boole's inequality as an upper bound. In this paper, joint chance constraints are used to solve an AC optimal power flow problem which maintain desired levels of voltage magnitude in distribution grids under high penetrations of photovoltaic systems. A tighter version of Boole's inequality is derived and used to provide a new upper bound on the joint chance constraint, and simulation results are shown demonstrating the benefit of the proposed upper bound.

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

↑