CN109449936A - A kind of sub-area division method based on network structure specificity analysis - Google Patents
A kind of sub-area division method based on network structure specificity analysis Download PDFInfo
- Publication number
- CN109449936A CN109449936A CN201811530826.3A CN201811530826A CN109449936A CN 109449936 A CN109449936 A CN 109449936A CN 201811530826 A CN201811530826 A CN 201811530826A CN 109449936 A CN109449936 A CN 109449936A
- Authority
- CN
- China
- Prior art keywords
- node
- electric power
- calculated
- network
- power networks
- 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
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
-
- 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
- Engineering & Computer Science (AREA)
- Power Engineering (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The present invention relates to Electric Power Network Planning technical fields, provide a kind of sub-area division method based on network structure specificity analysis, comprising: simplify to electric power networks, and carry out network partition to simplified electric power networks centered on each load-center substation；Division processing is optimized to the electric power networks after network partition；Calculate the shortest path length matrix in the electric power networks and all shortest path data；The side weight information of the electric power networks is calculated, and weighting block degree index is calculated according to the side weight information being calculated；Electromagnetic looped network partition content is exported according to the weighting block degree index being calculated, to realize the subregion to electromagnetic looped network, is provided fundamental basis for power grid reality subregion.
Description
Technical field
The invention belongs to Electric Power Network Planning technical field more particularly to a kind of sub-area divisions based on network structure specificity analysis
Method.
Background technique
According to the requirement of " guiding rules of power system safety and stability ", should rationally divide according to network voltage grade and power supply area
Layer subregion.Rationally layering, the power plant of different scales and load is connected on adaptable voltage network；Rationalization partition, with by
End system is core, and external power supply is connected to receiving-end system, forms a supply and demand region in a basic balance, and through interconnection with
Adjacent area is connected.Therefore, with the construction of high voltage order one power grid, partition running, phase should be done step-by-step in subordinate voltage power grid
Mutual backup is kept between adjacent subregion.It should be avoided and eliminate the electromagnetism ring for seriously affecting the different voltages grade of electricity net safety stable
Net, power plant should not install the connecting transformer for constituting electromagnetic looped network.
With the construction of high voltage order one power grid, partition running is done step-by-step in subordinate voltage power grid, is protected between adjacent sectors
Hold mutual backup；It should be avoided and eliminate the electromagnetic looped network for seriously affecting the different voltages grade of electricity net safety stable.Pass through disconnection
The transmission line of electricity or bus connection switch of low-voltage-grade, may be implemented the open loop operation of electromagnetic looped network in the electromagnetic looped network method of operation,
But the open loop operation of electromagnetic looped network has that power transfer and short circuit current are exceeded, specifically:
(1) the problem of power shifts
Multistage electromagnetic looped network is related to that voltage class is more, the power delivery capabilities phase of highest step voltage and lowermost level voltage circuit
Difference is very big.Therefore, the power branch problem of multistage electromagnetic looped network is more prominent.
1) when being powered in receiving-end system with high and low electromagnetic circle net and with heavy load, high voltage order one route is disconnected
Afterwards, Partial Power is transferred on the low voltage order one route of paired running, in fact it could happen that is more than the thermostabilization of low-voltage-grade route
The problem of electric current.
2) if high and low electromagnetic circle net connection is two side systems, after high voltage order one route disconnects, between two side systems
Contact impedance increase, interconnection ability to transmit electricity reduce, voltage levels route break Jian caused by power shift, may make to join
The power of winding thread is more than stability limit, leads to oscillation of power between two side systems, or even expand accident impact range.
3) 1000kV route differs greatly with 500kV route, 500kV route and the natural power of 220kV route.High level-one
Voltage circuit breaks after Jian, and Partial Power is transferred on low voltage order one route, the nature of low-voltage-grade route if more than
Power increases route reactive loss, so as to cause the decline of line end voltage, or even voltage stability is caused to destroy.
(2) the exceeded problem of short circuit current
Run time limiting short-circuit current tends to occur at electromagnetic looped network when requiring most urgent.Because in this transition
Stage, the power grid of original voltage class are connected to the high level-one electricity of larger capacity power supply already close to the limit of power delivery capabilities
Crimping road is put into operation, makes that this area's electrical network capacity is bigger, connection is closer, to keep short circuit current excessive problem more prominent
Out.
Build the effect of extra-high voltage grid first is that limitation system short-circuit electric current, avoid due to short circuit current is exceeded it is a large amount of more
Change the electrical equipments such as breaker.But the multistage electromagnetic looped network being subsequently formed, comprehensive impedance is small, capacity of short circuit is big, may make
System short-circuit electric current is more than the specified breaking current of breaker, brings hidden trouble to the safe and stable operation of power grid.
Summary of the invention
For the defects in the prior art, the present invention provides a kind of sub-area division sides based on network structure specificity analysis
Method, it is intended to solve the problems, such as that the open loop operation of electromagnetic looped network in the prior art is shifted there are power and short circuit current is exceeded.
The technical solution provided by the present invention is: a kind of sub-area division method based on network structure specificity analysis, described
Method includes the following steps:
Electric power networks are simplified, and network point is carried out to simplified electric power networks centered on each load-center substation
Area；
Division processing is optimized to the electric power networks after network partition；
Calculate the shortest path length matrix in the electric power networks and all shortest path data；
The side weight information of the electric power networks is calculated, and weighting mould is calculated according to the side weight information being calculated
Lumpiness index；
Electromagnetic looped network partition content is exported according to the weighting block degree index being calculated.
As an improvement scheme, the electric power networks to after network partition optimize division processing the step of tool
Body includes the following steps:
Calculate the shortest path length matrix in the electric power networks and all shortest path data；
According to all shortest path data being calculated, the betweenness on all sides in current electric power networks is calculated；
The betweenness on all sides being calculated is traversed, the highest side of betweenness is obtained；
The highest side of betweenness is removed from the electric power networks.
As an improvement scheme, the shortest path length matrix calculated in the electric power networks and all most short
The step of path data specifically include the following steps:
Definition shortest path length matrix is A, meanwhile, initialize the shortest path length matrix D(0)=A；
In the electric power networks, to every a pair of of node, calculate node is connected to simultaneously with this other nodes to this two
The sum of path length of node；
If the node being connected to simultaneously with this to node is to the sum of the path length of two node, than the road between known two node
Electrical path length is shorter, then updates D(0), to construct D(1)；
In the same way, by D(1)Construct D(2)；So circulation, by D(n-1)Construct D(n), the shortest path path length
Degree matrix is A=D(n)；
Control introduces descendant node matrix P=(pij)n*nCome the shortest path searched between two nodes, obtain all most short
Path data.
As an improvement scheme, the method also includes following step:
From n node of the electric power networks, one of node k is chosen, is concurrently set between node i and node j
Distance be dij；
Calculate separately the distance between node k and node i, node k and the node j；
According to the distance between the node k and node i, node k and the node j being calculated, two are calculated apart from it
And dik+dkj；
By two sum of the distance dik+dkjWith the d between node i and node jijCarry out numerical values recited comparison；
As two sum of the distance dik+dkjLess than the d between node i and node jijWhen, then predicate node i to node j passes through
The distance of node k is shorter；
Use two sum of the distance dik+dkjUpdate the dij；
The inspection to the node k is repeated, until all node updates finish.
As an improvement scheme, the method also includes following step:
In recurrence renewal process, for node k, if dik+dkj<dij, then the path of predicate node i to node j, which change, walks i
→...→k→...→j；
Use pkjValue update pij。
As an improvement scheme, the shortest path length matrix calculated in the electric power networks and all most short
After the step of path data, the side weight information for calculating the electric power networks, and according to the side right being calculated
Further include following step before the step of weight information calculates weighting block degree index:
After calculating shortest path length matrix and all shortest path data in electric power networks, the power network is judged
Whether new network partition is occurred in network；
If it is determined that then executing the side for calculating the electric power networks when occurring new network partition in the electric power networks
Weight information, and the step of weighting block degree index is calculated according to the side weight information being calculated；
If it is determined that do not occur new network partition in the electric power networks, then execute that the basis is calculated described plus
The step of weighing modularity index output electromagnetic looped network partition content.
As an improvement scheme, the side weight information for calculating the electric power networks, and according to being calculated
After the side weight information calculates the step of weighting block degree index, the weighting block degree that the basis is calculated refers to
Further include following step before the step of mark output electromagnetic looped network partition content:
Judge whether each load-center substation is divided into different network partitions；
When determining that each load-center substation is divided into different network partitions, then judge to whether there is in the network partition
Network partition not comprising load-center substation；
When determining there is the network partition not comprising load-center substation in the network partition, then hinge power transformation will not be included
The network partition stood is merged into the nearest network partition comprising load-center substation；
Weighting block degree index is calculated according to the side weight information being calculated；
When determining all-network subregion includes load-center substation, then the weighting that the basis is calculated is executed
Modularity index exports the step of electromagnetic looped network partition content；
When determining to be divided into the same network partition there are identical load-center substation, then it is described to power network to return to execution
Network is simplified, and the step of carrying out network partition to simplified electric power networks centered on each load-center substation.
As an improvement scheme, the merging mode of network partition will not include load-center substation using greedy algorithm
Network partition is merged into the nearest network partition comprising load-center substation.
As an improvement scheme, the side weight information that the basis is calculated calculates weighting block degree index
Calculating formula are as follows:
In formula, SvwFor the admittance modulus value of the branch of connecting node vw, v, w are node, δ (cv, cw) it is modifying factor；s,sv
Just like giving a definition:
Wherein,
In embodiments of the present invention, electric power networks are simplified, and to simplified centered on each load-center substation
Electric power networks carry out network partition；Division processing is optimized to the electric power networks after network partition；Calculate the electric power networks
In shortest path length matrix and all shortest path data；The side weight information of the electric power networks is calculated, and according to meter
The obtained side weight information calculates weighting block degree index；According to the weighting block degree index output being calculated
Electromagnetic looped network partition content is provided fundamental basis to realize the subregion to electromagnetic looped network for power grid reality subregion.
Detailed description of the invention
It, below will be to specific in order to illustrate more clearly of the specific embodiment of the invention or technical solution in the prior art
Embodiment or attached drawing needed to be used in the description of the prior art are briefly described.In all the appended drawings, similar element
Or part is generally identified by similar appended drawing reference.In attached drawing, each element or part might not be drawn according to actual ratio.
Fig. 1 is the implementation flow chart of the sub-area division method provided by the invention based on network structure specificity analysis；
Fig. 2 is the implementation flow chart that the electric power networks provided by the invention to after network partition optimize division processing.
Specific embodiment
It is described in detail below in conjunction with embodiment of the attached drawing to technical solution of the present invention.Following embodiment is only used for
Clearly illustrate of the invention, technical solution, therefore be only used as example, and cannot be used as a limitation and limit protection model of the invention
It encloses.
Fig. 1 shows the realization stream of the sub-area division method provided in an embodiment of the present invention based on network structure specificity analysis
Cheng Tu, specifically include the following steps:
In step s101, electric power networks are simplified, and to simplified electric power centered on each load-center substation
Network carries out network partition.
In this step, simplified process is carried out to electric power networks and is divided into the following aspects:
(1) it is only limitted to high-voltage transmission network, does not consider the Main connection form of distribution network and power plant and substation；
(2) all power plant nodes, power transformation tiny node and the load bus in electric power networks are abstracted as indiscriminate section
Point, and do not consider grounding point；
(3) all ultra-high-tension power transmission lines and transformer branch are abstracted as the side of having the right in network, and weight is the branch
Admittance modulus value, and ignore the aeoplotropism of network.
In step s 102, division processing is optimized to the electric power networks after network partition.
In step s 103, the shortest path length matrix in the electric power networks and all shortest path data are calculated.
In step S104, the side weight information of the electric power networks is calculated, and according to the side right weight being calculated
Information calculates weighting block degree index.
In step s105, electromagnetic looped network partition content is exported according to the weighting block degree index being calculated.
Wherein, the admittance modulus value of the route of electric power networks is chosen as side right weight, and the side of definition weighting based on this is situated between
Several and weighting block degree index, can effectively reflect electric power networks is completely embedded degree and community structure characteristic；It improves
The shortcomings that Floyd-Warshall algorithm overcomes traditional algorithm, can be suitable for there are the networks of a plurality of equal length shortest path
Side betweenness calculate；According to load-center substation distribution situation and network topology characteristic, using GN splitting algorithm by electromagnetism ring
Net low-voltage-grade network is divided into several subregions, overcomes subjective when dividing according to administrative division or the affiliated Utilities Electric Co. of power grid
The heavier disadvantage of factor can measure network using weighting block degree index on a macro scale and divide quality.
In embodiments of the present invention, as shown in Fig. 2, the electric power networks to after network partition optimize division processing
The step of specifically include the following steps:
In step s 201, the shortest path length matrix in the electric power networks and all shortest path data are calculated.
In step S202, according to all shortest path data being calculated, all sides in current electric power networks are calculated
Betweenness.
In this step, the betweenness on side is defined as in all shortest paths of network, passes through the shortest path on certain side
Number, in the research of complex network, logical conventional edge betweenness measures the importance of certain side in a network.
In step S203, the betweenness on all sides being calculated is traversed, obtains the highest side of betweenness.
In step S204, the highest side of betweenness is removed from the electric power networks.
On this basis, the step of the shortest path length matrix and all shortest path data in the electric power networks is calculated
It is rapid specifically include the following steps:
(1) defining shortest path length matrix is A, meanwhile, initialize the shortest path length matrix D(0)=A；
(2) in the electric power networks, to every a pair of of node, calculate node is connected to simultaneously with this other nodes to this
The sum of the path length of two nodes；
(3) if the node that node is connected to simultaneously with this to two node the sum of path length, than between known two node
Path length it is shorter, then update D(0), to construct D(1)；
(4) in the same way, by D(1)Construct D(2)；So circulation, by D(n-1)Construct D(n), the shortest path
Electrical path length matrix is A=D(n)；
(5) control introduces descendant node matrix P=(pij)n*nCome the shortest path searched between two nodes, acquisition is all most
Short path data.
Above-mentioned only to provide a kind of implementation, details are not described herein, but is not used in the limitation present invention.
In this embodiment, the renewal process of shortest path are as follows:
From n node of the electric power networks, one of node k is chosen, is concurrently set between node i and node j
Distance be dij；
Calculate separately the distance between node k and node i, node k and the node j；
According to the distance between the node k and node i, node k and the node j being calculated, two are calculated apart from it
And dik+dkj；
By two sum of the distance dik+dkjWith the d between node i and node jijCarry out numerical values recited comparison；
As two sum of the distance dik+dkjLess than the d between node i and node jijWhen, then predicate node i to node j passes through
The distance of node k is shorter；
Use two sum of the distance dik+dkjUpdate the dij；
The inspection to the node k is repeated, until all node updates finish.
In this embodiment, for descendant node matrix P, if pijValue be m, indicate node i to node j shortest path
For i → ... → m → j, i.e. node m be node i to node j shortest path interior joint j before the last one node.The initial value of P
For pij=i, during recurrence updates P, if there is dik+dkj<dij, then it represents that the path of node i to node i change walk i → ...
→ k → ... → j, due to dkjIt is known that in other words, as k → ... therefore this paths of → j are it is known that can be used pkjValue update
pij.After forming final matrix P, by taking node i to the Shortest Path Searching of node j as an example, by pij=m can obtain path m
→j；Again by pim=r can obtain path r → m → j；It repeats the above process, until pit=i can obtain node i between node j
Shortest path be i → t → ... → r → m → j.
When in network between two nodes there are when the shortest path of a plurality of equal length, traditional Floyd-Warshall algorithm
A wherein shortest path can only be provided.It improves Floyd-Warshall algorithm and introduces descendant node tuple P=(pij)n*nIt can
Find out all shortest paths between two nodes.If there is Pij(m1,m2...), the shortest path of expression node i to node j is j
→…→m1/m2/ ... → j, i.e. node m1、m2... before being node i to all shortest path interior joint j of node j respectively
Final node.The initial value of P is Pij=(i), during recurrence updates P, if there is dik+dkj<dij, then P can be usedkjUpdate Pij；
If there is dik+dkj=dij, then can be by PkjIt is appended to PijIn.After forming final tuple P, search between two nodes most
The method of short path is same as above, and is repeated no more.
In embodiments of the present invention, the shortest path length matrix and all shortest path numbers in the electric power networks are calculated
According to the step of after, the side weight information for calculating the electric power networks, and according to the side weight information being calculated
Further include following step before the step of calculating weighting block degree index:
(1) after calculating shortest path length matrix and all shortest path data in electric power networks, judge the electricity
Whether new network partition is occurred in power network；
(2) if it is determined that when occurring new network partition in the electric power networks, then the calculating electric power networks are executed
Side weight information, and the step of weighting block degree index is calculated according to the side weight information that is calculated；
(3) if it is determined that not occurring new network partition in the electric power networks, then the institute that the basis is calculated is executed
The step of stating weighting block degree index output electromagnetic looped network partition content.
In embodiments of the present invention, the side weight information of the electric power networks is calculated, and according to the side being calculated
After weight information calculates the step of weighting block degree index, the weighting block degree index that the basis is calculated is exported
Further include following step before the step of electromagnetic looped network partition content:
(1) judge whether each load-center substation is divided into different network partitions；
(2) when determining that each load-center substation is divided into different network partitions, then judge in the network partition whether
In the presence of the network partition for not including load-center substation；
(3) when determining there is the network partition not comprising load-center substation in the network partition, then hinge will not be included
The network partition of substation is merged into the nearest network partition comprising load-center substation；
(4) weighting block degree index is calculated according to the side weight information being calculated；
(5) when determine all-network subregion include load-center substation when, then execute the basis be calculated it is described
Weighting block degree index exports the step of electromagnetic looped network partition content；
(6) when determining to be divided into the same network partition there are identical load-center substation, then it is described to electricity to return to execution
Power network is simplified, and the step of carrying out network partition to simplified electric power networks centered on each load-center substation.
In this embodiment, the merging mode of network partition will not include the network point of load-center substation using greedy algorithm
Area is merged into the nearest network partition comprising load-center substation, it may be assumed that
Using the quick merging algorithm based on greedy thought, successively merging the connected subregion in side, (two contain hinge
The subregion of substation is without merging), calculate the weighting block degree index increment after merging.According to greedy thought, merge every time
It should be carried out along making weighting block degree index reduce directions minimum or that increase is most, this process constantly be repeated, until net
The subregion containing load-center substation is only existed in network.
Wherein, GN splitting algorithm is general first each node in network for not knowing the network of corporations' number in advance
A corporations are all split into, then measure that be divided into several corporations the most reasonable further according to modularity index.For electromagnetism ring
Net partitioning problem chooses high voltage order one to avoid low-voltage-grade network from being split into the island network for being detached from major network and running
The substation for constituting electromagnetic looped network or power plant are participated in power grid as load-center substation, then the possible maximum number of subregion is by pivot
The total quantity of knob substation is limited.It therefore, can as long as each load-center substation is divided into different subregions with splitting algorithm
To stop fission process, without each node is split into a subregion.
In embodiments of the present invention, the community structure division result of side right weight can more reflect the actual characteristic of electric power networks.
Side right represents the tightness degree between two nodes of side connection again.Consider the line length and parameter characteristic of electric power networks,
This chapter chooses the admittance modulus value of branch as side right weight, i.e. modulus of admittance is bigger, then tight between two nodes of branch connection
Close degree is higher, comprehensively considers the topological connection relation of network and is completely embedded degree, the weighting side betweenness of electric power networks can determine
Justice is the weight when betweenness is divided by this acquired when having no right.That is, side betweenness is bigger, admittance modulus value is smaller,
A possibility that then the weighting side betweenness of the branch is bigger, is removed first in network fission process is bigger.
In embodiments of the present invention, the weighting block degree index is defined as:
L corporations are splitted the network into, the symmetrical matrix E=(e of l × l dimension is definedij)l×l,eijIt indicates to connect in network
Connect the number of edges of corporations i and corporations j ratio shared in all sides.If the sum of each element is Tre on diagonal line, which show nets
The number of edges of corporations' internal node ratio shared in all sides is connected in network.Defining the sum of each element in every row (or column) is
ai, indicate the number of edges being connected with the node in the/corporations ratio shared in all sides.All sides mentioned here
Refer in primitive network, without considering whether that being split off algorithm removes.On this basis, definition module degree index:
The physical significance of formula is that the ratio on the side of corporations' internal node is connected in network, subtracts and connects corporations in random network
The desired value of the ratio on the side of internal node.The building method of random network is that the society of each node is kept to close attribute and degree not
Become, according to the side between the random connecting node of degree of node.The upper limit of Q is 1, Q closer to this value, illustrates the community structure of network
Divide better.If the ratio of corporations' internal edges is less than desired value when random connection, then Q=0.It, should in real network
Value is usually located between 0.3~0.7.
Wherein, the calculating formula of weighting block degree index is calculated according to the side weight information being calculated are as follows:
In formula, SvwFor the admittance modulus value of the branch of connecting node vw, v, w are node, δ (cv, cw) it is modifying factor；s,sv
Just like giving a definition:
Wherein,
In embodiments of the present invention, network shortest path length matrix can be used to determine whether there is new subregion and each
Whether load-center substation is divided into different subregions.Electromagnetic looped network region policy decision should apply electromagnetic looped network partition scheme first
Set, for the electromagnetic looped network subregion in operation planning, in addition it is also necessary to overall merit be carried out to each scheme, select overall merit preferential
Spending the corresponding scheme of maximum value is final scheme；For the electromagnetic looped network subregion in Expansion Planning, in addition it is also necessary to be carried out to each scheme
Safety check, it is final scheme that the corresponding scheme of weighting block degree maximum value is selected in the scheme for meeting security constraint.
In embodiments of the present invention, electric power networks are simplified, and to simplified centered on each load-center substation
Electric power networks carry out network partition；Division processing is optimized to the electric power networks after network partition；Calculate the electric power networks
In shortest path length matrix and all shortest path data；The side weight information of the electric power networks is calculated, and according to meter
The obtained side weight information calculates weighting block degree index；According to the weighting block degree index output being calculated
Electromagnetic looped network partition content is provided fundamental basis to realize the subregion to electromagnetic looped network for power grid reality subregion.
The above embodiments are only used to illustrate the technical solution of the present invention., rather than its limitations；Although referring to aforementioned each reality
Applying example, invention is explained in detail, those skilled in the art should understand that: it still can be to aforementioned each
Technical solution documented by embodiment is modified, or equivalent substitution of some or all of the technical features；And
These are modified or replaceed, the range for technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution,
It should all cover within the scope of the claims and the description of the invention.
Claims (9)
1. a kind of sub-area division method based on network structure specificity analysis, which is characterized in that the method includes the following steps:
Electric power networks are simplified, and network partition is carried out to simplified electric power networks centered on each load-center substation；
Division processing is optimized to the electric power networks after network partition；
Calculate the shortest path length matrix in the electric power networks and all shortest path data；
The side weight information of the electric power networks is calculated, and weighting block degree is calculated according to the side weight information being calculated
Index；
Electromagnetic looped network partition content is exported according to the weighting block degree index being calculated.
2. the sub-area division method according to claim 1 based on network structure specificity analysis, which is characterized in that described right
Electric power networks after network partition optimize division processing the step of specifically include the following steps:
Calculate the shortest path length matrix in the electric power networks and all shortest path data；
According to all shortest path data being calculated, the betweenness on all sides in current electric power networks is calculated；
The betweenness on all sides being calculated is traversed, the highest side of betweenness is obtained；
The highest side of betweenness is removed from the electric power networks.
3. the sub-area division method according to claim 2 based on network structure specificity analysis, which is characterized in that the meter
The step of calculating shortest path length matrix and all shortest path data in the electric power networks specifically include the following steps:
Definition shortest path length matrix is A, meanwhile, initialize the shortest path length matrix D(0)=A；
In the electric power networks, to every a pair of of node, other nodes for being connected to simultaneously with this to node are calculated to two node
The sum of path length；
If the node being connected to simultaneously with this to node is to the sum of the path length of two node, than the path length between known two node
It spends shorter, then updates D(0), to construct D(1)；
In the same way, by D(1)Construct D(2)；So circulation, by D(n-1)Construct D(n), the shortest path length square
Battle array is A=D(n)；
Control introduces descendant node matrix P=(pij)n*nCome the shortest path searched between two nodes, all shortest paths are obtained
Data.
4. the sub-area division method according to claim 3 based on network structure specificity analysis, which is characterized in that the side
Method further includes following step:
From n node of the electric power networks, choose one of node k, concurrently set between node i and node j away from
From for dij；
Calculate separately the distance between node k and node i, node k and the node j；
According to the distance between the node k and node i, node k and the node j being calculated, two sum of the distance d are calculatedik+
dkj；
By two sum of the distance dik+dkjWith the d between node i and node jijCarry out numerical values recited comparison；
As two sum of the distance dik+dkjLess than the d between node i and node jijWhen, then predicate node i to node j passes through node
The distance of k is shorter；
Use two sum of the distance dik+dkjUpdate the dij；
The inspection to the node k is repeated, until all node updates finish.
5. the sub-area division method according to claim 4 based on network structure specificity analysis, which is characterized in that the side
Method further includes following step:
In recurrence renewal process, for node k, if dik+dkj<dij, then the path of predicate node i to node j change walk i → ...
→k→...→j；
Use pkjValue update pij。
6. the sub-area division method according to claim 1 based on network structure specificity analysis, which is characterized in that the meter
It is described to calculate the electricity after the step of calculating shortest path length matrix and all shortest path data in the electric power networks
The side weight information of power network, and before the step of calculating weighting block degree index according to the side weight information being calculated
Further include following step:
After calculating shortest path length matrix and all shortest path data in electric power networks, judge in the electric power networks
Whether new network partition is occurred；
If it is determined that then executing the side right weight for calculating the electric power networks when occurring new network partition in the electric power networks
Information, and the step of weighting block degree index is calculated according to the side weight information being calculated；
If it is determined that not occurring new network partition in the electric power networks, then the weighting mould that the basis is calculated is executed
Lumpiness index exports the step of electromagnetic looped network partition content.
7. the sub-area division method according to claim 1 based on network structure specificity analysis, which is characterized in that the meter
The side weight information of the electric power networks is calculated, and weighting block degree index is calculated according to the side weight information being calculated
After step, before the step of weighting block degree index that the basis is calculated exports electromagnetic looped network partition content also
Include the following steps:
Judge whether each load-center substation is divided into different network partitions；
When determining that each load-center substation is divided into different network partitions, then judging, which whether there is in the network partition, does not wrap
Network partition containing load-center substation；
When determining there is the network partition not comprising load-center substation in the network partition, then load-center substation will not be included
Network partition is merged into the nearest network partition comprising load-center substation；
Weighting block degree index is calculated according to the side weight information being calculated；
When determining all-network subregion includes load-center substation, then the weighting block that the basis is calculated is executed
The step of spending index output electromagnetic looped network partition content；
When determine be divided into the same network partition there are identical load-center substation when, then return execute it is described to electric power networks into
Row simplifies, and the step of carrying out network partition to simplified electric power networks centered on each load-center substation.
8. the sub-area division method according to claim 7 based on network structure specificity analysis, which is characterized in that network point
The network partition for not including load-center substation is merged into nearest comprising hinge power transformation by the merging mode in area using greedy algorithm
The network partition stood.
9. the sub-area division method according to claim 7 based on network structure specificity analysis, which is characterized in that described
The calculating formula of weighting block degree index is calculated according to the side weight information being calculated are as follows:
In formula, SvwFor the admittance modulus value of the branch of connecting node vw, v, w are node, δ (cv, cw) it is modifying factor；s,svJust like
Give a definition:
Wherein,
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811530826.3A CN109449936A (en) | 2018-12-14 | 2018-12-14 | A kind of sub-area division method based on network structure specificity analysis |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811530826.3A CN109449936A (en) | 2018-12-14 | 2018-12-14 | A kind of sub-area division method based on network structure specificity analysis |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109449936A true CN109449936A (en) | 2019-03-08 |
Family
ID=65558351
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811530826.3A Pending CN109449936A (en) | 2018-12-14 | 2018-12-14 | A kind of sub-area division method based on network structure specificity analysis |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109449936A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110322051A (en) * | 2019-06-06 | 2019-10-11 | 国网浙江省电力有限公司经济技术研究院 | Consider the integrated energy system Optimal Configuration Method of N-1 security constraint |
| CN110336273A (en) * | 2019-06-10 | 2019-10-15 | 国网天津市电力公司 | 220 kv grid partition methods of one kind and device |
| CN110851619A (en) * | 2019-10-23 | 2020-02-28 | 北京科技大学 | Method and device for constructing personalized knowledge graph based on traditional Chinese medical record |
| CN111612271A (en) * | 2020-05-28 | 2020-09-01 | 国家电网公司西南分部 | Clean energy delivery planning and operation optimization method considering clean energy utilization rate |
| CN111612267A (en) * | 2020-05-28 | 2020-09-01 | 国家电网公司西南分部 | Hydropower cluster delivery net rack optimization method considering distant view horizontal year |
| CN111612272A (en) * | 2020-05-28 | 2020-09-01 | 国家电网公司西南分部 | Hydropower cluster delivery net rack optimization method considering leading reservoir |
| CN112001575A (en) * | 2019-05-10 | 2020-11-27 | 中国石油天然气股份有限公司 | Method and device for determining partitioning scheme of natural gas pipe network and storage medium |
| CN112163303A (en) * | 2020-08-20 | 2021-01-01 | 西安交通大学 | Power network simplifying method, storage medium and computing device |
| CN113204854A (en) * | 2021-06-03 | 2021-08-03 | 广西师范大学 | Power grid partitioning method based on generator node and network weighted topology |
-
2018
- 2018-12-14 CN CN201811530826.3A patent/CN109449936A/en active Pending
Non-Patent Citations (3)
| Title |
|---|
| 李春叶等: "电磁环网方式与分层分区运行方式之决策 ", 《电力学报》 * |
| 杨冬: "《中国优秀博士学位论文全文数据库 工程科技Ⅱ辑》", 15 October 2013 * |
| 杨冬等: "特高压电网电磁环网开环方案优化决策 ", 《高电压技术》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112001575A (en) * | 2019-05-10 | 2020-11-27 | 中国石油天然气股份有限公司 | Method and device for determining partitioning scheme of natural gas pipe network and storage medium |
| CN110322051A (en) * | 2019-06-06 | 2019-10-11 | 国网浙江省电力有限公司经济技术研究院 | Consider the integrated energy system Optimal Configuration Method of N-1 security constraint |
| CN110336273A (en) * | 2019-06-10 | 2019-10-15 | 国网天津市电力公司 | 220 kv grid partition methods of one kind and device |
| CN110851619A (en) * | 2019-10-23 | 2020-02-28 | 北京科技大学 | Method and device for constructing personalized knowledge graph based on traditional Chinese medical record |
| CN111612271A (en) * | 2020-05-28 | 2020-09-01 | 国家电网公司西南分部 | Clean energy delivery planning and operation optimization method considering clean energy utilization rate |
| CN111612267A (en) * | 2020-05-28 | 2020-09-01 | 国家电网公司西南分部 | Hydropower cluster delivery net rack optimization method considering distant view horizontal year |
| CN111612272A (en) * | 2020-05-28 | 2020-09-01 | 国家电网公司西南分部 | Hydropower cluster delivery net rack optimization method considering leading reservoir |
| CN111612272B (en) * | 2020-05-28 | 2021-11-30 | 国家电网公司西南分部 | Hydropower cluster delivery net rack optimization method considering leading reservoir |
| CN111612271B (en) * | 2020-05-28 | 2022-10-14 | 国家电网公司西南分部 | Clean energy delivery planning and operation optimization method considering clean energy utilization rate |
| CN112163303A (en) * | 2020-08-20 | 2021-01-01 | 西安交通大学 | Power network simplifying method, storage medium and computing device |
| CN112163303B (en) * | 2020-08-20 | 2022-12-09 | 西安交通大学 | Power network simplifying method, storage medium and computing device |
| CN113204854A (en) * | 2021-06-03 | 2021-08-03 | 广西师范大学 | Power grid partitioning method based on generator node and network weighted topology |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109449936A (en) | A kind of sub-area division method based on network structure specificity analysis | |
| Alonso et al. | Artificial immune systems optimization approach for multiobjective distribution system reconfiguration | |
| Lavorato et al. | A constructive heuristic algorithm for distribution system planning | |
| Miu et al. | Fast service restoration for large-scale distribution systems with priority customers and constraints | |
| CN107769191A (en) | key transmission cross-section automatic identifying method based on network topology and flow data | |
| Jiang et al. | A novel fuzzy multiobjective model using adaptive genetic algorithm based on cloud theory for service restoration of shipboard power systems | |
| CN108462194B (en) | Wide area optimization method for three-phase load imbalance of low-voltage power distribution network | |
| CN108233359A (en) | A kind of partition zone optimizing method and system of extra-high voltage alternating current-direct current feed-in receiving end power grid | |
| CN115395557A (en) | Active power distribution network fault rapid recovery method based on directed graph traversal | |
| CN108880886A (en) | A kind of trans-regional protecting electrical power system communication network planning method | |
| CN104392330A (en) | 500 kV/220 kV power grid partitioning strategy evaluation method | |
| Camargo et al. | Specialized genetic algorithm to solve the electrical distribution system expansion planning | |
| CN108667027A (en) | Ac and dc systems power flow transfer search containing flexible direct current and quantitative analysis method | |
| Dong et al. | Mitigating cascading failures of spatially embedded cyber–physical power systems by adding additional information links | |
| Grond et al. | Practice-oriented optimization of distribution network planning using metaheuristic algorithms | |
| Qi et al. | Optimal planning of smart grid communication network for interregional wide-area monitoring protection and control system | |
| Montoya et al. | A new approach to solve the distribution system planning problem considering automatic reclosers | |
| Aghamohammadi et al. | Controlled islanding based on the coherency of generators and minimum electrical distance | |
| CN115049254A (en) | Analytic hierarchy process based loop closing back load operation risk assessment method and system | |
| CN113449908A (en) | Power distribution network planning method and system considering demand side resources | |
| Babu et al. | Heuristic search strategy for service restoration using DFS and BFS techniques | |
| Xianchao et al. | Service restoration of distribution systems based on NSGA-II | |
| CN113629769B (en) | Line weight-based power grid partition searching method and system | |
| Yu et al. | Loads combination method based core schema genetic shortest-path algorithm for distribution network reconfiguration | |
| CN110518572A (en) | A kind of power distribution network isolated island division methods based on minimum load loss |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190308 |