CN113688485B - Traveling wave device configuration method and system based on topological structure layering - Google Patents
Traveling wave device configuration method and system based on topological structure layering Download PDFInfo
- Publication number
- CN113688485B CN113688485B CN202110774504.9A CN202110774504A CN113688485B CN 113688485 B CN113688485 B CN 113688485B CN 202110774504 A CN202110774504 A CN 202110774504A CN 113688485 B CN113688485 B CN 113688485B
- Authority
- CN
- China
- Prior art keywords
- distribution network
- vertexes
- power distribution
- lines
- traveling wave
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 55
- 238000010586 diagram Methods 0.000 claims abstract description 45
- 239000011159 matrix material Substances 0.000 claims description 20
- 238000010276 construction Methods 0.000 claims description 13
- 238000004364 calculation method Methods 0.000 claims description 8
- 238000009434 installation Methods 0.000 abstract description 6
- 230000005540 biological transmission Effects 0.000 description 5
- 238000005457 optimization Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000000354 decomposition reaction Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000002922 simulated annealing Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/06—Electricity, gas or water supply
Abstract
The invention discloses a traveling wave device configuration method and a traveling wave device configuration system based on topological structure layering, wherein the method comprises the following steps: based on graph theory, the power distribution network is expressed as a topological structure form of an undirected weighted graph: the method comprises the steps that branch nodes of a power supply, a transformer in a transformer area, a transformer substation and distribution lines in a distribution network represent vertexes of an undirected weighted graph, the distribution lines among the vertexes represent edges of the undirected weighted graph, the lengths of the distribution lines among the vertexes represent weights of the edges, and the obtained undirected weighted graph is a topological structure diagram of the distribution network; layering a topological structure diagram of the power distribution network by using a graph theory layering method; finding independent branch lines, symmetrical independent branch lines and a complete T-shaped branched structure in the obtained hierarchical structure diagram of the power distribution network; and (3) configuring a traveling wave device: the asymmetric independent branch lines are not provided with traveling wave devices, one of the symmetric independent branch lines is optionally not provided with traveling wave devices, and the other lines are all provided with traveling wave devices. The invention can reduce the installation quantity of the traveling wave device and can realize redundant positioning.
Description
Technical Field
The invention belongs to the technical field of fault monitoring resource allocation of a power distribution network, and particularly relates to a traveling wave device allocation method and system based on topological structure layering.
Background
In the current stage of China, the research on the configuration method of a device for positioning by utilizing fault traveling waves is mainly concentrated on a power transmission network, the structure of the current power distribution network is complex and changeable, the branches are numerous, investment is limited, the traveling wave device is difficult to install on each branch, fault branch judgment errors possibly occur after a line breaks down, even a false fault point is judged as a fault position, and the method has important practical significance on how to effectively configure the traveling wave device on the power distribution network with complex branches and considering positioning reliability and economy.
In the prior art, literature proposes an optimal configuration method for configuring traveling wave devices of substations in a power transmission network, wherein the optimal configuration method is performed according to the number of adjacent substations, and then the scheme is optimized by combining a simulated annealing algorithm, but different configuration schemes are easily generated due to the influence of artificial factors during the pre-configuration, and the subsequent calculation is complex; the freedom degree of the traveling wave transmission of the power grid is analyzed in literature, the traveling wave device is optimally configured by combining the freedom degree of the traveling wave transmission, but the positioning result of the configuration algorithm has larger error; the method comprises the steps that a shortest transmission path of a first fault wave head is analyzed based on graph theory, a Floyd algorithm is adopted to convert a complex network into a simple network according to a principle of fault line reservation, a fault point divides the line into two sets, and the minimum set is taken after fault grouping is set for all the lines to obtain an optimal scheme of device configuration, but the method needs to set faults for the whole line, and is slightly complex; taking the distribution position and the quantity selection problem of the traveling wave device as a multi-objective optimization combination problem, constructing constraint conditions through the two problems, and then solving by using a binary particle swarm algorithm to obtain the optimal configuration; firstly establishing a constraint relation according to a configuration rule, pre-configuring the installation position of a fault traveling wave device, optimizing an initial configuration scheme by adopting a genetic algorithm, and finally, if the schemes with the same configuration number of the device are obtained, performing scheme optimization according to configuration redundancy, wherein the method does not describe how to select an optimal scheme when the redundancy is the same; the method comprises the steps that a network decomposition is utilized, a complex network is decomposed into a simple tree network and a ring network, and then the optimal configuration of the device is obtained; the topological structure of the tree-type power distribution network is analyzed by utilizing the range of zero line mode time difference positioning, and the optimal configuration of the device is carried out by adopting a backward method, but the positioning is carried out by simply utilizing the difference of zero line mode wave speeds, so that the error is larger.
Most of the proposal proposed by the above documents is mainly aimed at the configuration of devices installed in a transformer substation, and for a power distribution network with a complex structure, the devices are often required to be installed on the transformer substation of a line terminal to meet the requirement of positioning precision, so that the investment cost is high and the standardized installation has certain difficulty, and therefore, the research on the distribution optimization of the traveling wave device on the power distribution network has important engineering significance for balancing the reliability and the economy.
Disclosure of Invention
In order to solve the technical problems, the invention provides a traveling wave device configuration method and a traveling wave device configuration system based on topological structure layering, which can reduce the installation quantity of a traveling wave device on the basis of ensuring the fault traveling wave positioning by using fault traveling wave signals.
In order to achieve the technical purpose, the invention adopts the following technical scheme:
a traveling wave device configuration method based on topological structure layering comprises the following steps:
step 1, representing a power distribution network into a topological structure form of an undirected weighted graph based on graph theory: the method comprises the steps that branch nodes of a power supply, a transformer in a transformer area, a transformer substation and distribution lines in a distribution network represent vertexes of an undirected weighted graph, the distribution lines among the vertexes represent edges of the undirected weighted graph, the lengths of the distribution lines among the vertexes represent weights of the edges, and the obtained undirected weighted graph is a topological structure diagram of the distribution network;
step 2, layering a topological structure diagram of the power distribution network by using a graph theory layering method to obtain a layered structure diagram of the power distribution network;
step 3, finding all independent branch lines, symmetrical independent branch lines and all complete T-shaped branched structures in a layered structure diagram of the power distribution network;
step 4, configuring a traveling wave device for the power distribution network: the asymmetric independent branch lines are not provided with traveling wave devices, one of the symmetric independent branch lines is optionally not provided with traveling wave devices, and the other lines are all provided with traveling wave devices.
Further, the layering specific process in the step 2 is as follows:
step 2.1, constructing an n-order adjacency matrix by using all n vertexes in an undirected weighted graph of the power distribution network, and taking the n-order adjacency matrix as a weight matrix of the power distribution network; wherein element a in the adjacency matrix ij The value is as follows: if i=j, then a ij =0; if a is ij If a direct-connection edge exists between two vertexes represented by a row and a is assigned to the distribution line length of the edge ij If a ij If there is no directly connected edge between two vertexes represented by the row and column, then a ij ＝∞；i＝1,2,…,n，j＝1,2,…,n；
Step 2.2, marking the vertexes represented by the power supply, the transformer substation and the transformer substation as first class vertexes, and marking the vertexes represented by the bifurcation nodes of the distribution line as second class vertexes; any first-class vertex in an undirected weighted graph of the power distribution network is arbitrarily designated as a starting node s, and i=1;
step 2.3, calculating shortest paths from the starting node to all other vertexes of the first class in the undirected weighted graph of the power distribution network based on a weight matrix of the power distribution network and by adopting a Dijkstra algorithm, and taking the shortest paths with the longest shortest paths concentrated as an ith layer structure of the power distribution network;
step 2.4, deleting a starting node and an ending node of an ith layer structure of the power distribution network, and respectively constructing 1 (i+1) th layer structure of the power distribution network according to the step 2.3 by taking each vertex remained in the ith layer structure as a starting node of each line in the (i+1) th layer structure; when calculating the shortest path, if the path comprises a node of an ith layer structure, the path does not participate in the calculation of the shortest path;
and 2.5, making i=i+1, and returning to the step 2.4 until all the first type vertexes are distributed, so as to obtain a layering structure diagram of the power distribution network.
Further, the method for calculating the shortest path in step 2.3 is as follows:
(1) Setting two different sets S and a set U, putting a starting node S into the set S, and putting the rest vertexes in the undirected weighted graph of the power distribution network and the lengths of distribution lines from the rest vertexes to the starting node S into the set U;
(2) Searching the shortest distribution line length peak k from the set U to the starting node s, and connecting the peak k and the peak k to the distribution line length a of the starting node s sk Adding the vertex k and the distribution route length thereof into a set S, and deleting the vertex k and the distribution route length thereof from the set U;
(3) Updating the line length of each vertex i in the set U to the starting node s respectively: the line length from the start node s to each vertex i in the set U is updated with vertex k: if a is si ＞a sk +a ki The line length a in the set U is then si Updated to a sk +a ki The method comprises the steps of carrying out a first treatment on the surface of the Otherwise, the line length a in the set U si Remain unchanged;
(4) Repeating the steps (2) and (3) until all vertexes are searched; the length of the distribution line from each vertex of the first type except the initial node to the initial node S in the set S is the shortest path from the initial node to each vertex of the first type in the undirected weighted graph of the distribution network.
Further, if there are a plurality of shortest paths with the same distribution line length, the shortest path including the important line is used as the i-th layer structure of the distribution network according to the distribution network line diagram.
Further, the searching method in the step 3 is as follows:
in each layer structure of the layered structure diagram of the power distribution network: if the vertexes contained in the layer structure are not the initial nodes of the next layer structure, the layer structure is an independent branch line; if the initial nodes of the two independent branch circuits are the same, the two independent branch circuits belong to symmetrical independent branch circuits;
the non-independent branch lines participate in the construction of the T-shaped branched structure, 1 independent branch line is selected from symmetrical independent branch lines to participate in the construction of the T-shaped branched structure, and the rest independent branch lines do not participate in the construction of the T-shaped branched structure; the first layer structure, each second layer structure and independent branch lines contained in the second layer structure all form 1 complete T-shaped belt branch structure.
A topology hierarchy based traveling wave device configuration system, comprising:
the topological structure construction module is used for representing the power distribution network into a topological structure form of an undirected weighted graph based on graph theory: the method comprises the steps that branch nodes of a power supply, a transformer in a transformer area, a transformer substation and distribution lines in a distribution network represent vertexes of an undirected weighted graph, the distribution lines among the vertexes represent edges of the undirected weighted graph, the lengths of the distribution lines among the vertexes represent weights of the edges, and the obtained undirected weighted graph is a topological structure diagram of the distribution network;
the layering module is used for layering the topological structure diagram of the power distribution network by using a graph theory layering method to obtain a layered structure diagram of the power distribution network;
the branch line searching module is used for finding all independent branch lines, symmetrical independent branch lines and all complete T-shaped branched structures in a layered structure diagram of the power distribution network;
the traveling wave device configuration module is used for configuring the traveling wave device for the power distribution network: the asymmetric independent branch lines are not provided with traveling wave devices, one of the symmetric independent branch lines is optionally not provided with traveling wave devices, and the other lines are all provided with traveling wave devices.
Advantageous effects
Compared with the prior art that traveling wave devices are required to be installed at the tail end of each feeder line, the topological structure layering-based traveling wave device configuration method provided by the invention does not need to install traveling wave devices at the tail ends of asymmetric independent branch lines, the traveling wave devices can be installed at any one of the symmetrical independent branch line tail ends, the traveling wave devices on the whole T-shaped band branch structure are used, and the existing traveling wave fault positioning algorithm is adopted, so that fault traveling wave positioning on branch lines without the traveling wave devices can be completed. Therefore, the invention can reduce the installation quantity of the traveling wave device.
Drawings
Fig. 1 is a circuit diagram of a 35kV distribution network in a certain area according to an embodiment of the present application;
FIG. 2 is a simplified topology diagram of the power distribution network of FIG. 1;
FIG. 3 is a hierarchical block diagram of the power distribution network circuit shown in FIG. 1;
fig. 4 is a hierarchy view of a T-belt independent branch structure of the distribution network line shown in fig. 1, where (a) is a first partially complete T-hierarchy and (b) is a second partially complete T-hierarchy.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
Example 1
The embodiment 1 provides a traveling wave device configuration method based on topological structure layering, which comprises the following steps:
step 1, representing a power distribution network into a topological structure form of an undirected weighted graph based on graph theory: the method comprises the steps that branch nodes of a power supply, a transformer in a transformer area, a transformer substation and distribution lines in a distribution network represent vertexes of an undirected weighted graph, the distribution lines among the vertexes represent edges of the undirected weighted graph, the distribution line lengths among the vertexes represent weights of the edges, and the obtained undirected weighted graph is a topological structure diagram of the distribution network;
the structure of the distribution network is complex, most of the distribution network is a radial tree structure, when the distribution network structure is analyzed based on graph theory, a distribution network power system can be regarded as a graph, the graph comprises n vertexes and b sides, and G= (V, E) is used for representing the vertex set of the graph, wherein V represents the vertex set of the graph, corresponds to the power supply, the transformer in a transformer area, the transformer substation or a bus in the distribution network, E represents the set of sides of the graph, and corresponds to the power supply line of the distribution network, such as V= { V 1 ，v 2 ，v 3 }，E＝{e 1 ，e 2 ，e 3 Edge is represented by vertices at both ends: e, e 1 ＝(v 1 ，v 2 )，e 2 ＝(v 2 ，v 3 )，e 3 ＝(v 1 ，v 3 ) The length of the edge is called in graph theoryIs "right" toIf edge (v) i ，v j ) If there is no direction, the edge is an undirected edge, and if the edges in the graph are undirected edges, the graph is called an undirected graph, and for the device configuration analysis of the traveling wave, the direction of the edge is not required to be considered, so that the graph is a typical undirected edge but has a right, and is called an undirected right graph for short.
The following figure 1 is a circuit diagram of a 35kV power distribution network in a certain area, and the figure 1 can be simplified into a topological structure form of an undirected weighted graph shown in figure 2 according to the principle of graph theory. A, B, C, C1, C2 and D, E are power distribution network substations and transformer areas; b. c, c1, c2, d1 are bifurcation nodes of the distribution line.
And step 2, layering a topological structure diagram of the power distribution network by using a graph theory layering method to obtain a layered structure diagram of the power distribution network.
In the step 2, a Dijkstra algorithm is adopted for the simplified topological structure diagram of the power distribution network to obtain the shortest path among all nodes, and then the power distribution network is layered according to the weight of the shortest path.
Dijkstra algorithm solves the problem of shortest path between any one vertex and other vertices, and can quickly and effectively obtain the shortest path between every two vertices in the weighted graph. The method is mainly characterized in that the method is extended layer by layer with the starting point as the center (breadth-first search idea) until the starting point is extended to the end point. The basic idea is as follows:
when calculating the shortest path in the topology graph from Dijkstra, a starting point s is first specified (i.e., calculation starts from a vertex s). In addition, two different sets S and U are set. The vertexes of the shortest path obtained in each step and the shortest path values of the vertexes are stored in a set S, and the vertexes of the rest of the non-obtained shortest paths and the distance length from each vertex to a starting point S are stored in the set U.
In the initial state, the set S only has a starting point S, the set U contains other vertexes except S and paths from each vertex to S, then, the vertex with the shortest path is continuously searched from the set U and put into the set S, the vertexes added into the set S and the paths thereof are correspondingly deleted in the set U, and the operation is repeated until all vertexes are searched.
The layering method is specifically applied to the method, and comprises the following steps of:
step 2.1, constructing an n-order adjacency matrix by using all n vertexes in an undirected weighted graph of the power distribution network, and taking the n-order adjacency matrix as a weight matrix of the power distribution network; wherein element a in the adjacency matrix ij The value is as follows: if i=j, then a ij =0; if a is ij If a direct-connection edge exists between two vertexes represented by a row and a is assigned to the distribution line length of the edge ij If a ij If there is no directly connected edge between two vertexes represented by the row and column, then a ij ＝∞；i＝1，2，L，n，j＝1，2，L，n；
Step 2.2, marking the vertexes represented by the power supply, the transformer substation and the transformer substation as first class vertexes, and marking the vertexes represented by the bifurcation nodes of the distribution line as second class vertexes; any one vertex of a first class in an undirected weighted graph of the power distribution network is arbitrarily designated as a starting node s, and i=1;
step 2.3, calculating shortest paths from the starting node to all other vertexes of the first class in the undirected weighted graph of the power distribution network based on a weight matrix of the power distribution network and by adopting a Dijkstra algorithm, and taking the shortest paths with the longest shortest paths concentrated as an ith layer structure of the power distribution network;
the method for calculating the shortest path in the step 2.3 is as follows:
(1) Setting two different sets S and a set U, putting a starting node S into the set S, and putting the rest vertexes in the undirected weighted graph of the power distribution network and the lengths of distribution lines from the rest vertexes to the starting node S into the set U;
(2) Searching the shortest distribution line length peak k from the set U to the starting node s, and connecting the peak k and the peak k to the distribution line length a of the starting node s sk Adding the vertex k and the distribution route length thereof into a set S, and deleting the vertex k and the distribution route length thereof from the set U;
(3) Updating the line length of each vertex i in the set U to the starting node s respectively: updating a starting node s to each vertex in the set U with vertex kLine length of i: if a is si ＞a sk +a ki The line length a in the set U is then si Updated to a sk +a ki The method comprises the steps of carrying out a first treatment on the surface of the Otherwise, the line length a in the set U si Remain unchanged;
(4) Repeating the steps (2) and (3) until all vertexes are searched; the length of the distribution line from each vertex of the first type except the initial node to the initial node S in the set S is the shortest path from the initial node to each vertex of the first type in the undirected weighted graph of the distribution network.
Step 2.4, deleting a starting node and an ending node of an ith layer structure of the power distribution network, and respectively constructing 1 (i+1) th layer structure of the power distribution network according to the step 2.3 by taking each vertex remained in the ith layer structure as a starting node of each line in the (i+1) th layer structure; when calculating the shortest path, if the path comprises a node of an ith layer structure, the path does not participate in the calculation of the shortest path;
and 2.5, making i=i+1, and returning to the step 2.4 until all the first type vertexes are distributed, so as to obtain a layering structure diagram of the power distribution network.
In the topology structure diagram of the power distribution network shown in fig. 2 in this embodiment, vertex a is designated as a start node s, and the shortest path from the start node a to each of the remaining vertices is shown in table 1:
table 1 table A shortest path weight between node and remaining nodes
The shortest path set in table 1 has a path weight of 52 for the shortest path a-b-c-d-E, i.e. its distribution line is longest, so a-b-c-d-E is the first layer structure of the distribution network, a is the start node of the first layer structure, and E is the end node of the first layer structure;
deleting the starting node A and the ending node E, taking the remaining nodes b, c and d as starting nodes of all lines of the second layer structure respectively, and constructing a shortest path weight table of each line as shown in fig. 2 to obtain 3 second layer structures: in the line taking the node B as the initial node, since other paths all comprise c or d, only the path B-B is the shortest path, and the shortest path B-B is taken as a second layer structure taking the node B as the initial node; among the lines taking the node C as the initial node, the shortest paths C-C1-C2-C, C-C1 and C-C1-C2 participate in the shortest path calculation, while the distribution lines of the shortest paths C-C1-C2-C and C-C1-C2 are longest and identical, and a more important path C-C1-C2-C is selected as a second layer structure taking C as the initial node; in the circuit taking the node D as the starting node, the shortest paths D-D1-D, D-D1-D1 and D-D1-D2 participate in the shortest path calculation, and the shortest path D-D1-D with a longer distribution circuit is selected as a second layer structure taking D as the starting node.
TABLE 2 second layer shortest path weight table
| Shortest path | Crossing point of the passage | Path weight |
| b-B | ― | 11 |
| c-c1-c2-C | c、c1 | 23 |
| c-c1-C1 | c1 | 17 |
| c-c1-c2-C2 | c1、c2 | 23 |
| d-d1-D | d1 | 16 |
| d-d1-D1 | d1 | 15 |
| d-d1-D2 | d1 | 15 |
As with the construction method of the second structure, the third layer structure is continuously allocated for the second layer structure (i.e., C-C1-C2-C and D-D1-D) with the intermediate node included: (1) Deleting the initial nodes C and C, respectively taking the remaining nodes C1 and C2 as initial nodes of each line, and constructing to obtain two third layer structures C1-C1 and C2-C2; (2) Deleting the initial nodes D and D, respectively taking the remaining node D1 as the initial node of the line, and constructing to obtain two third layer structures D1-D1 and D2-D2. The third layer shortest path weight table is shown in table 3:
table 2 third layer shortest path weight table
And obtaining a layered structure diagram of the power distribution network shown in fig. 1 according to the obtained layered structure, as shown in fig. 3.
Step 3, finding all independent branch lines, symmetrical independent branch lines and all complete T-shaped branched structures in a layered structure diagram of the power distribution network; the searching method comprises the following steps:
in each layer structure of the layered structure diagram of the power distribution network: if the nodes contained in the layer structure are not the initial nodes of the next layer structure, the layer structure is an independent branch line; if the initial nodes of the two independent branch circuits are the same, the two independent branch circuits belong to symmetrical independent branch circuits; the non-independent branch lines participate in the construction of the T-shaped branched structure, 1 independent branch line is selected from symmetrical independent branch lines to participate in the construction of the T-shaped branched structure, and the rest independent branch lines do not participate in the construction of the T-shaped branched structure; the first layer structure, each second layer structure and independent branch lines contained in the second layer structure all form 1 complete T-shaped belt branch structure.
Step 4, configuring a traveling wave device for the power distribution network: the asymmetric independent branch lines are not provided with traveling wave devices, one of the symmetric independent branch lines is optionally not provided with traveling wave devices, and the other lines are all provided with traveling wave devices.
In this embodiment, obtaining the independent branch line according to the lookup method of step 3 includes: bB. C1, C2, D1, D1D2, wherein D1 and D1D2 are symmetrical independent branch lines, so that the traveling wave device does not need to be configured on the nodes B, C, C2 and D2 according to the configuration principle of the traveling wave device in the step. For fault traveling waves on the B, C, C2 and D2 nodes, the traveling wave devices on the 2 complete-band T-shaped branch structures are used for positioning, so that the installation quantity of the traveling wave devices can be reduced.
In addition, for 2 complete T-shaped branch structures, the overlapped part, namely the independent branch bB, is a redundant positioning area, so that when the configuration condition of the traveling wave device is reduced, when the positioning device of a certain node fails, the system can still accurately position the fault.
For the 35kV power distribution network circuit diagram of a certain area shown in fig. 1 in this embodiment, a first layer of circuit and a second layer of circuit are selected as main circuit to construct a complete T-shaped structure as shown in fig. 4.
Example 2
The embodiment 2 provides a traveling wave device configuration system based on topology structure layering, which includes:
the topological structure construction module is used for representing the power distribution network into a topological structure form of an undirected weighted graph based on graph theory: the method comprises the steps that branch nodes of a power supply, a transformer in a transformer area, a transformer substation and distribution lines in a distribution network represent vertexes of an undirected weighted graph, the distribution lines among the vertexes represent edges of the undirected weighted graph, the lengths of the distribution lines among the vertexes represent weights of the edges, and the obtained undirected weighted graph is a topological structure diagram of the distribution network;
the layering module is used for layering the topological structure diagram of the power distribution network by using a graph theory layering method to obtain a layered structure diagram of the power distribution network;
the branch line searching module is used for finding all independent branch lines, symmetrical independent branch lines and all complete T-shaped branched structures in a layered structure diagram of the power distribution network;
the traveling wave device configuration module is used for configuring the traveling wave device for the power distribution network: the asymmetric independent branch lines are not provided with traveling wave devices, one of the symmetric independent branch lines is optionally not provided with traveling wave devices, and the other lines are all provided with traveling wave devices.
The working principle of each module of the system in this embodiment 2 corresponds to each step of the method in embodiment 1, and the description thereof will not be repeated here.
The above embodiments are preferred embodiments of the present application, and various changes or modifications may be made on the basis thereof by those skilled in the art, and such changes or modifications should be included within the scope of the present application without departing from the general inventive concept.
Claims (5)
1. The traveling wave device configuration method based on topological structure layering is characterized by comprising the following steps of:
step 1, representing a power distribution network into a topological structure form of an undirected weighted graph based on graph theory: the method comprises the steps that branch nodes of a power supply, a transformer in a transformer area, a transformer substation and distribution lines in a distribution network represent vertexes of an undirected weighted graph, the distribution lines among the vertexes represent edges of the undirected weighted graph, the lengths of the distribution lines among the vertexes represent weights of the edges, and the obtained undirected weighted graph is a topological structure diagram of the distribution network;
step 2, layering a topological structure diagram of the power distribution network by using a graph theory layering method to obtain a layered structure diagram of the power distribution network;
the layering specific process in the step 2 is as follows:
step 2.1, constructing an n-order adjacency matrix by using all n vertexes in an undirected weighted graph of the power distribution network, and taking the n-order adjacency matrix as a weight matrix of the power distribution network; wherein element a in the adjacency matrix ij The value is as follows: if i=j, then a ij =0; if a is ij If a direct-connection edge exists between two vertexes represented by a row and a is assigned to the distribution line length of the edge ij If a ij If there is no directly connected edge between two vertexes represented by the row and column, then a ij ＝∞；i＝1,2,…,n，j＝1,2,…,n；
Step 2.2, marking the vertexes represented by the power supply, the transformer substation and the transformer substation as first class vertexes, and marking the vertexes represented by the bifurcation nodes of the distribution line as second class vertexes; any first-class vertex in an undirected weighted graph of the power distribution network is arbitrarily designated as a starting node s, and i=1;
step 2.3, calculating shortest paths from the starting node to all other vertexes of the first class in the undirected weighted graph of the power distribution network based on a weight matrix of the power distribution network and by adopting a Dijkstra algorithm, and taking the shortest paths with the longest shortest paths concentrated as an ith layer structure of the power distribution network;
step 2.4, deleting a starting node and an ending node of an ith layer structure of the power distribution network, and respectively constructing 1 (i+1) th layer structure of the power distribution network according to the step 2.3 by taking each vertex remained in the ith layer structure as a starting node of each line in the (i+1) th layer structure; when calculating the shortest path, if the path comprises a node of an ith layer structure, the path does not participate in the calculation of the shortest path;
step 2.5, letting i=i+1, returning to step 2.4 until all the first class vertexes are distributed, and obtaining a layering structure diagram of the power distribution network;
step 3, finding all independent branch lines, symmetrical independent branch lines and all complete T-shaped branched structures in a layered structure diagram of the power distribution network;
step 4, configuring a traveling wave device for the power distribution network: the asymmetric independent branch lines are not provided with traveling wave devices, one of the symmetric independent branch lines is optionally not provided with traveling wave devices, and the other lines are all provided with traveling wave devices.
2. The method of claim 1, wherein the method of calculating the shortest path in step 2.3 is:
(1) Setting two different sets S and a set U, putting a starting node S into the set S, and putting the rest vertexes in the undirected weighted graph of the power distribution network and the lengths of distribution lines from the rest vertexes to the starting node S into the set U;
(2) Searching the shortest distribution line length peak k from the set U to the starting node s, and connecting the peak k and the peak k to the distribution line length a of the starting node s sk Adding the vertex k and the distribution route length thereof into a set S, and deleting the vertex k and the distribution route length thereof from the set U;
(3) Updating the line length of each vertex i in the set U to the starting node s respectively: the line length from the start node s to each vertex i in the set U is updated with vertex k: if a is si ＞a sk +a ki The line length a in the set U is then si Updated to a sk +a ki The method comprises the steps of carrying out a first treatment on the surface of the Otherwise, the line length a in the set U si Remain unchanged;
(4) Repeating the steps (2) and (3) until all vertexes are searched; the length of the distribution line from each vertex of the first type except the initial node to the initial node S in the set S is the shortest path from the initial node to each vertex of the first type in the undirected weighted graph of the distribution network.
3. The method according to claim 1, wherein if there are a plurality of shortest paths with the same length of distribution lines, the shortest path containing important lines is taken as an i-th layer structure of the distribution network according to the distribution network line diagram.
4. The method of claim 1, wherein the search method of step 3 is:
in each layer structure of the layered structure diagram of the power distribution network: if the nodes contained in the layer structure are not the initial nodes of the next layer structure, the layer structure is an independent branch line; if the initial nodes of the two independent branch circuits are the same, the two independent branch circuits belong to symmetrical independent branch circuits;
the non-independent branch lines participate in the construction of the T-shaped branched structure, 1 independent branch line is selected from symmetrical independent branch lines to participate in the construction of the T-shaped branched structure, and the rest independent branch lines do not participate in the construction of the T-shaped branched structure; the first layer structure, each second layer structure and independent branch lines contained in the second layer structure all form 1 complete T-shaped belt branch structure.
5. A topology hierarchy-based traveling wave device configuration system, comprising:
the topological structure construction module is used for representing the power distribution network into a topological structure form of an undirected weighted graph based on graph theory: the method comprises the steps that branch nodes of a power supply, a transformer in a transformer area, a transformer substation and distribution lines in a distribution network represent vertexes of an undirected weighted graph, the distribution lines among the vertexes represent edges of the undirected weighted graph, the lengths of the distribution lines among the vertexes represent weights of the edges, and the obtained undirected weighted graph is a topological structure diagram of the distribution network;
the layering module is used for layering the topological structure diagram of the power distribution network by using a graph theory layering method to obtain a layered structure diagram of the power distribution network;
the branch line searching module is used for finding all independent branch lines, symmetrical independent branch lines and all complete T-shaped branched structures in a layered structure diagram of the power distribution network;
the traveling wave device configuration module is used for configuring the traveling wave device for the power distribution network: the asymmetric independent branch lines are not provided with traveling wave devices, one of the symmetric independent branch lines is optionally not provided with a traveling wave device, and the other lines are provided with traveling wave devices;
the layering module utilizes a graph theory layering method to carry out layering on a topological structure diagram of the power distribution network, and the specific process comprises the following steps:
step 2.1, constructing an n-order adjacency matrix by using all n vertexes in an undirected weighted graph of the power distribution network, and taking the n-order adjacency matrix as a weight matrix of the power distribution network; wherein element a in the adjacency matrix ij The value is as follows: if i=j, then a ij =0; if a is ij If a direct-connection edge exists between two vertexes represented by a row and a is assigned to the distribution line length of the edge ij If a ij If there is no directly connected edge between two vertexes represented by the row and column, then a ij ＝∞；i＝1,2,…,n，j＝1,2,…,n；
Step 2.2, marking the vertexes represented by the power supply, the transformer substation and the transformer substation as first class vertexes, and marking the vertexes represented by the bifurcation nodes of the distribution line as second class vertexes; any first-class vertex in an undirected weighted graph of the power distribution network is arbitrarily designated as a starting node s, and i=1;
step 2.3, calculating shortest paths from the starting node to all other vertexes of the first class in the undirected weighted graph of the power distribution network based on a weight matrix of the power distribution network and by adopting a Dijkstra algorithm, and taking the shortest paths with the longest shortest paths concentrated as an ith layer structure of the power distribution network;
step 2.4, deleting a starting node and an ending node of an ith layer structure of the power distribution network, and respectively constructing 1 (i+1) th layer structure of the power distribution network according to the step 2.3 by taking each vertex remained in the ith layer structure as a starting node of each line in the (i+1) th layer structure; when calculating the shortest path, if the path comprises a node of an ith layer structure, the path does not participate in the calculation of the shortest path;
and 2.5, making i=i+1, and returning to the step 2.4 until all the first type vertexes are distributed, so as to obtain a layering structure diagram of the power distribution network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110774504.9A CN113688485B (en) | 2021-07-08 | 2021-07-08 | Traveling wave device configuration method and system based on topological structure layering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110774504.9A CN113688485B (en) | 2021-07-08 | 2021-07-08 | Traveling wave device configuration method and system based on topological structure layering |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113688485A CN113688485A (en) | 2021-11-23 |
| CN113688485B true CN113688485B (en) | 2024-02-09 |
Family
ID=78576878
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110774504.9A Active CN113688485B (en) | 2021-07-08 | 2021-07-08 | Traveling wave device configuration method and system based on topological structure layering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113688485B (en) |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102044869A (en) * | 2009-10-13 | 2011-05-04 | 上海电机学院 | Special topology analysis method and device for distribution network |
| CN103105563A (en) * | 2013-01-28 | 2013-05-15 | 山东电力集团公司济宁供电公司 | Electric power line fault traveling wave network locating method |
| WO2015196743A1 (en) * | 2014-06-25 | 2015-12-30 | 国家电网公司 | Active distribution network reconfiguration method and apparatus |
| CN106920015A (en) * | 2017-04-11 | 2017-07-04 | 东南大学 | Suitable for the most short loop method for dynamically partitioning of power distribution network reconfiguration representation |
| CN109344476A (en) * | 2018-09-20 | 2019-02-15 | 山东鲁能软件技术有限公司 | Power distribution network line chart lines branch structure generation method and device based on CIM model |
| CN109685279A (en) * | 2018-12-29 | 2019-04-26 | 广东电网有限责任公司清远英德供电局 | A kind of Complicated Distribution Network PQM optimization method based on topology degradation |
| CN110231542A (en) * | 2019-06-21 | 2019-09-13 | 海南电网有限责任公司电力科学研究院 | A kind of configuration method and system of transmission line of electricity distributed fault monitoring terminal |
| CN111783266A (en) * | 2020-06-30 | 2020-10-16 | 国网湖南省电力有限公司 | Distributed mapping system and method for single line diagram of power distribution network |
| AU2019280259A1 (en) * | 2018-06-07 | 2021-01-07 | Federation University Australia | A method of estimating the location of a fault on an electrical distribution network and an associated system |
| CN112269096A (en) * | 2020-09-22 | 2021-01-26 | 华中科技大学 | K coefficient-based power distribution network traveling wave fault positioning method, device and system |
| CN112505476A (en) * | 2020-11-13 | 2021-03-16 | 南方电网科学研究院有限责任公司 | Power distribution network fault traveling wave positioning method based on binary tree and multi-terminal time information |
| CN112966385A (en) * | 2021-03-12 | 2021-06-15 | 上海交通大学 | Method and system for identifying topology weak points of power distribution network frame |
| CN113078630A (en) * | 2020-11-20 | 2021-07-06 | 中国科学院沈阳自动化研究所 | Low-voltage distribution network topology identification method based on real-time measurement data |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10236675B2 (en) * | 2016-07-26 | 2019-03-19 | Schweitzer Engineering Laboratories, Inc. | Fault detection and protection during steady state using traveling waves |
| FR3070075B1 (en) * | 2017-08-11 | 2020-01-17 | Commissariat A L'energie Atomique Et Aux Energies Alternatives | COMPUTER-IMPLEMENTED METHOD OF RECONSTRUCTING THE TOPOLOGY OF A CABLE ARRAY USING A GENETIC ALGORITHM |
-
2021
- 2021-07-08 CN CN202110774504.9A patent/CN113688485B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102044869A (en) * | 2009-10-13 | 2011-05-04 | 上海电机学院 | Special topology analysis method and device for distribution network |
| CN103105563A (en) * | 2013-01-28 | 2013-05-15 | 山东电力集团公司济宁供电公司 | Electric power line fault traveling wave network locating method |
| WO2015196743A1 (en) * | 2014-06-25 | 2015-12-30 | 国家电网公司 | Active distribution network reconfiguration method and apparatus |
| CN106920015A (en) * | 2017-04-11 | 2017-07-04 | 东南大学 | Suitable for the most short loop method for dynamically partitioning of power distribution network reconfiguration representation |
| AU2019280259A1 (en) * | 2018-06-07 | 2021-01-07 | Federation University Australia | A method of estimating the location of a fault on an electrical distribution network and an associated system |
| CN109344476A (en) * | 2018-09-20 | 2019-02-15 | 山东鲁能软件技术有限公司 | Power distribution network line chart lines branch structure generation method and device based on CIM model |
| CN109685279A (en) * | 2018-12-29 | 2019-04-26 | 广东电网有限责任公司清远英德供电局 | A kind of Complicated Distribution Network PQM optimization method based on topology degradation |
| CN110231542A (en) * | 2019-06-21 | 2019-09-13 | 海南电网有限责任公司电力科学研究院 | A kind of configuration method and system of transmission line of electricity distributed fault monitoring terminal |
| CN111783266A (en) * | 2020-06-30 | 2020-10-16 | 国网湖南省电力有限公司 | Distributed mapping system and method for single line diagram of power distribution network |
| CN112269096A (en) * | 2020-09-22 | 2021-01-26 | 华中科技大学 | K coefficient-based power distribution network traveling wave fault positioning method, device and system |
| CN112505476A (en) * | 2020-11-13 | 2021-03-16 | 南方电网科学研究院有限责任公司 | Power distribution network fault traveling wave positioning method based on binary tree and multi-terminal time information |
| CN113078630A (en) * | 2020-11-20 | 2021-07-06 | 中国科学院沈阳自动化研究所 | Low-voltage distribution network topology identification method based on real-time measurement data |
| CN112966385A (en) * | 2021-03-12 | 2021-06-15 | 上海交通大学 | Method and system for identifying topology weak points of power distribution network frame |
Non-Patent Citations (9)
| Title |
|---|
| 基于图论的配电网故障行波定位新算法;王阳;曾祥君;黎锐烽;柳芊芊;;电力系统自动化(第18期);全文 * |
| 基于行波反演的输电线路单相接地故障重演方法;梁涵卿;高电压技术;20190131;全文 * |
| 复杂输电网中基于全网行波信息的测距装置最优配置;梁睿;徐成;王飞;程真何;沈兴来;;电工技术学报(第21期);全文 * |
| 曲广龙 ; 杨洪耕 ; 吴晓清 ; 周辉 ; .考虑电网拓扑结构的行波故障定位方法.电力系统及其自动化学报.2013,(第06期),全文. * |
| 梁睿 ; 徐成 ; 王飞 ; 程真何 ; 沈兴来 ; .复杂输电网中基于全网行波信息的测距装置最优配置.电工技术学报.2016,(第21期),全文. * |
| 王浩宇 ; 谭阳红 ; 张海霞 ; 洪亚 ; .配电网行波定位优化配置新方法.电力系统及其自动化学报.2018,(第09期),全文. * |
| 王阳 ; 曾祥君 ; 黎锐烽 ; 柳芊芊 ; .基于图论的配电网故障行波定位新算法.电力系统自动化.2012,(第18期),全文. * |
| 考虑电网拓扑结构的行波故障定位方法;曲广龙;杨洪耕;吴晓清;周辉;;电力系统及其自动化学报(第06期);全文 * |
| 配电网行波定位优化配置新方法;王浩宇;谭阳红;张海霞;洪亚;;电力系统及其自动化学报(第09期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113688485A (en) | 2021-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111695223B (en) | Network topology layout method and system | |
| CN109474023B (en) | Intelligent power distribution network section real-time updating method and system, storage medium and terminal | |
| Moreira et al. | Large-scale network layout optimization for radial distribution networks by parallel computing | |
| CN112085280A (en) | Power transmission channel path optimization method considering geographic factors | |
| CN104217579A (en) | Method for searching critical road sections of traffic networks on basis of redundancy of road section sub-networks | |
| CN113343426B (en) | Urban power distribution network line planning method and system considering real demand guidance | |
| CN113888350A (en) | Power grid planning project ordering method considering power supply reliability in transition period | |
| CN110740394B (en) | Power optical transmission network optimization method and system based on site classification business classification | |
| CN102375828A (en) | Physical storage and optimization method of power grid topology in relational database | |
| CN109101682B (en) | Road network dual topological structure establishing method | |
| CN113688485B (en) | Traveling wave device configuration method and system based on topological structure layering | |
| CN106973015A (en) | A kind of middle voltage distribution networks power line carrier communication routing algorithm | |
| CN107241273A (en) | A kind of communications ring network structure method to set up based on genetic algorithm | |
| CN111800339B (en) | Route optimization method with path number constraint in hybrid SDN scene | |
| CN108416531A (en) | A kind of automatic evaluation method of distribution automation planning design effect | |
| CN113706333A (en) | Method and system for automatically generating topology island of power distribution network | |
| CN110197302B (en) | Power distribution network planning method considering wiring mode topology constraints | |
| CN108493908B (en) | A kind of locality protection partition method considering communication constraint | |
| CN112910689B (en) | Clock network topology construction method and system | |
| CN114896746A (en) | Topology optimization method for current collection system of offshore wind farm | |
| CN107294853B (en) | Power communication network path optimization method | |
| CN112018757A (en) | General example generation method for morphological evolution of power distribution network | |
| CN112287494A (en) | Method for optimally designing network structure of ship direct-current power supply and distribution system | |
| CN111783261B (en) | Automatic regulation method for power grid graph based on geographical routing | |
| CN116683981B (en) | Low-orbit satellite path planning method based on multidimensional time-varying resource diagram |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |