Power grid sub-graph division method and device based on parallel optimization

Abstract

The invention provides a power grid sub-graph division device and method based on parallel optimization, which are used for carrying out simplified division on a power grid structure, and relate graph division and parallel optimization together, firstly, according to a network topology structure of a power system, lines between devices used by the power grid are used as nodes and edges, and the parallel optimization is carried out on the nodes and the edges; forming a natural power grid topological structure diagram; a given power grid topological graph is roughly divided into a series of small sub-regions, each sub-region is divided to obtain an optimal solution, and finally, the sub-regions are restored by using a reverse algorithm to obtain an optimal division of the given graph. According to the method, power grid equipment and connecting lines are converted into a natural power grid topological graph, the power grid structure is simplified and segmented by applying a parallel optimization multi-level division method, the complicated power grid structure is simplified, the power grid equipment and lines can be better analyzed and maintained, and stable operation of a power system is guaranteed.

Description

technical field [0001] The invention relates to the field of power systems, in particular to a parallel optimization-based power grid subgraph division method and device. Background technique [0002] Nowadays, graph database technology based on "graph theory" facilitates the clear analysis of large amounts of data, so it is often used in large and complex data storage and calculation. The power grid system has a natural power grid topology graph due to its equipment and lines, so the use of graph data technology can simplify complex power grid topology relationships. However, the main advantage of the existing graph database technology lies in the iterative calculation of graph data. Although it is universal for general graph data applications, as the scale of the power grid continues to expand, the number of data nodes and connections continues to increase. In a Performing topology analysis on graphs is not only very difficult, but also inefficient. [0003] The traditio...

AI Technical Summary

Problems solved by technology

However, the main advantage of the existing graph database technology lies in the iterative calculation of graph data. Although it is universal for general graph data applications, as the scale of the power grid continues to expand, the number of data nodes and connections continues to increase. In a Topological analysis on graphs is not only very difficult, but also inefficient

[0003]The traditional geometric partitioning algorithm uses the coordinate information of vertices to divide the power grid topology map, which can efficiently divide the power grid map. However, if the power grid topology map has If the vertices are not given a detailed coordinate structure or the coordinates of the points cannot be derived from the associated coordinates, the geometric division algorithm cannot be used, and the restrictions are strict

If the KL algorithm is used for division, it is necessary to iteratively divide the initial division of the randomly generated power grid topology map. Facing the increasingly large power grid data, the efficiency is very low, and it is not easy to find a local optimal solution; in addition, the structure of the power grid system is special. Traditional geometric division may lead to a large gap in the size of the divided subgraphs, resulting in a large amount of communication consumption during parallel processing

Images