A Multilevel Domain Decomposition approach for solving time constrained Optimal Power Flow problems
A Multilevel Domain Decomposition approach for solving time constrained Optimal Power Flow problems
复制标题
解决时间约束最优潮流问题的多级域分解方法
DOI：
10.11588/emclpp.2015.04.23517
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
M. Schick
中科院分区：
文献类型：
--
作者：
P. Gerstner;V. Heuveline;M. Schick
求解时间约束最优潮流问题（TCOPF）是确定给定电网最优扩展的主要任务。当采用任何基于梯度的优化算法时，例如TCOPF的内点法或序列二次规划，主要的计算工作在于大型耦合线性系统的求解。即使对于中等规模的电力网络和几天的时间段，这些系统也可以包含数百万个方程。对应的矩阵是块三对角的，非对角块对应于跨时间耦合。在我们的工作中，我们利用这一事实，通过使用施瓦茨预处理技术结合迭代Krylov子空间方法，如GMRES并行求解线性系统。我们提出了一种方法，应用这些区域分解方法的上下文中的TCOPF问题和目前的数值实验，说明他们的行为在两个基准问题。
Solving Time Constrained Optimal Power Flow problems (TCOPF) is a major task for determining optimal extensions of a given power grid. When employing any gradient based optimization algorithm such as Interior Point Method or Sequential Quadratic Programming for TCOPF, the main computational effort lies in the solution of large and coupled linear systems. Even for medium-sized electrical networks and time periods in the range of a few days, these systems can contain several millions of equations. The corresponding matrix is block tri-diagonal with non-diagonal blocks corresponding to intertemporal couplings. In our work, we exploit this fact by using Schwarz preconditioning techniques in combination with iterative Krylov subspace methods such as GMRES for solving linear systems in parallel. We propose a way of applying these domain decomposition methods in context of TCOPF problems and present numerical experiments that illustrate their behaviour on two benchmark problems.