arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.07939eess.SYcs.LGcs.SYmath.OC
收藏

动态安全约束最优潮流的神经网络编码

Neural Networks for Encoding Dynamic Security-Constrained Optimal Power Flow

Technical University of Denmark(丹麦技术大学)

Ilgiz Murzakhanov, Andreas Venzke, George S. Misyris, Spyros Chatzivasileiadis

摘要:

本文介绍了一个框架,捕捉以前棘手的优化约束,并将其转换为一个混合整数线性规划,通过使用神经网络。我们编码的可行空间的优化问题,其特征在于易于处理和难以处理的约束,例如微分方程,神经网络。利用神经网络的精确混合整数重构,我们解决了混合整数线性规划,这些规划精确地近似了最初棘手的非线性优化问题的解决方案。我们将我们的方法应用于交流最优潮流问题(AC-OPF),其中直接包括动态安全约束使得AC-OPF难以处理。我们提出的方法有可能比传统方法更具可扩展性。我们展示了我们的方法电力系统操作考虑N-1安全和小信号稳定,显示它如何能够有效地获得成本最优的解决方案,同时满足静态和动态的安全约束。

英文摘要:

This paper introduces a framework to capture previously intractable optimization constraints and transform them to a mixed-integer linear program, through the use of neural networks. We encode the feasible space of optimization problems characterized by both tractable and intractable constraints, e.g. differential equations, to a neural network. Leveraging an exact mixed-integer reformulation of neural networks, we solve mixed-integer linear programs that accurately approximate solutions to the originally intractable non-linear optimization problem. We apply our methods to the AC optimal power flow problem (AC-OPF), where directly including dynamic security constraints renders the AC-OPF intractable. Our proposed approach has the potential to be significantly more scalable than traditional approaches. We demonstrate our approach for power system operation considering N-1 security and small-signal stability, showing how it can efficiently obtain cost-optimal solutions which at the same time satisfy both static and dynamic security constraints.

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

↑