摘要
利用基于拉普拉斯谱划分的递归二分法将电力网络进行支路切割,然后将支路切割转换为节点撕裂。在转换过程中使用了一种优化的支路排序策略,以减小边界块,从而减小协调计算时间,提高并行效率。通过计算迁移节点目标函数,减小了分割的不平衡度。在IEEE标准网络上,用并行潮流算法对分割的网络进行测试计算。结果表明,该优化策略有效减小了边界块,适合电力系统并行计算。
The optimized partitioning for parallel computing of power network is researched. By means of Laplacian spectrum recursive bisection partitioning method, firstly the power network is partitioned into branch-cut form; then the branch-cut form is changed into node-split form. During the change process an optimized branch sort scheme is used to minimize border blocks; thus the time consumed in coordinative calculation is saved. By means of calculating the objective function of migrated nodes, the unbalance of partitioning is ,educed. The testing calculations for partitioned network are conducted in IEEE 118-bus system, IEEE 162-bus system and IEEE 300-bus system respectively by parallel power flow algorithm. Calculation results show that the proposed optimized partitioning strategy can reduce bordered blocks effectively, so it is proved that the proposed optimized partitioning strategy is suitable for power system parallel computing.
出处
《电网技术》
EI
CSCD
北大核心
2007年第11期42-48,共7页
Power System Technology
关键词
对角块加边
并行计算
拉普拉斯谱
网络分割
电力系统
bordered block diagram form （BBDF）
parallelcomputing
Laplacian spectrum
network partition
powersystem
