CN113629769B - Line weight-based power grid partition searching method and system - Google Patents
Line weight-based power grid partition searching method and system Download PDFInfo
- Publication number
- CN113629769B CN113629769B CN202110935510.8A CN202110935510A CN113629769B CN 113629769 B CN113629769 B CN 113629769B CN 202110935510 A CN202110935510 A CN 202110935510A CN 113629769 B CN113629769 B CN 113629769B
- Authority
- CN
- China
- Prior art keywords
- node
- partition
- power grid
- line
- 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.)
- Active
Links
Classifications
-
- 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
- H02J3/38—Arrangements for parallely feeding a single network by two or more generators, converters or transformers
- H02J3/381—Dispersed generators
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02H—EMERGENCY PROTECTIVE CIRCUIT ARRANGEMENTS
- H02H7/00—Emergency protective circuit arrangements specially adapted for specific types of electric machines or apparatus or for sectionalised protection of cable or line systems, and effecting automatic switching in the event of an undesired change from normal working conditions
- H02H7/26—Sectionalised protection of cable or line systems, e.g. for disconnecting a section on which a short-circuit, earth fault, or arc discharge has occured
-
- 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
- H02J3/04—Circuit arrangements for ac mains or ac distribution networks for connecting networks of the same frequency but supplied from different sources
- H02J3/06—Controlling transfer of power between connected networks; Controlling sharing of load between connected 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
- H02J3/00—Circuit arrangements for ac mains or ac distribution networks
- H02J3/38—Arrangements for parallely feeding a single network by two or more generators, converters or transformers
- H02J3/46—Controlling of the sharing of output between the generators, converters, or transformers
- H02J3/48—Controlling the sharing of the in-phase component
-
- 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]
-
- 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
- H02J2300/00—Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation
- H02J2300/40—Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation wherein a plurality of decentralised, dispersed or local energy generation technologies are operated simultaneously
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S10/00—Systems supporting electrical power generation, transmission or distribution
- Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Power Engineering (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Data Mining & Analysis (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Algebra (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses a line weight-based power grid partition searching method and system, and belongs to the field of electrical engineering. Comprising the following steps: obtaining a topological connection diagram and the partition number of a power grid to be partitioned; assigning the initial weight of each line as a module of line impedance, and forming an adjacent matrix based on the topological connection relation of the power grid, wherein the adjacent matrix elements are line weights; zero values are given to adjacent matrix elements for multiple times, and after each zero value is given, the lines corresponding to the zero values are disconnected, so that a plurality of partition schemes are obtained; and carrying out safety check on the partition scheme, and screening out a physically feasible partition scheme. The invention ignores the physical properties of the grid and considers it as a connectivity map. By abstracting the graph into an adjacency matrix, the adjacency matrix is operated on to obtain a variety of partition schemes that only consider topology. And then carrying out safety check, and screening out a physically feasible partition scheme. Because the partition does not consider the physical property of the power grid, the implementation is simpler, and more partition schemes can be searched only by replacing the line weight.
Description
Technical Field
The invention belongs to the field of electrical engineering, and particularly relates to a line weight-based power grid partition searching method and system.
Background
Along with the development of the power grid, the electric connection between the networks is continuously enhanced, and the problems of short-circuit current increase, high-low voltage electromagnetic looped network and the like accompanied with the electric connection become important bottlenecks for restricting the development of the power grid. Meanwhile, the form of the traditional power grid is changed by the wide access of large-scale new energy power generation, distributed power supply, energy storage system and electric automobile and the deep integration of information physical systems, and when the sharing property, the platformity and the openness are continuously improved, the influence of external factors on the power grid is increased. Therefore, a power grid development form with clear layers and simple structure is formed, the layered and partitioned operation of the power grid is realized, and a correct road can be indicated for the healthy development of the power grid.
The existing power grid partitioning method mainly comprises a heuristic mode, a physical characteristic method and a scientific planning method. The heuristic mode is manually divided according to geographic positions, administrative areas and operation experience; the physical characteristic method is to divide the power grid area according to certain physical characteristics of the local power grid, such as electrical distance, topological structure, number of substations, short-circuit current and the like, and the distance, the characteristic similarity degree and the like. The scientific planning method and the physical characteristic method are not separated, a partition target is generally established according to one or more physical characteristics of a power grid, the power grid partition problem is modeled as a multi-target, nonlinear integer programming problem or other optimizing models, and various intelligent algorithms are utilized for solving, so that a more reasonable partition result is obtained. These three methods generally initially propose two to three partition schemes, and then use the established evaluation index system to comprehensively compare and evaluate each initial scheme. The scheme thus found has a certain limitation (only two to three schemes are evaluated for merits), and when the established evaluation index cannot find a better scheme, it is difficult to search for a new scheme again.
Disclosure of Invention
Aiming at the defects and improvement demands that the prior art cannot find out a plurality of partition schemes at one time or that when the found partition schemes cannot pass through evaluation index inspection, new partition schemes are difficult to search again, the invention provides a line weight-based power grid partition searching method and system. After security verification, a plurality of physically feasible partitioning methods can be found.
To achieve the above object, according to a first aspect of the present invention, there is provided a grid partition searching method based on line weights, including:
s1, obtaining a topological connection diagram of a power grid to be partitioned and the designated partition number;
s2, assigning the initial weight of each line as a module of line impedance, and forming an adjacent matrix based on the topological connection relation of the power grid, wherein the adjacent matrix elements are the weights of the corresponding lines;
s3, zero values are given to adjacent matrix elements for multiple times, and after each zero value is given, power grid lines corresponding to the zero values are disconnected, so that a plurality of partition schemes are obtained, and each partition scheme generates a specified number of partitions;
s4, carrying out safety check on the partition scheme, and screening out a physically feasible partition scheme.
Preferably, if the number of specified partitions exceeds two, the following steps are adopted:
(1) Selecting nodes with the number of designated partitions, wherein the selection rules are as follows: 1) Preferably selecting a node of 500kv and above; 2) The shortest distance between any two nodes must not be the minimum value of the shortest distances from the initial node to all other nodes;
(2) Randomly selecting two nodes without replacement, and performing two partitions;
(3) Randomly selecting a node without returning, and judging the current partition subordinate node of the node;
(4) Performing two partitions on the selected node and the subordinate node in the step (3);
(5) Repeating the steps (3) - (4) until all nodes are processed.
The beneficial effects are that: by adopting the power grid partitioning method based on the line weight, the physical property of the power grid is not considered, and only the topological connection relationship is considered for partitioning, so that any number of partitioning problems can be easily converted into two partitioning problems through the steps. The nodes selected in the step (1) cannot be directly connected with each other or are directly connected with each other, but a larger weight is required to be assigned to a line between two directly connected nodes, and the maximum value of the weights of other lines can be set to be 5 times (more than 1).
Preferably, the two partitions comprise the steps of:
(a) Randomly designating one node as a starting node and the other node as a terminating node;
(b) Calculating the shortest distance between the initial node and other nodes, storing the shortest distance from small to large after de-duplication, and recording the shortest distance as a plurality of groups of distance, wherein i=1;
(c) Starting from the initial node, listing the points with the shortest distance less than or equal to the distance [ i ] from the initial node into the area contained by the initial node, and cutting off the connection line between the nodes in the area and the nodes outside the area one by one;
(d) Judging whether an isolated node exists, if so, restoring the connection relation before the isolated node, entering the step (e), otherwise, directly entering the step (e);
(e) And (3) storing the current partition scheme, judging whether the distance [ i+1] is smaller than the minimum distance between the starting node and the ending node, if so, returning to the step (c), otherwise, ending.
The beneficial effects are that: aiming at the problem that a plurality of partition schemes are difficult to search in the prior art based on optimizing a certain target, the method for partitioning the power grid based on the line weight can easily search a plurality of partition schemes only considering the topological connection relationship because the physical property of the power grid is not considered and only the topological connection relationship is considered for partitioning.
Preferably, when step (e) distance [ i+1] is equal to the minimum distance between the start node and the end node, the start node and the end node are interchanged, and the iteration is repeated.
The beneficial effects are that: and changing the searching direction to search more power grid partition schemes.
Preferably, the method further comprises:
s5, randomly assigning the weight of each line as a positive number, forming a new adjacency matrix again based on the topological connection relation of the power grid, and repeating the steps S3-S4.
The beneficial effects are that: when a physically feasible partition scheme is not found under a group of line weights, the method can be used for continuously searching a new partition scheme by simply replacing the line weights.
Preferably, the security check comprises at least one of the following: and (5) checking the ground state power flow, checking the N-1 and checking the three-phase symmetrical short-circuit current.
The beneficial effects are that: the physical feasible partition scheme can be screened out through safety check, the process is decoupled from the previous partition searching process, and a user can add other check programs in the link according to own needs.
To achieve the above object, according to a second aspect of the present invention, there is provided a grid partition search system based on line weights, including: a computer readable storage medium and a processor;
the computer-readable storage medium is for storing executable instructions;
the processor is configured to read executable instructions stored in the computer readable storage medium, and execute the grid partition searching method based on line weight according to the first aspect.
In general, through the above technical solutions conceived by the present invention, the following beneficial effects can be obtained:
in the prior art, under the basic principle of meeting the power grid partition, two to three partition schemes are primarily formed by considering the physical properties of the power grid or a certain target, and then the established evaluation index system is utilized to comprehensively compare and evaluate all the initial schemes. The solution found in this way has a certain limitation, and when the established evaluation index cannot find a better solution, it is difficult to search for a new solution again. The invention adopts a power grid partitioning method based on line weight, firstly ignores the physical property of the power grid, and only considers the physical property as a connected graph. By abstracting the graph into an adjacency matrix, and operating on the adjacency matrix, a variety of topology-only partitioning schemes can be readily obtained. And then carrying out safety check by combining with specific indexes, and screening out a physically feasible partition scheme. Because the partitioning process does not consider the physical property of the power grid, the implementation is simpler, and more partitioning schemes can be searched by only replacing the line weight.
Drawings
FIG. 1 is a flow chart of a method for searching a power grid partition based on line weight;
FIG. 2 is a schematic diagram of a two-partition process according to the present invention;
FIG. 3 is a topology of an IEEE39 node system provided by the present invention;
FIG. 4 is a diagram of an IEEE39 node system two-partition scheme with security check provided by the present invention;
fig. 5 is a schematic diagram of an IEEE39 node system three-partition scheme through security check according to the present invention.
Detailed Description
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention. In addition, the technical features of the embodiments of the present invention described below may be combined with each other as long as they do not collide with each other.
As shown in fig. 1, the invention provides a grid partition searching method based on line weight, which comprises the following steps:
s1, collecting conventional parameters and topological connection relations of the power system.
Conventional technical parameters of an electrical power system include: number of nodes N b Active load P at the ith node Di And reactive load Q Di Total paired susceptance b i The method comprises the steps of carrying out a first treatment on the surface of the Total number of lines N l Resistance r of jth line j Reactance x j Rated capacity f Lj The method comprises the steps of breaking capacity of each breaker in a power grid, active output and reactance of each generator set in the power grid, and selecting balance nodes.
The topological connection relation is the relation that all nodes in the power grid are connected.
S2, forming an adjacent matrix to generate a partition scheme.
Since the topological connection diagram of the power grid is essentially an undirected diagram, an adjacency matrix corresponding to the undirected diagram can be generated, and the partitioning operation is converted into the operation on the adjacency matrix.
And (3) the power grid is equivalent to an undirected graph, wherein bus (bus or node in the power grid) is equivalent to a node of the graph, branch (transmission line or transformer branch) is equivalent to an edge of the graph, and the weight of the edge is set. The circuit weight is set as the electrical distance, namely the module value of the circuit impedance, by combining the prior knowledge at the beginning, if more schemes are needed to be searched, a plurality of groups of different weights can be randomly generated, and the multi-partition process is circularly carried out.
When the goal is to search for a certain number of two-partition schemes, the following steps are taken:
(1) Selecting a starting node and a terminating node (two designated points shown in fig. 2), calculating the shortest distance from the starting point to all other nodes in the graph by using Dijkstra algorithm, and storing the nodes in the order from small to large after de-duplication, and recording the nodes as distance [ ], wherein i=1;
(2) Starting from the starting point, the points with the shortest distance from the starting node being less than or equal to the distance [ i ] are listed in the area contained by the starting node, and the connection lines between the nodes in the area and the nodes outside the area (the nodes with the distance from the starting node being greater than the distance [ i ]) are cut off one by one, and whether isolated nodes are generated or not is needed to be judged in the cutting process. If not, continuing the next step, and if so, judging whether the isolated node and the termination node belong to the same area:
belonging to the following: then the processing is not carried out, and the next step is continued;
not belonging to: restoring the connection relation before the isolated node, and continuing the next step;
(3) And (5) finishing internal iteration, and recovering the initial connection relation of the two areas.
This step is to prevent step (2) from not being fully restored when the initial connection relationship is restored. For example, a node S has a shortest distance of 5 from the starting node, and is connected to only two nodes M1, M2 having a shortest distance of 4 from the starting node. In the iteration process, it is assumed that the connection branches of M1 and S are cut off first, no isolated node is generated at this time, iteration is continued, the connection branches of M2 and S are cut off, at this time S is an isolated node, and the connection relation between M2 and S is restored according to the step (2). But the connection relation between M1 and S is not recovered, so that the original connection relation of the two partitions is recovered after the two partitions are finally separated;
(4) And (3) storing the current partition scheme, judging whether the distance [ i+1] is smaller than the minimum distance between the starting node and the ending node, and if so, returning to the step (2).
Preferably, the start node and the end node are interchanged, and the iteration is repeated (the direction is changed for iteration, and more schemes are obtained).
When the goal is to search for a certain number of tri-partition schemes, the following steps are taken:
(1) Selecting a starting node first, an intermediate node middle and a terminating node last;
(2) Firstly, performing two partitions by using a designated node first and an intermediate node middle;
(3) Judging whether the third designated point last is positioned in the area where the first is positioned or the area where the middle is positioned;
(4) And carrying out two partitions on the area where the last is located.
S3, safety check analysis.
The above partition scheme is obtained only by considering the topological connection relation of the power grid, and does not consider the actual physical characteristics of the power grid, so that the obtained partition scheme may not be physically feasible. Therefore, a practical partition scheme must be screened out through security check analysis. The security check analysis includes: and (3) checking ground state power flow, checking N-1 and checking three-phase symmetrical short-circuit current.
The base state power flow verification is mainly to calculate the base state alternating current power flow of each partition scheme and screen out the division cases of the base state alternating current power flow non-convergence and line power flow out-of-limit. And the next N-1 verification is performed through the scheme of the ground state power flow verification. If no scheme can pass the base state power flow verification, judging whether the preset iteration times are reached, if so, outputting that a feasible partition scheme is not found, otherwise, randomly generating a line weight, returning to the step S2, and searching the partition scheme again.
The N-1 verification is a common network security operation requirement, so that the N-1 security verification is also required by the partition scheme of the ground state power flow verification. In this embodiment, the power grid is still integral after the line is disconnected, and cannot be changed into two independent parts, and after any line meeting the requirement in the power grid is disconnected, the power flow of the system is solved and the power flow of the line is not out of limit. And carrying out the three-phase short-circuit current verification of the next step only through the N-1 verification scheme. If no scheme can pass the N-1 verification, judging whether the preset iteration times are reached, if so, outputting that a feasible partition scheme is not found, otherwise, randomly generating a line weight, returning to S2, and searching the partition scheme again.
The scheme through N-1 verification also requires short circuit current verification. Considering the worst three-phase symmetrical short circuit condition, traversing all buses in the power grid, setting three-phase short circuit faults at the buses and calculating three-phase short circuit currents. The three-phase short-circuit current needs to be smaller than the breaking capacity of the circuit breaker, otherwise, the short-circuit current fails to verify. If no scheme can pass the short-circuit current verification, judging whether the preset iteration times are reached, if so, outputting that a feasible partition scheme is not found, otherwise, randomly generating a line weight, returning to S2, and searching the partition scheme again.
And (3) carrying out safety verification on the scheme generated in the step (S2), namely, after the ground state power flow verification, the N-1 verification and the short circuit current verification, obtaining a series of physically feasible partition schemes. If more schemes are needed to be found, the searching can be continued by randomly replacing the line weight.
Fig. 3 is a topology of an IEEE39 node system, which is illustrated as an example.
The two-partition scheme and the three-partition scheme which are obtained by searching the IEEE39 node system through security check by utilizing a partition scheme searching method based on line random weight are shown in fig. 4 to 5.
It will be readily appreciated by those skilled in the art that the foregoing description is merely a preferred embodiment of the invention and is not intended to limit the invention, but any modifications, equivalents, improvements or alternatives falling within the spirit and principles of the invention are intended to be included within the scope of the invention.
Claims (6)
1. The utility model provides a grid partition searching method based on line weight, which is characterized by comprising the following steps:
s1, obtaining a topological connection diagram of a power grid to be partitioned and the designated partition number;
s2, assigning the initial weight of each line as a module of line impedance, and forming an adjacent matrix based on the topological connection relation of the power grid, wherein the adjacent matrix elements are the weights of the corresponding lines;
s3, zero values are given to adjacent matrix elements for multiple times, and after each zero value is given, power grid lines corresponding to the zero values are disconnected, so that a plurality of partition schemes are obtained, and each partition scheme generates a specified number of partitions;
s4, carrying out safety check on the partition scheme, and screening out a physically feasible partition scheme;
if the number of the designated partitions exceeds two, the following steps are adopted:
(1) Selecting nodes with the number of designated partitions, wherein the selection rules are as follows: 1) Selecting nodes with voltage levels of 500kv and above; 2) The shortest distance between any two nodes must not be the minimum value of the shortest distances from the initial node to all other nodes;
(2) Randomly selecting two nodes without replacement, and performing two partitions;
(3) Randomly selecting a node without returning, and judging the current partition subordinate node of the node;
(4) Performing two partitions on the selected node and the subordinate node in the step (3);
(5) Repeating the steps (3) - (4) until all nodes are processed.
2. The method of claim 1, wherein the two partitions comprise the steps of:
(a) Randomly designating one node as a starting node and the other node as a terminating node;
(b) Calculating the shortest distance between the initial node and other nodes, storing the shortest distance from small to large after de-duplication, and recording the shortest distance as a plurality of groups of distance, wherein i=1;
(c) Starting from the initial node, listing the points with the shortest distance less than or equal to the distance [ i ] from the initial node into the area contained by the initial node, and cutting off the connection line between the nodes in the area and the nodes outside the area one by one;
(d) Judging whether an isolated node exists, if so, restoring the connection relation before the isolated node, entering the step (e), otherwise, directly entering the step (e);
(e) And (3) storing the current partition scheme, judging whether the distance [ i+1] is smaller than the minimum distance between the starting node and the ending node, if so, returning to the step (c), otherwise, ending.
3. The method of claim 2, wherein the starting node and the ending node are interchanged and iterated again when step (e) distance [ i+1] is equal to the minimum distance between the starting node and the ending node.
4. A method according to any one of claims 1 to 3, wherein the method further comprises:
s5, randomly assigning the weight of each line as a positive number, forming a new adjacency matrix again based on the topological connection relation of the power grid, and repeating the steps S3-S4.
5. The method of claim 1, wherein the security check comprises at least one of: and (5) checking the ground state power flow, checking the N-1 and checking the three-phase symmetrical short-circuit current.
6. A line weight based grid partition search system, comprising: a computer readable storage medium and a processor;
the computer-readable storage medium is for storing executable instructions;
the processor is configured to read executable instructions stored in the computer readable storage medium and execute the line weight based grid partition search method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110935510.8A CN113629769B (en) | 2021-08-16 | 2021-08-16 | Line weight-based power grid partition searching method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110935510.8A CN113629769B (en) | 2021-08-16 | 2021-08-16 | Line weight-based power grid partition searching method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113629769A CN113629769A (en) | 2021-11-09 |
| CN113629769B true CN113629769B (en) | 2023-09-01 |
Family
ID=78385553
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110935510.8A Active CN113629769B (en) | 2021-08-16 | 2021-08-16 | Line weight-based power grid partition searching method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113629769B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103077325A (en) * | 2013-01-30 | 2013-05-01 | 西安交通大学 | Bad data detection method of smart power grid based on self-adaptive partition state estimation |
| CN111092428A (en) * | 2019-12-10 | 2020-05-01 | 南京理工大学 | Active power distribution network dynamic virtual cluster division method based on model predictive control |
| CN111884220A (en) * | 2020-07-31 | 2020-11-03 | 三峡大学 | Electromagnetic looped network open-loop partition scheme generation method considering regional source-load balance |
-
2021
- 2021-08-16 CN CN202110935510.8A patent/CN113629769B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103077325A (en) * | 2013-01-30 | 2013-05-01 | 西安交通大学 | Bad data detection method of smart power grid based on self-adaptive partition state estimation |
| CN111092428A (en) * | 2019-12-10 | 2020-05-01 | 南京理工大学 | Active power distribution network dynamic virtual cluster division method based on model predictive control |
| CN111884220A (en) * | 2020-07-31 | 2020-11-03 | 三峡大学 | Electromagnetic looped network open-loop partition scheme generation method considering regional source-load balance |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113629769A (en) | 2021-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Silva et al. | Transmission network expansion planning with security constraints | |
| CN112803404B (en) | Self-healing reconstruction planning method and device for power distribution network and terminal | |
| Jiang et al. | A novel fuzzy multiobjective model using adaptive genetic algorithm based on cloud theory for service restoration of shipboard power systems | |
| CN108233359B (en) | Partition optimization method and system for extra-high voltage alternating current-direct current feed-in receiving end power grid | |
| CN109449936A (en) | A kind of sub-area division method based on network structure specificity analysis | |
| CN104156774B (en) | A kind of electric power support method for considering adjacent system | |
| Šošić et al. | Reconfiguration of distribution system with distributed generation using an adaptive loop approach | |
| Fletcher et al. | A case study on optimizing an electrical distribution network using a genetic algorithm | |
| Kalantari Khandani et al. | Optimal MV/LV transformer allocation in distribution network for power losses reduction and cost minimization: A new multi‐objective framework | |
| CN110311372A (en) | Sub-area division method based on spectral clustering | |
| Shayeghi et al. | Genetic algorithm based studying of bundle lines effect on network losses in transmission network expansion planning | |
| Onaka et al. | A posteriori decision analysis based on Resonance Index and NSGA-II applied to the capacitor banks placement problem | |
| CN112103950B (en) | Power grid partitioning method based on improved GN splitting algorithm | |
| CN113629769B (en) | Line weight-based power grid partition searching method and system | |
| Montoya et al. | A new approach to solve the distribution system planning problem considering automatic reclosers | |
| CN114188936A (en) | Optimal scheduling method for black-start mobile energy storage system of traditional thermal power generating unit | |
| CN114243716A (en) | Partitioned power grid coordination self-healing recovery method considering power supply reliability | |
| CN114665481A (en) | Urban power grid partitioning method and device based on power grid node vectorization | |
| Mekhamer et al. | Fuzzy and heuristic techniques for reactive power compensation of radial distribution feeders: a comparative study | |
| Huang et al. | A partitioning method for parallel power system restoration based on virus propagation model | |
| CN115276055B (en) | Energy storage configuration method and system based on power grid frequency spatial distribution characteristics | |
| Maleki et al. | Multi-objective rearrangement of unbalanced distribution network by considering uncertainty of loads and distributed generation by NSGA-II algorithm | |
| CN111626463B (en) | Electric power system short circuit current parallel coordination method based on Hadoop framework | |
| Ghaweta et al. | Optimal distribution feeder reconfiguration with optimal planning of distributed generation for loss reduction and voltage improvement using differential evolution algorithm | |
| Viana et al. | A Multiobjective Approach Applied to the Power System Reconfiguration Problem |
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 |