一种基于顶点分裂的电网在线故障恢复路径搜索方法

摘要

恢复路径搜索是故障恢复的基础，快速完备的路径搜索方法对于保障在线恢复系统的实用性具有重要意义。以快速搜索多路径为目标，提出一种基于顶点分裂的路径搜索方法，根据电网拓扑关系，将电网等值为子系统—开关刀闸模型，映射为顶点—边。结合顶点的连接关系，构建连接矩阵，计算顶点的度，引入顶点状态属性。根据度和属性的不同，分别对顶点进行删除、消减及分裂，完成从顶点到路径的转换；针对复杂网络，可设置路径约束条件，删除分裂所得的长路径，实现多路径的快速搜索。根据待恢复负荷数量的差异，采用不同方法生成恢复方案。使用实际电网的恢复算例验证了方法的有效性，并与宽度优先搜索、遗传算法进行对比分析，结果表明，该方法网络适应性好，易于实现，能够快速搜索多条供电路径，对在线恢复系统的实时运行具有重要价值。%Path search is the basis of fault restoration for the power grid that plays an important role in ensuring the effectiveness and practicability of the recovery system to search the effective paths quickly and completely.Aiming for rapidly searching multiple paths,a search strategy based on vertex splitting is proposed.The power grid is equivalent to a subsystem-switch model based on the topological relation.By making use of the graph theory,the equivalent model is mapped to a vertex-side model.On the above basis,construct the connection matrix and calculate the degree of the vertices,combined with the connectivity of the vertexes.According to the different degrees,adopt the vertex deleting,eliminating,splitting strategy;in consideration of the complex network,setting the path constraints and deleting the long paths to realize the recovery way search.Based on the number of outaged load vertices,take different methods to solve the recovery scheme.The effectiveness of the algorithm is demonstrated by an actual calculation.Compared with breadth first search and genetic algorithm (GA),the results show that the proposed algorithm able to solve several paths and improve the calculation efficiency is suitable for different complicated networks and feasible in online restoration of system real-time operation.