arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.08754eess.SYcs.SY
收藏

通过机会约束提高交流最优功率流的安全性

Chance Constraints for Improving the Security of AC Optimal Power Flow

Miles Lubin, Yury Dvorkin, Line Roald

AI总结:

本文提出了一种可扩展的方法,用于改进交流最优功率流(AC OPF)在风力和其他不确定发电资源预测功率注入偏差方面的解决方案。核心方法是通过机会约束优化问题,优化初始运行点和波动期间的参数化响应策略,以提高对短期偏差的鲁棒性,并通过凸二次锥规划问题解决机会约束,从而在大规模实例中高效求解。

摘要:

本文提出了一种可扩展的方法,用于改进交流最优功率流(AC OPF)在风力和其他不确定发电资源预测功率注入偏差方面的解决方案。该论文的重点是提供更鲁棒的解决方案,以优化初始运行点和波动期间的参数化响应策略。我们将此问题表述为一个机会约束优化问题。为了获得机会约束的可处理表示,我们引入了一些建模假设,并利用最近的理论结果,将问题重新表述为一个凸的二次锥规划问题,即使对于大规模实例也能高效求解。我们的实验表明,所提出的方法提高了OPF解决方案的可行性和成本性能,而额外的计算时间与单次确定性AC OPF计算的时间量级相当。

英文摘要:

This paper presents a scalable method for improving the solutions of AC Optimal Power Flow (AC OPF) with respect to deviations in predicted power injections from wind and other uncertain generation resources. The focus of the paper is on providing solutions that are more robust to short-term deviations, and which optimize both the initial operating point and a parametrized response policy for control during fluctuations. We formulate this as a chance-constrained optimization problem. To obtain a tractable representation of the chance constraints, we introduce a number of modelling assumptions and leverage recent theoretical results to reformulate the problem as a convex, second-order cone program, which is efficiently solvable even for large instances. Our experiments demonstrate that the proposed procedure improves the feasibility and cost performance of the OPF solution, while the additional computation time is on the same magnitude as a single deterministic AC OPF calculation.

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

↑