CN110610059A - Method suitable for topology reduction of single-power-supply tree-shaped power distribution network - Google Patents

Method suitable for topology reduction of single-power-supply tree-shaped power distribution network Download PDF

Info

Publication number
CN110610059A
CN110610059A CN201910919612.3A CN201910919612A CN110610059A CN 110610059 A CN110610059 A CN 110610059A CN 201910919612 A CN201910919612 A CN 201910919612A CN 110610059 A CN110610059 A CN 110610059A
Authority
CN
China
Prior art keywords
distribution network
matrix
nodes
power
tree
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.)
Pending
Application number
CN201910919612.3A
Other languages
Chinese (zh)
Inventor
谭林林
卞正达
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southeast University
Original Assignee
Southeast University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Southeast University filed Critical Southeast University
Priority to CN201910919612.3A priority Critical patent/CN110610059A/en
Publication of CN110610059A publication Critical patent/CN110610059A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/06Electricity, gas or water supply

Abstract

The invention discloses a method suitable for topology restoration of a single-power-supply tree-shaped power distribution network, which is suitable for system topology restoration of a power distribution network which is arranged in a tree shape, has no looped network and supplies power to a single power supply, and belongs to the field of power systems. The method is mainly used for restoring the topology of the power distribution network system according to the voltage of each node in the power distribution network and the injected current value of the node. The method utilizes the voltage and current constraint of a single power distribution network of the power system to restore an adjacency matrix for describing the connection condition between nodes of the distribution network, then utilizes the tree diagram constraint and breadth-first search in the graph theory to check the rationality of the restored distribution network, and finally completes the check of topology restoration of the distribution network by calculating and comparing the impedance matrix of the distribution network.

Description

