电力系统中PMU最优配置的研究

针对确定配置同步相量测量单元(PMU)的最小数目和最佳位置以达到最大的网络结构可观测性的PMU最优配置问题,提出了一种最小生成树(MST)算法,在深度优先搜索(DFS)算法的基础上提出了一种新的寻优规则,从而提高了解的质量和求解速度。该算法克服了DFS算法收敛性差和模拟退火(SA)算法收敛速度慢的缺点。算例仿真证明了利用MST算法求解PMU最优配置问题能使解的质量与求解效率达到很好的平衡,同时也可提高最优解的多样性。

Research on Optimal PMU Placement in Power Systems

For optimal placement of phasor measurement units(PMUs), i.e., determining the least number of synchronized PMUs to be placed and their optimal positions to reach the maximal observability of the network structure, a minimum spanning tree (MST) algorithm is proposed. A new optimization rule is put forward based on depth-first search (DFS) algorithm, thus the quality of solution and calculation speed are improved. Compared with traditional DFS algorithm and simulated annealing (SA) algorithm, the proposed algorithm possesses better convergency and high convergence rate. The simulation results of example systems prove that, the quality of solution and solving efficiency can be well balanced and the diversity of solution is also improved when solving optimal placement of PMU by MST algorithm.