CN117060378A - Load power supply path tracking method based on breadth-first search spanning tree - Google Patents
Load power supply path tracking method based on breadth-first search spanning tree Download PDFInfo
- Publication number
- CN117060378A CN117060378A CN202310836772.8A CN202310836772A CN117060378A CN 117060378 A CN117060378 A CN 117060378A CN 202310836772 A CN202310836772 A CN 202310836772A CN 117060378 A CN117060378 A CN 117060378A
- Authority
- CN
- China
- Prior art keywords
- node
- power supply
- bus
- breadth
- nodes
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 58
- 230000005540 biological transmission Effects 0.000 claims description 9
- 239000011159 matrix material Substances 0.000 claims description 8
- 238000003825 pressing Methods 0.000 claims description 3
- 238000013480 data collection Methods 0.000 claims description 2
- 238000007781 pre-processing Methods 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 abstract description 8
- 238000010845 search algorithm Methods 0.000 abstract description 5
- 238000012360 testing method Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 9
- 238000012546 transfer Methods 0.000 description 6
- 238000004422 calculation algorithm Methods 0.000 description 3
- 101100128621 Caenorhabditis elegans bus-18 gene Proteins 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000007717 exclusion Effects 0.000 description 2
- 230000009191 jumping Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 238000004804 winding Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000003990 capacitor Substances 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- 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—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for ac mains or ac distribution networks
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
- H02J2203/10—Power transmission or distribution systems management focussing at grid-level, e.g. load flow analysis, node profile computation, meshed network optimisation, active network management or spinning reserve management
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
- H02J2203/20—Simulating, e g planning, reliability check, modelling or computer assisted design [CAD]
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- Marketing (AREA)
- Tourism & Hospitality (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Public Health (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Water Supply & Treatment (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Power Engineering (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The application discloses a load power supply path tracking method based on breadth-first search spanning tree. In order to solve the problem that the calculation of the existing load power supply path tracking method is complex and the unnecessary operation time is increased, the method comprises the steps of collecting data and carrying out abstract pretreatment on nodes and branches of a power grid to form a topological graph; tracking nodes covered by a required power supply path in a topological graph, and generating a tree by using a breadth-first method; after the tree is output, triggering is carried out from a preset tracing node, traversing is carried out along the nodes in the tree until the tracing is finished after the balancing node positioned at the first layer is traced, and the searched information is output to generate a power supply path. According to the method, each node is accessed only once through the breadth-first search algorithm, efficient power supply tracking is performed, a load power supply path is rapidly found out, and the power supply reliability of a power system is further improved.
Description
Technical Field
The application relates to the technical field of power systems, in particular to a load power supply path tracking method based on breadth-first search spanning tree.
Background
The novel power system is continuously developed, the ratio of new energy sources such as wind power, photovoltaic and the like in a power grid is gradually increased, and the scale and the complexity of the power grid are increased. Along with the increasing scale of the power grid, the number of nodes in the power grid is increased, and the power supply path of the load is also increasingly complex, so that an efficient path searching method is imperative to track the power supply path of the power supply. The power network and the abstract network in the graph theory have similar properties, so that the topology searching method in the graph theory can be applied to the operation analysis of the power grid. For the above situation, most of the existing tracking methods employ a depth-first algorithm in a matrix calculation method or a tree search method. However, the matrix calculation method takes more time when the full-connected matrix of the topology is obtained because the matrix order is too large; the depth-first search algorithm starts from a certain node, searches all along the branch between the nodes adjacent to the node until the end node is searched, then backtracks the searching path, searches for new branches, and some nodes can be accessed for multiple times, so that the overhead of the algorithm is increased.
For example, a "high-voltage distribution network load transfer method based on power supply path logic search" disclosed in chinese patent literature, its publication number CN105071395B, includes: obtaining a topological graph of a current power distribution network; judging whether load overload exists at a power supply point in the current power distribution network or not: obtaining a direction constraint set, a mutual exclusion constraint set and a sequential constraint set formed by closed loop paths of all power points through depth search; when carrying out load transfer operation on a power point with overload load on a transfer path, the method needs to simultaneously meet a direction constraint set, a mutual exclusion constraint set and a sequential constraint set on the closed loop path; judging whether the load overload power supply point finishes load transfer in the number of times of the pre-transfer operation: and if the load transfer target is not completed, carrying out load shedding operation on the power supply point with overload load. The scheme can form constraint on the closed loop path of the power supply point and realize search, but a depth-first algorithm is mainly adopted, so that the condition that a single node is accessed for multiple times is easily generated, the calculation cost is possibly increased, and the scheme has the defect.
Disclosure of Invention
The application mainly solves the problem that the calculation of the existing load power supply path tracking method is complex, so that the unnecessary running time is increased; providing a load power supply path tracking method based on breadth-first search spanning tree, wherein after topology processing is carried out on a power grid, the breadth-first search spanning tree is adopted, and on the basis of the spanning tree, a power supply path of the load is searched along the tree from a formulated load node; through testing the standard power distribution network test node, the standard power transmission network test node and a certain actual power grid, the calculation result shows that the time consumption is very little, the auxiliary information of the load power supply path can be provided for power grid operators, and the workload of the operators is obviously reduced.
The technical problems of the application are mainly solved by the following technical proposal:
the application comprises the following steps: collecting data and carrying out abstract pretreatment on nodes and branches of a power grid to form a topological graph; tracking nodes covered by a required power supply path in a topological graph, and generating a tree by using a breadth-first method; after the tree is output, triggering is carried out from a preset tracing node, traversing is carried out along the nodes in the tree until the tracing is finished after the balancing node positioned at the first layer is traced, and the searched information is output to generate a power supply path. According to the method, each node is accessed only once through the breadth-first search algorithm, efficient power supply tracking is performed, a load power supply path is rapidly found out, and the power supply reliability of a power system is further improved.
Preferably, the data collection process includes, but is not limited to, collecting grid node and branch data required for generating a topology map; the abstract preprocessing process comprises information of associating the power grid node with the branch data, and generating the information into the same topological graph. The power grid forms a network system together with a generator, a transformer, a power line and a load through a preset connection mode, equipment in the power grid is abstracted into nodes and branches in a graph theory through a graph theory method, and the topological structure of the power grid is analyzed independently under the condition that other attributes of the equipment are ignored. According to the method, the equipment in the power grid is processed into two abstract models, namely the node model and the branch model, so that the analysis efficiency of each equipment in the power grid is remarkably improved, and the calculation time is saved.
Preferably, the breadth-first method for spanning tree includes: setting the initial node for starting searching as fNode, and setting the layer number of the initial node as frLayer; accessing a first node tNode of an adjacent node queue of an initial node fNode, and pressing the tNode into a queue to be accessed; judging whether the layer number of the tNode is empty or not, if so, continuously judging again, and if not, calculating the layer number of the tNode; and setting the branch attributes of the fNode to the tNode as radial branches to obtain a layer number toLayer=frLayer+1 where the tNode is located. The use of the queue in the process has the advantages that the repeated access of a single node or a single branch is effectively avoided, and the access efficiency is remarkably improved; in addition, the queue can store all the accessed adjacent vertexes, so that the access record searchability is increased, timely examination and correction can be performed when an access error occurs, and the path finding accuracy is improved.
Preferably, the breadth-first method for spanning tree further comprises: judging that if the branch attributes from the fNode to the tNode are tree branches, not changing the attributes; otherwise, setting the connection branch; deleting the tNodes from the queues of the adjacent nodes of the fNodes, and judging whether the adjacent nodes of the fNodes are accessed completely or not; and repeatedly accessing the tNode if the access is not completed, completing subsequent circulation until all adjacent nodes are accessed, and judging the empty queue. And the different branches are classified, so that the next access path is conveniently determined, and the formed path is correctly judged when the search path is formed.
Preferably, the breadth-first method for spanning tree further comprises: the queue empty judgment is the empty judgment of the access queue, if the queue is not empty, the first node in the queue is set as an initial node fNode, and the fNode is deleted in the queue; and outputting the searched tree until the queue is empty. After the queue empty judgment is carried out, all relevant nodes can be effectively ensured to be accessed, and the wrong access and missed access of the nodes and the branches can be avoided, so that the searching accuracy is improved.
Preferably, the method further comprises: based on a chain storage mode, n single-chain tables with head nodes are set to replace n rows of an adjacency matrix to form an adjacency table, a single-chain table with head nodes is built for each vertex v in a topological graph, relevant information of the vertex v is stored in the table head, and other vertexes in the single-chain table are used for storing information of edges relevant to the vertex v, including but not limited to numbers of adjacent points and weights of corresponding edges. Considering the network topology formed by the actual power grid, the number of edges is far less than the square of the number of vertexes, so that the network topology is a sparse graph structure; and selecting the adjacency list to store the graph can obviously increase the solving speed and improve the graph storage efficiency.
Preferably, the single-chain table header node includes a data field data and a pointer field first, the pointer field points to the first adjacent vertex, if there is no adjacent point, the pointer is set to be empty, and all vertex pointer fields need to be set to be empty during initialization; the single-chain list edge node comprises an adjacent point domain adjvex, a data domain info and a chain domain next; wherein the adjacency point field points to a vertex adjacent to the table head node; the data field indicates information of the edge including, but not limited to, weights; the chain field indicates the next vertex next to vertex v. The table has independence and irreversibility when being accessed, so that single access to the nodes and the branches can be realized, in addition, the storage space can be set, and the data can be contained by setting the proper storage space, so that the storage consumption is reduced, and the running trend is grasped more accurately.
Preferably, the method further comprises: in the breadth-first search method spanning tree process: starting to search downwards layer by layer from a balance node of the power transmission network, wherein the balance node is positioned at the 0 th layer; the known power distribution network is provided with at least one power supply, so that all power supply nodes are used as initial search nodes, namely in the 0 th layer, all power supplies are respectively traversed to be used as initial nodes to start searching, and finally the searched trees are combined and output. The arrangement can ensure that any power supply node is not missed in searching, and the corresponding power supply path is completely obtained.
The beneficial effects of the application are as follows:
1. according to the load power supply path tracking method based on breadth-first search spanning tree, which is disclosed by the application, the breadth-first search spanning tree is adopted, each node in the tree is accessed only once, efficient power supply tracking is performed, the load power supply path can be found out European and fast, and the power supply reliability of a power system is further improved;
2. the application relates to a load power supply path tracking method based on breadth-first search spanning tree, which adopts a queue mode to store all accessed adjacent vertexes; the network topology graph is stored in the form of the adjacency list, the storage and solving efficiency can be improved by the mode, repeated access of single nodes or branches is effectively prevented, and the operation efficiency is remarkably improved.
Drawings
FIG. 1 is a flow chart of a breadth-first spanning tree search based load power path tracing method in accordance with the present application;
FIG. 2 is a schematic diagram of a breadth-first spanning tree search based load power path tracing method in accordance with the present application;
FIG. 3 is a simple network topology of embodiment 1 of the present application;
fig. 4 is a diagram of an adjacency list configuration corresponding to a simple network diagram in embodiment 1 of the present application;
FIG. 5 is a topology of an IEEE-33 node test system of embodiment 2 of the application;
FIG. 6 is a schematic diagram of the power supply path of the traceback bus-33 of embodiment 2 of the present application;
FIG. 7 is a topology of an IEEE-30 node test system of embodiment 2 of the application;
fig. 8 is a schematic diagram of the power supply path of the traceback Bus-26 of embodiment 2 of the present application.
Detailed Description
The technical scheme of the application is further specifically described below through examples and with reference to the accompanying drawings.
Example 1:
a load power supply path tracking method based on breadth-first search spanning tree in the embodiment, as shown in figure 2, includes S1, collecting data and carrying out abstract pretreatment on nodes and branches of a power grid to form a topological graph; s2, tracking nodes covered by a required power supply path in a topological graph, and generating a tree by using a breadth-first method; s3, after the tree is output, triggering from a preset tracking node, traversing along the nodes in the tree until the balance node at the first layer is tracked, and outputting the searched information to generate a power supply path.
The specific flow is shown in figure 2:
s101: collecting power grid parameters;
s102: nodes and branches of the power grid are determined, and the power grid is abstracted into a graph.
S2: determining a node needing to track a power supply path of a power supply, and generating a tree by using a breadth-first method, wherein the specific steps are as follows:
s201: starting searching from an initial node fNode, wherein the layer number is frLayer;
s202: accessing a first node tNode of an adjacent node queue of the fNode, and pressing the tNode into a queue to be accessed; s203: is the layer number of the adjacent node empty? If not, jumping to S203, otherwise jumping to S204;
s204: setting branch attributes from fNode to tNode as radial tree branches, wherein the layer number of tNode is tolayer=frlayer+1; s205: if the branch attribute from the fNode to the tNode is a tree branch, the attribute is not changed; otherwise, setting the connection branch;
s206: and deleting the tNodes from the queues in the adjacent nodes of the fNodes, and judging whether the adjacent nodes of the fNodes are accessed completely or not. If not, go to S306, otherwise go to S307;
s207: go to S302 to continue the cycle;
s208: it is determined whether the queue is empty. Not idling to S309, otherwise, transition to S310;
s209: setting a first node in the queue as an initial node fNode, and deleting the fNode in the queue;
s210: outputting the searched tree.
S201: starting from the node needing to track the power supply path of the power supply, traversing the tree layer by layer along the searched tree, and ending the search until the balance node positioned at the first layer is tracked;
s302: outputting the searched power supply path.
The device is processed into the following two abstract models:
(1) A class of nodes, representing nodes in a network graph. The system comprises single-port active equipment and electrical connection points between the equipment, wherein the active equipment comprises buses, loads, generators and the like;
(2) And the branch class represents two-port branches of the network diagram. The three-port device comprises single-port devices (such as a parallel capacitor and a parallel reactor, which can be equivalently a branch circuit with one end grounded), double-port devices (such as a closed switch and a disconnecting link, a circuit, a double-winding transformer and a series reactor, which can be equivalently a branch circuit with two ports), and three-port devices (such as a three-winding transformer, which can be equivalently three branch circuits distributed in a Y shape).
When only the topology constraints of the network are studied, the physical characteristics of the network elements are insignificant and the network can be abstracted into a graph. Graph G (v, e) is made up of a series of Vertex vertexes and Edge edges connecting the vertices.
The breadth-first search algorithm in step S2 uses a queue in the spanning tree process, and the benefit of using the queue is that repeated access can be avoided, and each adjacent vertex which has been accessed can be stored. Meanwhile, the network topology formed by the actual power grid is considered, the number of edges is far smaller than the square of the number of vertexes, and therefore the network topology is a sparse graph structure. Because of the sequential storage structure of the adjacency matrix, the memory space is allocated in advance, which easily leads to overflow or waste of space.
In order to increase the solving speed and improve the efficiency of graph storage, the method selects the adjacency list to store the graph. An adjacency list is a chain-type storage structure. Setting n single-chain tables with head nodes to replace n rows of an adjacent matrix, establishing a single-chain table with head nodes for each vertex v in the topological graph, storing the related information of the vertex v in the table head, and storing the information of the sides related to the vertex v in the table by the rest vertexes including but not limited to the numbers of the adjacent points and the weights of the corresponding sides. The structure is a table head node [ data, first ] and an edge node [ adjvex, info, next ].
The header node comprises a data field data and a pointer field first, wherein the pointer field points to a first adjacent vertex, if no adjacent point exists, the pointer is empty, and all vertex pointer fields are empty during initialization; the single-chain list edge node comprises an adjacent point domain adjvex, a data domain info and a chain domain next; wherein the adjacency point field points to a vertex adjacent to the table head node; the data field indicates information of the edge including, but not limited to, weights; the chain field indicates the next vertex next to vertex v.
In the breadth-first spanning tree searching process, the transmission network is generally searched from the balance node of the transmission network downwards layer by layer, namely the balance node is positioned at the 0 th layer; for a power distribution network, there may be multiple power sources, so that all the power source nodes are used as initial searching nodes, namely, at layer 0, the multiple power sources are traversed as initial nodes to start searching, and finally, the searched tree is output.
As shown in fig. 3 and 4, the access sequence is illustrated here with V0 as the access start point:
1. firstly, accessing 0, namely V0, marking that the accessed mark is accessed, enqueuing the accessed mark, deleting the vertex of the head of the current queue, wherein the vertex is contained in the queue as follows: [ V0];
2. traversing the V0 singly linked list to enqueue and mark the non-accessed adjacent vertexes V2 and V1, wherein the queue comprises vertexes as follows: [ V1, V2];
3. accessing the queue head node 1, deleting, traversing the V1 single linked list corresponding to the node 1, enabling the non-accessed adjacent vertexes 4 and 3 to be enqueued and marked, wherein the queue comprises vertexes as follows: [ V2, V3, V4];
4. accessing the queue head node 2, deleting, traversing the V2 single linked list corresponding to the node 2, enabling the non-accessed adjacent vertexes 6 and 5 to be enqueued and marked, wherein the queue comprises vertexes as follows: [ V3, V4, V5, V6];
5. accessing the queue head node 3, deleting, traversing the V3 single linked list corresponding to 3, and enabling the non-accessed adjacent vertexes 7 to be enqueued and marked, wherein the queue comprises vertexes as follows: [ V4, V5, V6, V7];
6. accessing the queue head node 4, deleting, and traversing the V4 single linked list corresponding to 4, wherein no non-accessed vertex exists in the single linked list, and the queue comprises the following vertices: [ V5, V6, V7];
7. accessing the queue head node 5, deleting, and traversing a V5 single linked list corresponding to the node 5, wherein no non-accessed vertex exists in the single linked list, and the queue comprises the following vertices: [ V7, V8];
8. accessing the queue head node 6, deleting, and traversing the V6 single linked list corresponding to 6, wherein no non-accessed vertex exists in the single linked list, and the queue comprises the following vertices: [ V8];
9. accessing the queue head node 7, deleting, and traversing the V7 single linked list corresponding to 7, wherein no unaccessed vertex exists in the single linked list, the queue is empty at the moment, and the traversing is finished, wherein the queue comprises the following vertices: [] (indicating that the number of vertices included is empty).
At this point the queue is empty, so the depth-first traversal sequence of the graph is: v0, V1, V2, V3, V4, V5, V6, V7.
The search algorithm of the application is similar to tree hierarchical traversal, and searches sequentially outwards layer by taking the designated vertex as the center until the end node is searched. The tree of the graph refers to: for one connected sub-graph G of the connected graph G i It contains all nodes in G but does not contain any loops. Traversing of a graph refers to starting from a certain vertex in the graph (any vertex can be used as the initial vertex for access), and according to a certain traversing method, all vertices in the graph are accessed once and only once. Thus, it is possible to utilizeThe breadth-first search method searches a tree in the power grid, and on the basis, the power supply path of the load on any node in the power grid can be traced along the generated tree. For a power transmission network, the power transmission network is generally searched from the balance node to the layer by layer, namely the balance node is positioned at the 0 th layer; for a power distribution network, there may be multiple power sources, so that all the power source nodes are used as initial searching nodes, namely, at layer 0, the multiple power sources are traversed as initial nodes to start searching, and finally, the searched tree is output.
Example 2:
the basic setting of the load power supply path tracking method based on breadth-first search spanning tree is the same as that of the embodiment, and the embodiment adopts C++ language programming based on the embodiment 1 to carry out power supply tracking simulation test on IEEE-33 node and IEEE-30 node test examples. The simulation environment is Microsoft Visual Studio 2015, and the computer hardware is configured as Intel (R) Core (TM) i12-12400 CPU and 32GB memory. The IEEE-33 node represents a power distribution network, the IEEE-30 node represents a power transmission network, and calculation results of two test systems show that the method is applicable to the power distribution network and the power transmission network at the same time.
As shown in fig. 4 and 6, in order to test case topology diagrams and path diagrams of IEEE-33 nodes, branches included in a tree generated by performing breadth-first search on the above IEEE-33 node test system are shown in table 1 below. The power trace is performed from node 33 along the generated tree, and the final searched power supply path is schematically shown in fig. 5, wherein the red line represents the power supply path of Bus-33, and Bus-1 is the balancing node.
TABLE 1 tree generation in IEEE-33 node System includes branches
| Branch circuit | Start node | Reach the node | Branch circuit | Start node | Reach the node |
| line_1-2 | Bus-1 | Bus-2 | line_8-9 | Bus-8 | Bus-9 |
| line_2-3 | Bus-2 | Bus-3 | line_27-28 | Bus-27 | Bus-28 |
| line_2-19 | Bus-2 | Bus-19 | line_9-10 | Bus-9 | Bus-10 |
| line_3-4 | Bus-3 | Bus-4 | line_28-29 | Bus-28 | Bus-29 |
| line_3-23 | Bus-3 | Bus-23 | line_10-11 | Bus-10 | Bus-11 |
| line_19-20 | Bus-19 | Bus-20 | line_29-30 | Bus-29 | Bus-30 |
| line_4-5 | Bus-4 | Bus-5 | line_11-12 | Bus-11 | Bus-12 |
| line_23-24 | Bus-23 | Bus-24 | line_30-31 | Bus-30 | Bus-31 |
| line_20-21 | Bus-20 | Bus-21 | line_12-13 | Bus-12 | Bus-13 |
| line_5-6 | Bus-5 | Bus-6 | line_31-32 | Bus-31 | Bus-32 |
| line_24-25 | Bus-24 | Bus-25 | line_13-14 | Bus-13 | Bus-14 |
| line_21-22 | Bus-21 | Bus-22 | line_32-33 | Bus-32 | Bus-33 |
| line_6-7 | Bus-6 | Bus-7 | line_14-15 | Bus-14 | Bus-15 |
| line_6-26 | Bus-6 | Bus-26 | line_15-16 | Bus-15 | Bus-16 |
| line_7-8 | Bus-7 | Bus-8 | line_16-17 | Bus-16 | Bus-17 |
| line_26-27 | Bus-26 | Bus-27 | line_17-18 | Bus-17 | Bus-18 |
As shown in fig. 7 and 8, in order to test an example topology and a path diagram of an IEEE-30 node, a tree generated by performing breadth first search on the above IEEE-30 node test system includes branches as shown in table 2 below. The power trace is performed from Bus-26 along the generated tree, and the final searched power supply path is schematically shown in fig. 7, wherein the red line represents the power supply path of Bus-26, and Bus-1 is the balance node.
Table 2 tree generated in IEEE-33 node system includes branches
| Branch name | Start node | Reach the node | Branch name | Start node | Reach the node |
| line_1-2 | Bus-1 | Bus-2 | line_6-9 | Bus-6 | Bus-9 |
| line_1-3 | Bus-1 | Bus-3 | line_12-13 | Bus-12 | Bus-13 |
| line_2-4 | Bus-2 | Bus-4 | line_12-14 | Bus-12 | Bus-14 |
| line_2-5 | Bus-2 | Bus-5 | line_12-15 | Bus-12 | Bus-15 |
| line_2-6 | Bus-2 | Bus-6 | line_12-16 | Bus-12 | Bus-16 |
| line_4-12 | Bus-4 | Bus-12 | line_28-27 | Bus-28 | Bus-27 |
| line_5-7 | Bus-5 | Bus-7 | line_10-17 | Bus-10 | Bus-17 |
| line_6-28 | Bus-6 | Bus-28 | line_10-20 | Bus-10 | Bus-20 |
| line_6-8 | Bus-6 | Bus-8 | line_10-21 | Bus-10 | Bus-21 |
| line_6-10 | Bus-6 | Bus-10 | line_10-22 | Bus-10 | Bus-22 |
| line_6-9 | Bus-6 | Bus-9 | line_9-11 | Bus-9 | Bus-11 |
| line_12-13 | Bus-12 | Bus-13 | line_15-18 | Bus-15 | Bus-18 |
| line_12-14 | Bus-12 | Bus-14 | line_15-23 | Bus-15 | Bus-23 |
| line_12-15 | Bus-12 | Bus-15 | line_27-25 | Bus-27 | Bus-25 |
| line_12-16 | Bus-12 | Bus-16 | line_27-29 | Bus-27 | Bus-29 |
| line_28-27 | Bus-28 | Bus-27 | line_27-30 | Bus-27 | Bus-30 |
| line_10-17 | Bus-10 | Bus-17 | line_20-19 | Bus-20 | Bus-19 |
| line_10-20 | Bus-10 | Bus-20 | line_22-24 | Bus-22 | Bus-24 |
| line_10-21 | Bus-10 | Bus-21 | line_25-26 | Bus-25 | Bus-26 |
| line_10-22 | Bus-10 | Bus-22 |
It should be understood that the examples are only for illustrating the present application and are not intended to limit the scope of the present application. Furthermore, it should be understood that various changes and modifications can be made by one skilled in the art after reading the teachings of the present application, and such equivalents are intended to fall within the scope of the application as defined in the appended claims.
Claims (8)
1. The utility model provides a load power supply path tracking method based on breadth-first search spanning tree, which is characterized by comprising the following steps:
collecting data and carrying out abstract pretreatment on nodes and branches of a power grid to form a topological graph;
tracking nodes covered by a required power supply path in a topological graph, and generating a tree by using a breadth-first method;
after the tree is output, triggering is carried out from a preset tracing node, traversing is carried out along the nodes in the tree until the tracing is finished after the balancing node positioned at the first layer is traced, and the searched information is output to generate a power supply path.
2. A breadth-first spanning tree search based load power path tracing method according to claim 1, wherein said data collection process includes, but is not limited to, collecting grid node and branch data required to generate a topology map; the abstract preprocessing process comprises information of associating the power grid node with the branch data, and generating the information into the same topological graph.
3. The breadth-first method for generating a tree based load power path trace of claim 1, comprising:
setting the initial node for starting searching as fNode, and setting the layer number of the initial node as frLayer; accessing a first node tNode of an adjacent node queue of an initial node fNode, and pressing the tNode into a queue to be accessed; judging whether the layer number of the tNode is empty or not, if so, continuously judging again, and if not, calculating the layer number of the tNode; and setting the branch attributes of the fNode to the tNode as radial branches to obtain a layer number toLayer=frLayer+1 where the tNode is located.
4. A breadth-first spanning tree search based load power path tracking method according to claim 3, wherein said breadth-first method for spanning trees further comprises:
judging that if the branch attributes from the fNode to the tNode are tree branches, not changing the attributes; otherwise, setting the connection branch; deleting the tNodes from the queues of the adjacent nodes of the fNodes, and judging whether the adjacent nodes of the fNodes are accessed completely or not; and repeatedly accessing the tNode if the access is not completed, completing subsequent circulation until all adjacent nodes are accessed, and judging the empty queue.
5. The breadth-first method for spanning tree based load power path tracing of claim 4, further comprising:
the queue empty judgment is the empty judgment of the access queue, if the queue is not empty, the first node in the queue is set as an initial node fNode, and the fNode is deleted in the queue; and outputting the searched tree until the queue is empty.
6. A breadth-first spanning tree search based load power path tracking method as claimed in claim 1 or 2, further comprising:
based on a chain storage mode, n single-chain tables with head nodes are set to replace n rows of an adjacency matrix to form an adjacency table, a single-chain table with head nodes is built for each vertex v in a topological graph, relevant information of the vertex v is stored in the table head, and other vertexes in the single-chain table are used for storing information of edges relevant to the vertex v, including but not limited to numbers of adjacent points and weights of corresponding edges.
7. The method for tracking a load power supply path based on breadth-first search spanning tree according to claim 6, wherein the single-chain table header node includes a data field data and a pointer field first, the pointer field points to a first vertex adjacent to the first vertex, if there is no adjacent point, the pointer is set to be empty, and all vertex pointer fields need to be set to be empty during initialization; the single-chain list edge node comprises an adjacent point domain adjvex, a data domain info and a chain domain next; wherein the adjacency point field points to a vertex adjacent to the table head node; the data field indicates information of the edge including, but not limited to, weights; the chain field indicates the next vertex next to vertex v.
8. The method for tracking a load power supply path based on breadth-first search spanning tree as recited in claim 3, 4, 5, or 7,
further comprises: in the breadth-first search method spanning tree process: starting to search downwards layer by layer from a balance node of the power transmission network, wherein the balance node is positioned at the 0 th layer; the known power distribution network is provided with at least one power supply, so that all power supply nodes are used as initial search nodes, namely in the 0 th layer, all power supplies are respectively traversed to be used as initial nodes to start searching, and finally the searched trees are combined and output.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310836772.8A CN117060378A (en) | 2023-07-07 | 2023-07-07 | Load power supply path tracking method based on breadth-first search spanning tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310836772.8A CN117060378A (en) | 2023-07-07 | 2023-07-07 | Load power supply path tracking method based on breadth-first search spanning tree |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117060378A true CN117060378A (en) | 2023-11-14 |
Family
ID=88654274
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310836772.8A Pending CN117060378A (en) | 2023-07-07 | 2023-07-07 | Load power supply path tracking method based on breadth-first search spanning tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117060378A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117390233A (en) * | 2023-12-11 | 2024-01-12 | 中国建筑西南设计研究院有限公司 | Load capacity transfer method and system of power supply network system in building engineering |
-
2023
- 2023-07-07 CN CN202310836772.8A patent/CN117060378A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117390233A (en) * | 2023-12-11 | 2024-01-12 | 中国建筑西南设计研究院有限公司 | Load capacity transfer method and system of power supply network system in building engineering |
| CN117390233B (en) * | 2023-12-11 | 2024-02-13 | 中国建筑西南设计研究院有限公司 | Load capacity transfer method and system of power supply network system in building engineering |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | Community detection in large-scale bipartite networks | |
| CN108695864B (en) | Power distribution network topology analysis method based on mu PMU and SCADA | |
| CN103928925B (en) | Power distribution network load flow calculation method based on forward-backward sweep | |
| CN117060378A (en) | Load power supply path tracking method based on breadth-first search spanning tree | |
| CN111682530B (en) | Method, device, equipment and medium for determining out-of-limit probability of voltage of power distribution network | |
| CN111639191A (en) | Prediction method for simulating epidemic situation development trend by novel coronavirus knowledge map | |
| Yuan et al. | Graph computing based distributed fast decoupled power flow analysis | |
| CN113937764A (en) | Low-voltage distribution network high-frequency measurement data processing and topology identification method | |
| CN103346556A (en) | Rapid positioning method of distribution network loop | |
| CN104967114A (en) | Power grid load real-time digital modeling method and system | |
| CN113094899B (en) | Random power flow calculation method and device, electronic equipment and storage medium | |
| CN112103950B (en) | Power grid partitioning method based on improved GN splitting algorithm | |
| CN111639463B (en) | XGboost algorithm-based frequency characteristic prediction method for power system after disturbance | |
| CN106372440A (en) | Method and device for estimating self-adaptive robust state of distribution network through parallel computation | |
| CN115579885B (en) | Power grid topology analysis method and device | |
| CN113111659A (en) | Power inspection work ticket generation method, system, equipment and storage medium | |
| Yuan et al. | Exploration of bi-level PageRank algorithm for power flow analysis using graph database | |
| CN113092933A (en) | LSTM-based single-phase earth fault line selection method and system | |
| CN109033603B (en) | Intelligent substation secondary system simulation method based on source flow path chain | |
| CN106327009A (en) | Main constituent analysis method for determining cell load maximum value in space load prediction | |
| CN113177717B (en) | Quick evaluation method for toughness of power transmission system based on influence increment sensitivity | |
| CN113255213B (en) | Power converter composite fault identification method | |
| CN112217215B (en) | PSD-BPA-based large-scale power system random load flow calculation method | |
| Xing et al. | Hydrological time series forecast by ARIMA+ PSO-RBF combined model based on wavelet transform | |
| CN109270347B (en) | Power grid observability analysis method for synchronous phasor measurement |
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 |