Method suitable for topology reduction of single-power-supply tree-shaped power distribution network
Technical Field
The invention belongs to the technical field of power systems, and particularly relates to a topology reduction method suitable for a single-power-supply tree-shaped power distribution network.
Background
With the development of national economy and the rapid increase of power demand, in the face of more and more densely organized power grids, complex power equipment, constantly changing load information, constantly changing roads and buildings, the management and maintenance of a power distribution network become more and more complicated, and the traditional manual management and manual line patrol method is more and more inattentive. The interconnection of regional power grids is more and more compact, the continuous expansion of the scale of the power grids and the complexity of the structure of the power grids increase the occurrence probability of large-area power failure accidents of the power grids. Therefore, the requirements of users on the power supply quality, safety and reliability of the power system are more and more strict. In order to avoid major power failure accidents of the power grid, the key power transmission line of the power grid is effectively identified, and the method has important theoretical and application research values.
When a network fails, the system cannot know exactly where the failure occurred. The centralized fault handling system (which comprehensively handles the faults reported by each field) has to dispatch corresponding fault handling work orders to all the fields which may cause the faults. After the maintenance centers in all fields receive the fault processing work orders, according to the important emergency degree of the work orders, people are sent to the site or are remotely processed to solve the work order problem, and processing results are fed back. Simple faults have to be processed by sending a plurality of people to the site or remotely positioning, and the efficiency is low. According to statistics, due to the lack of cross-domain fault cause correlation, the operation and maintenance field of operators has about 65% of repeated or invalid work orders.
Therefore, it is necessary to study the fault diagnosis technology. The distribution network topology structure is one of the most important state parameters for characterizing the system, and plays an important role in monitoring, maintaining, resource distribution and other works of the distribution network. The method has the advantages that the running state of the power distribution network is comprehensively mastered, the correct topological structure of the power distribution network is fully known, and the method is a precondition and basis for power distribution network system management, state estimation calculation and fault diagnosis.
Disclosure of Invention
The invention aims to provide a method suitable for topology reduction of a single-power-supply tree-shaped power distribution network, which is suitable for system topology reduction of a power distribution network which is arranged in a tree shape, has no looped network and supplies power to a single power supply.
The method provided by the invention is used for solving the problems that the design drawing is incomplete, part of the design drawing is lost, the field line framework and topology are inconsistent with those drawn in the drawing and the like caused by uncontrollable accidents such as data loss, design construction disjunction, and non-updated transformation drawing in the power distribution network planning process by mainly injecting current into the voltage and the nodes of each node in the network.
The technical scheme adopted by the invention is as follows:
a method suitable for topology reduction of a single-power-supply tree-shaped power distribution network comprises the following steps:
step 1: data preprocessing, namely classifying the nodes according to the magnitude of the current value, facilitating later calculation, and dividing the nodes into two types, namely processed nodes and unprocessed nodes to generate a blank adjacency matrix;
step 2: taking out the node with the maximum voltage from the unprocessed nodes as a first calculation point, setting i as 1, and jumping to the step 4;
and step 3: taking out one point k in the unprocessed nodes, and setting i to be 1;
and 4, step 4: assuming that the unprocessed node has I lower nodes, the combination of all the I nodes is calculated by permutation and combination, and the current and I of the nodes are calculatedsumAnd comparing one by one;
if Isum-IlEpsilon is less than or equal to | is less than or equal to; wherein ε is a positive number and | Ul|>max|UnI, representing the lines connected with the upper and lower levels on the adjacent matrix, and carrying out the next step; otherwise, repeating the step 4;
and 5: if the set of unprocessed nodes has elements, the next step is carried out if no elements exist, otherwise, the step 3 is returned;
step 6: checking whether the adjacency matrix meets the tree diagram constraint and the connectivity constraint, calculating the impedance matrix of the adjacency matrix through the adjacency matrix after topology restoration, comparing the impedance matrix with the impedance matrix of the network to be tested, outputting the adjacency matrix if the impedance matrix meets the tree diagram constraint and the connectivity constraint, otherwise, deleting the improper scheme, and returning to the step 4.
The invention is further improved in that: the adjacency matrix in the step 1 is a matrix representing the adjacent relation between the vertexes; when the graph to be studied is a directed graph, the direction is determined by the flow direction of the current, and the matrix A is a Boolean matrix, namely, the elements in the matrix only contain 0 and 1;
if there is a line between i and j and the current flows from i to j, the element a in the matrix Aij1, and ajiThe diagonal elements are collectively defined as 0.
The invention is further improved in that: in the step 4, the voltage and current relation of the power distribution network with single power supply input and without a ring network is determined according to the formula (1):
wherein, UlIs the upper node voltage, UnIs the lower node voltage; i issumIs the sum of the lower node currents;is the injection current of the ith subordinate node, IlInjecting current into the upper node.
The invention is further improved in that: the tree-like graph constraint in step 6 is the definition in graph theory, and for graph G, G is a treeG is connected and epsilon is v-1, wherein epsilon is the number of connecting branches and v is the number of nodes of the tree.
The invention is further improved in that: in the step 6, the connectivity constraint adopts breadth-first search as a connectivity judgment method; the Breadth-First Search (BFS) is a graph-based basic Search method that searches graphs in a hierarchical progressive Search manner. The searching method is simple and wide in application range, and can directly carry out comprehensive and systematic expansion search on the whole graph without expecting or estimating possible position nodes until all the nodes are accessed or a result is found.
The invention is further improved in that: in the step 6, a distribution network impedance matrix is calculated according to the formula (2):
wherein z isijThe impedance value of the line between the point i and the point j; u shapeijIs the voltage difference between the point i and the point j; i isjIs the current flowing into point j.
Description of the drawings:
FIG. 1 is a 33 node power distribution network topology;
fig. 2 is a topology diagram of the power distribution network with restored topology.
Detailed Description
The embodiment provides a method suitable for topology restoration of a single-power-supply tree-shaped power distribution network, which comprises the following steps of:
step 1: data preprocessing, namely classifying the nodes according to the magnitude of the current value, facilitating later calculation, and dividing the nodes into two types, namely processed nodes and unprocessed nodes to generate a blank adjacency matrix;
the adjacency matrix in the step 1 is a matrix representing the adjacent relation between the vertexes; when the graph to be studied is a directed graph, the direction is determined by the flow direction of the current, and the matrix A is a Boolean matrix, namely, the elements in the matrix only contain 0 and 1;
if there is a line between i and j and the current flows from i to j, the element a in the matrix Aij1, and ajiThe diagonal elements are collectively defined as 0.
Step 2: taking out the node with the maximum voltage from the unprocessed nodes as a first calculation point, setting i as 1, and jumping to the step 4;
and step 3: taking out one point k in the unprocessed nodes, and setting i to be 1;
and 4, step 4: assuming that the unprocessed node has I lower nodes, the combination of all the I nodes is calculated by permutation and combination, and the current and I of the nodes are calculatedsumAnd comparing one by one;
if Isum-IlEpsilon is less than or equal to | is less than or equal to; wherein ε is a positive number and | Ul|>max|UnI, representing the lines connected with the upper and lower levels on the adjacent matrix, and carrying out the next step; otherwise, repeating the step 4;
in the step 4, the voltage and current relation of the power distribution network with single power supply input and without a ring network is determined according to the formula (1):
wherein, UlIs the upper node voltage, UnIs the lower node voltage; i issumIs the sum of the node currents of the lower stages;Is the injection current of the ith subordinate node, IlInjecting current into the upper node.
And 5: if the set of unprocessed nodes has elements, the next step is carried out if no elements exist, otherwise, the step 3 is returned;
step 6: checking whether the adjacency matrix meets the tree diagram constraint and the connectivity constraint, calculating the impedance matrix of the adjacency matrix through the adjacency matrix after topology restoration, comparing the impedance matrix with the impedance matrix of the network to be tested, outputting the adjacency matrix if the impedance matrix meets the tree diagram constraint and the connectivity constraint, otherwise, deleting the improper scheme, and returning to the step 4.
Wherein the tree-like graph constraint in step 6 is a definition in graph theory, and for graph G, G is a treeG is connected and epsilon is v-1, wherein epsilon is the number of connecting branches and v is the number of nodes of the tree.
In the step 6, the connectivity constraint adopts breadth-first search as a connectivity judgment method; the Breadth-First Search (BFS) is a graph-based basic Search method that searches graphs in a hierarchical progressive Search manner. The searching method is simple and wide in application range, and can directly carry out comprehensive and systematic expansion search on the whole graph without expecting or estimating possible position nodes until all the nodes are accessed or a result is found.
Wherein, in the step 6, the impedance matrix of the power distribution network is calculated according to the formula (2):
wherein z isijThe impedance value of the line between the point i and the point j; u shapeijIs the voltage difference between the point i and the point j; i isjIs the current flowing into point j.
Example 1
Taking the 33-node power distribution network shown in fig. 1 as an example, the system is a 33-node 32-line system, and to ensure the universality of the method, the 33-node power distribution network is a randomly generated tree-shaped ring-free network and is a power distribution network supplied by a single power supply, and the voltage and current parameters of each node are shown in table 1, and the method suitable for topology restoration of the single-power-supply tree-shaped power distribution network comprises the following steps:
TABLE 1 distribution network nodes Voltage and injection Current
(1) Data preprocessing, namely classifying the nodes according to the magnitude of the current value, facilitating later calculation, and dividing the nodes into two types, namely processed nodes and unprocessed nodes to generate a blank adjacency matrix;
(2) taking out the node with the maximum voltage from the unprocessed nodes as a first calculation point, setting i as 1, and jumping to the step 4;
(3) taking out one point k in the unprocessed nodes, and setting i to be 1;
(4) assuming that the unprocessed node has I lower nodes, the combination of all the I nodes is calculated by permutation and combination, and the current and I of the nodes are calculatedsumAnd compared one to one. If Isum-Il| ≦ ε (where ε is a positive number) and | Ul|>max|UnI, representing the lines connected with the upper and lower levels on the adjacent matrix, and carrying out the next step; otherwise, repeating the step 4;
(5) if the set of unprocessed nodes has elements, the next step is carried out if no elements exist, otherwise, the step III is returned;
the final generated adjacency matrix is as follows:
(6) checking whether the adjacency matrix meets the tree diagram constraint and the connectivity constraint, and calculating that the sum of all elements of the whole matrix is 32 and accords with the tree diagram constraint; the connectivity of the graph is proved through a breadth-first search algorithm, and the graph is connected because each node can be searched. The power grid topology is drawn according to the adjacency matrix, and as shown in fig. 2, since the node serial numbers are rearranged, whether the topology restoration is successful cannot be immediately judged. Therefore, in order to detect whether the topology to be detected is restored or not more clearly, the restored nodes are marked with the serial numbers of the nodes in fig. 1, and then the impedance of the nodes is obtained according to the formula (2), and the impedance ratio is shown in table 2:
TABLE 2 comparison table of impedance of each branch and reduced impedance of original calculation example
The process suitable for topology reduction of the single-power-supply tree-shaped power distribution network is completed through Matlab simulation software programming, and the result is shown in Table 2.

