摘要
关键输电断面的快速搜索对电网的保护与控制具有重要意义。提出一种基于聚类算法的关键输电断面快速搜索算法。综合考虑线路介数和支路潮流,作为线路权重指标,运用Dijkstra算法计算两点间最短距离,构建相似度矩阵。通过AP(affinity propagation)算法得到电网分区。在分区的基础上,运用图论中基本割集搜索理论,结合所提生成树约束条件,完成输电断面的快速搜索。最后利用断面安全裕度对输电断面的重要性排序。通过新英格兰39节点系统为例进行仿真计算,验证了所提方法的有效性。
Fast search of the key transmission sections plays an important role in the protection and control of power system. A fast search method of the key transmission sections based on clustering algorithms is proposed. The weight of lines is given considering both line betweenness and power flow. The similarity matrix can be obtained based on the shortest distance of two buses which is got through Dijkstra algorithms. Then Affinity Propagation （AP） algorithm is used to construct the partition of power grid. Based on the partition, combined with the constraints of spanning tree proposed, fast search of the transmission sections can be completed through the basic cut-sets searching theoty. Finally, key sections can be sorted according to the safety margin of the section. The analysis results of New England 39-bus standard system verify the validity of the method.
出处
《电力系统保护与控制》
EI
CSCD
北大核心
2017年第7期97-101,共5页
Power System Protection and Control
关键词
线路介数
相似度矩阵
基本割集:输电断面
安全裕度
line betweenness
similarity matrix
basic cut-sets
transmission section
safety margin
