基于支路切割方法的电力系统潮流并行协调算法

A Coordinational Parallel Algorithm for Power Flow Calculation Based on Branch Cutting

在研究基于支路切割的网络分块方法的基础上,提出了一种通过切割支路实现网络分块的新算法。该算法将切割支路的潮流以虚拟负荷的形式作为协调变量对子网络之间的耦合影响进行处理,并有效地将大规模电力系统的潮流计算问题转化为若干个子网络的潮流计算问题,是一种基于电力系统潮流调度概念的准并行算法,可以方便地在PC机群上实现。该算法在IEEE 14节点、IEEE 30节点和IEEE 118 节点网络上的验算结果表明:应用该算法获得的潮流计算结果正确,切割支路的选择对算法性能存在一定影响,划分网络的具体技术措施还有待深入研究。

On the basis of researching network partitioning method based on branch cutting, a new algorithm which implements network partitioning by means of cutting branches is proposed. In this algorithm the power flows of the cut branches are taken as coordinational variables, which are expressed in the form of virtual loads, and then the influence of coupling among sub-networks are processed. The proposed algorithm can effectively transfer the power flow calculation of large scale power system into the power flow calculation of several sub-networks, so it is a quasi-parallel algorithm based on the concept of power flow dispatching and can be easily implemented on personal computer cluster. The checking computation results of applying the proposed algorithm to IEEE 14-, IEEE 30- and IEEE 118-bus test systems respectively show that the obtained power flow calculation results are correct, the selection of cut branches will influence the performance of the proposed algorithm to a certain extent, therefore it is required to deep study the concrete technical measures to partition power network.