Claims (6)

1. A method suitable for topology reduction of a single-power-supply tree-shaped power distribution network is characterized by comprising the following steps:
step 1: data preprocessing, namely classifying the nodes according to the magnitude of the current value, facilitating later calculation, and dividing the nodes into two types, namely processed nodes and unprocessed nodes to generate a blank adjacency matrix;
step 2: taking out the node with the maximum voltage from the unprocessed nodes as a first calculation point, setting i as 1, and jumping to the step 4;
and step 3: taking out one point k in the unprocessed nodes, and setting i to be 1;
and 4, step 4: assuming that the unprocessed node has I lower nodes, the combination of all the I nodes is calculated by permutation and combination, and the current and I of the nodes are calculatedsumAnd comparing one by one;
if Isum-IlEpsilon is less than or equal to | is less than or equal to; wherein ε is a positive number and | Ul|>max|UnI, representing the lines connected with the upper and lower levels on the adjacent matrix, and carrying out the next step; otherwise, repeating the step 4;
and 5: if the set of unprocessed nodes has elements, the next step is carried out if no elements exist, otherwise, the step 3 is returned;
step 6: checking whether the adjacency matrix meets the tree diagram constraint and the connectivity constraint, calculating the impedance matrix of the adjacency matrix through the adjacency matrix after topology restoration, comparing the impedance matrix with the impedance matrix of the network to be tested, outputting the adjacency matrix if the impedance matrix meets the tree diagram constraint and the connectivity constraint, otherwise, deleting the improper scheme, and returning to the step 4.
2. The method for topology restoration of the single-power-supply tree-shaped power distribution network according to claim 1, wherein the adjacency matrix in the step 1 is a matrix representing an adjacent relationship between vertexes; when the graph to be studied is a directed graph, the direction is determined by the flow direction of the current, and the matrix A is a Boolean matrix, namely, the elements in the matrix only contain 0 and 1;
if there is a line between i and j and the current flows from i to j, the element a in the matrix Aij1, and ajiThe diagonal elements are collectively defined as 0.
3. The method for topology restoration of the single power supply tree-shaped power distribution network according to claim 1, wherein in the step 4, the voltage and current relationship of the power distribution network with single power supply input and no looped network is determined according to equation (1):
wherein, UlIs the upper node voltage, UnIs the lower node voltage; i issumIs the sum of the lower node currents;is the injection current of the ith subordinate node, IlInjecting current into the upper node.
4. The method according to claim 1, wherein the tree-shaped graph constraint in step 6 is defined in graph theory, and for graph G, G isAnd ═ v-1, where ε is the number of connecting branches and v is the number of nodes in the tree.
5. The method for topology restoration of the single-power-supply tree-shaped power distribution network according to claim 1, wherein in the step 6, the connectivity constraint adopts breadth-first search as a connectivity determination method; BFS is a graph-based basic search method, and searches graphs in a hierarchical progressive search mode.
6. The method for topology restoration of the single power supply tree-shaped power distribution network according to claim 1, wherein in the step 6, the impedance matrix of the power distribution network is calculated according to the formula (2):
wherein z isijThe impedance value of the line between the point i and the point j; u shapeijIs the voltage difference between the point i and the point j; i isjIs the current flowing into point j.
CN201910919612.3A 2019-09-26 2019-09-26 Method suitable for topology reduction of single-power-supply tree-shaped power distribution network Pending CN110610059A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910919612.3A CN110610059A (en) 2019-09-26 2019-09-26 Method suitable for topology reduction of single-power-supply tree-shaped power distribution network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910919612.3A CN110610059A (en) 2019-09-26 2019-09-26 Method suitable for topology reduction of single-power-supply tree-shaped power distribution network

Publications (1)

Publication Number Publication Date
CN110610059A true CN110610059A (en) 2019-12-24

Family

ID=68893737

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910919612.3A Pending CN110610059A (en) 2019-09-26 2019-09-26 Method suitable for topology reduction of single-power-supply tree-shaped power distribution network

Country Status (1)

Country Link
CN (1) CN110610059A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104810829A (en) * 2015-05-26 2015-07-29 中国电力科学研究院 Network structure simplification processing method for power distribution network reconstruction
CN106650025A (en) * 2016-11-25 2017-05-10 南方电网科学研究院有限责任公司 Method and system for judging radiation topology constraint of multipower distribution network
CN107508280A (en) * 2017-08-08 2017-12-22 国网宁夏电力公司电力科学研究院 A kind of reconstruction method of power distribution network and system
CN107591842A (en) * 2017-10-27 2018-01-16 南京南瑞继保电气有限公司 One kind station domain island detection method
CN107994582A (en) * 2017-10-24 2018-05-04 中国南方电网有限责任公司电网技术研究中心 Reconstruction method of power distribution network and system containing distributed generation resource

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104810829A (en) * 2015-05-26 2015-07-29 中国电力科学研究院 Network structure simplification processing method for power distribution network reconstruction
CN106650025A (en) * 2016-11-25 2017-05-10 南方电网科学研究院有限责任公司 Method and system for judging radiation topology constraint of multipower distribution network
CN107508280A (en) * 2017-08-08 2017-12-22 国网宁夏电力公司电力科学研究院 A kind of reconstruction method of power distribution network and system
CN107994582A (en) * 2017-10-24 2018-05-04 中国南方电网有限责任公司电网技术研究中心 Reconstruction method of power distribution network and system containing distributed generation resource
CN107591842A (en) * 2017-10-27 2018-01-16 南京南瑞继保电气有限公司 One kind station domain island detection method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
杨思敏: "以短路电流均衡化为目标的配电网重构研究", 《中国优秀硕士学位论文全文数据库》 *

Similar Documents

Publication Publication Date Title
CN110619386B (en) TMR operation monitoring and fault intelligent research and judgment method and system
CN100438251C (en) A large electric system vulnerable line identifying method
CN107622360A (en) A kind of critical circuits recognition methods for considering subjective and objective factor
CN105184394A (en) On-line data mining optimized control method based on cyber physical system (CPS) of power distribution network
CN106056466B (en) Bulk power grid critical circuits recognition methods based on FP-growth algorithm
CN112966385A (en) Method and system for identifying topology weak points of power distribution network frame
He et al. Fault diagnosis and location based on graph neural network in telecom networks
Liang et al. Resilience-based sequential recovery planning for substations subjected to earthquakes
CN111160716A (en) Large power grid vulnerability assessment method based on tidal current betweenness
CN104680431A (en) Reliability assessment method for intelligent substation secondary system
CN109523422A (en) A kind of method for digging of distribution network failure influence factor
CN116415002B (en) Power grid fault recovery error-proof checking method based on graph matching
Rosato et al. Influence of the topology on the power flux of the Italian high-voltage electrical network
CN110610059A (en) Method suitable for topology reduction of single-power-supply tree-shaped power distribution network
CN115542070A (en) Distribution network line fault positioning method and storage medium
Ma et al. A probabilistic cascading failure model for dynamic operating conditions
CN114239206A (en) Post-disaster circuit-circuit cooperative repair method, system and equipment based on reinforcement learning
CN114567562A (en) Method for identifying key nodes of coupling network of power grid and communication network
Li et al. Distributed Fault Section Location for Active Distribution Network Based on Bayesian Complete Analytic Model
Ye et al. A novel method for determining minimum break point set based on network reduction and relays incidence matrix
Beyza et al. Cascading failures in coupled gas and electricity transmission systems
Juneja et al. Fuzzy Petri Net Model of Phasor Measurement Unit
CN110048422B (en) Rapid reliability evaluation method for power distribution network
Wang et al. Chain rule for extracting resilience procurement costs from locational marginal prices
Qian et al. Fault Diagnosis Combining Power Grid and Communication System Based on Graph Neural Network

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