CN106888112B - A kind of node migration network blocks optimization method based on quick splitting algorithm - Google Patents
A kind of node migration network blocks optimization method based on quick splitting algorithm Download PDFInfo
- Publication number
- CN106888112B CN106888112B CN201710043297.3A CN201710043297A CN106888112B CN 106888112 B CN106888112 B CN 106888112B CN 201710043297 A CN201710043297 A CN 201710043297A CN 106888112 B CN106888112 B CN 106888112B
- Authority
- CN
- China
- Prior art keywords
- node
- network
- tearing
- sub
- segmentation
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 23
- 238000013508 migration Methods 0.000 title claims abstract description 16
- 230000005012 migration Effects 0.000 title claims abstract description 16
- 238000005457 optimization Methods 0.000 title claims abstract description 11
- 230000011218 segmentation Effects 0.000 claims abstract description 23
- 239000013257 coordination network Substances 0.000 claims abstract description 20
- 238000005520 cutting process Methods 0.000 claims abstract description 9
- 125000000205 L-threonino group Chemical group [H]OC(=O)[C@@]([H])(N([H])[*])[C@](C([H])([H])[H])([H])O[H] 0.000 claims description 4
- 230000001174 ascending effect Effects 0.000 claims description 2
- 230000000875 corresponding effect Effects 0.000 description 11
- 238000006243 chemical reaction Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000012512 characterization method Methods 0.000 description 2
- 230000002596 correlated effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000007704 transition Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
Abstract
The invention discloses a kind of, and the node based on quick splitting algorithm migrates network blocks optimization method, comprising: selects weak route based on quick splitting algorithm；By the road institute connecting node of cutting, according to certain principle, current cutting branch is selected by it inside corresponding sub-network internal migration to coordination network, i.e. tearing node set；Segmentation object conditional function K is defined, the reasonability of segmentation is characterized,Symbol " | " characterizes condition premise, and condition premised on symbol the right, the left side corresponds to final goal conditional function value；VconetThe tearing interstitial content for including by coordination network；Vnet_i、Vnet_jFor after dividing i-th, the total number of j sub- the included node of network internal.When the method for the present invention is applied to the parallel computation of electric power system tide, more complete, system will be become, the determination for isolating node member of as node split algorithm provides a kind of objective basis.
Description
Technical field
The present invention relates to electric power networks block levels, and in particular to a kind of node migration network based on quick splitting algorithm
Piecemeal optimization method.
Background technique
The basic thought of electric system parallel computation is by electric power networks according to geographical or network topology connection structure, segmentation
At several sub-networks and a coordination network, and sub-network pass through each other one group of boundary number corresponding with coordination network into
Row connection.At this point, the practicable parallelization of related operation calculates inside sub-network.Wherein, as the node of one of dividing method point
Split method and divide power system network having, while to realize parallel computation advantage, also can because can not it is objective reasonably really
Determine split vertexes collection, and occur can not expanded application bottleneck.
Summary of the invention
Technical problem to be solved by the invention is to provide a kind of, and the node based on quick splitting algorithm migrates network blocks
Optimization method when being applied to the parallel computation of electric power system tide, will become more complete, system, and as node split is calculated
The determination for isolating node member of method provides a kind of objective basis.
In order to solve the above technical problems, the technical solution adopted by the present invention is that:
A kind of node migration network blocks optimization method based on quick splitting algorithm, comprising the following steps:
Step 1: weak route is selected based on quick splitting algorithm, it may be assumed that calculate the side cluster of all routes in electric power networks
Coefficient；By side cluster coefficients, currently includes that all routes carry out ascending sort to network, obtain when front cluster coefficients are the smallest
Route is denoted as after curLine and is added in weak line set；CurLine is removed from current network, repeats sequence addition
Step, until all nodes of electric power networks are degenerated for an isolated node corporations；
Step 2: by the road institute connecting node of cutting, according to certain principle, selecting current cutting branch for it from corresponding
Sub-network internal migration to coordination network inside, i.e., tearing node set；
The principle refers to: when gradually by two end nodes corresponding to current weak route respectively as tearing node: 1)
The big node of priority migration neighborhood Connected degree；2) priority migration does not increase the tearing node in the form of isolated island there are node；If 3)
Both ends neighbor domain of node Connected degree is identical, and does not increase isolated island node, randomly selects node as tearing node；4) made before this
For tear node node, be performed both by lock operation, and if subsequent newly-increased tearing node be locked in tear node set in,
Go to selecting for the tearing node of next weak route；5) it when one tearing node of every acquisition, need to be calculated using depth-first search
Method judges current network segmentation pattern, stores current each sub-network and the included node serial number of coordination network and line information；
Step 3: segmentation object conditional function K is defined, the reasonability of segmentation is characterized:
In formula, symbol " | " characterizes condition premise, and condition premised on symbol the right, the left side corresponds to final goal condition letter
Numerical value；VconetThe tearing interstitial content for including by coordination network；Vnet_i、Vnet_jFor after dividing i-th, j sub- network internals
The total number of included node.
Further, during tearing, each sub-network scale in corresponding sub-network set that sets occupies complete network rule
The threshold value thres of mould terminates tearing process if reaching the proportionality coefficient prop of setting lower than the sub-network number of this threshold value.
Compared with prior art, the beneficial effects of the present invention are: the problems such as it is applied to electric power system tide, short circuit current
Parallel computation in application, more complete, system will be become, the determining for node member of isolating of as node split algorithm provides
A kind of objective basis.
Detailed description of the invention
Fig. 1 is Branch cutting-node tearing transition diagram.
Fig. 2 is that node migrates network blocks optimized flow chart.
Fig. 3 system partitioning pattern schematic diagram.
Specific embodiment
The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments.The method of the present invention first with
Quick splitting algorithm determines the line set of electric power networks topological link relationship weakness；Secondly, the concept of " migration " is introduced, by this
Weak route is converted to split vertexes in set, to determine split vertexes set and segmentation pattern set；Finally, according to segmentation mesh
Conditional function is marked, electric power networks optimum segmentation pattern is selected.Details are as follows:
One, the weak route based on quick splitting algorithm is selected
The application of Complex Networks Theory in the power system has reached its maturity, such as electric network composition identification, idle subregion, network
Dynamic analysis and 500/220kV electromagnetic looped network unlink.Quick splitting algorithm in Complex Networks Theory is as community discovery
The initiative algorithm of aspect is a kind of typical splitting algorithm.Its basic thought is using a kind of new standard --- side cluster system
Number replace in GN splitting algorithms while betweenness come measure the different corporations of connection two while.The definition of node clustering coefficient is copied,
While cluster coefficients be defined as it is practical comprising this while triangle number and it is all may the number comprising the triangle on the side it
Than.Specifically, its cluster coefficients are defined as the side of connecting node i and node j
Cij.3=(Zij.3+1)/(min[ki-1,kj-1]) (1)
In formula: Cij.3Indicate the number of the triangle comprising the side；ki、kjThe then node degree of corresponding node i, j；Wherein, min
[ki-1,kj- 1] smaller value of the two is then indicated.
By formula (1) it is found that the connection of corporations' internal edges is closer, therefore there are many triangles, i.e. its side cluster
Coefficient value Cij.3It is larger, and connect the side between Liang Ge corporations in few triangle or do not wrapped by any triangle
Contain, therefore Cij.3It is worth smaller.It can be seen that Cij.3Size can be used as it is a kind of measure side corporations between internuncial standard.The value
Corresponding side is the weak route.
Therefore, the present invention combines quick splitting algorithm to obtain the fragile line of weakness of characterization power system network topology connection
Road set, comprising steps of 1) calculating the side cluster coefficients of all routes in electric power networks；2) side cluster coefficients are pressed, network is worked as
It is preceding to carry out descending sort comprising all routes, it obtains and works as the smallest route of front cluster coefficients, be denoted as after curLine and be added to
In weak line set；3) curLine is removed from current network, repeats step 2), until all nodes of electric power networks move back
Turn to an isolated node corporations.
Two, node tearing segmentation conversion
After weak line set acquired in quick splitting algorithm, it is gradually regarded as to electric power networks initial finger and is cut
Cut object.To obtain the segmentation under tearing joint form, then needs to cut branch and be converted to tearing node.Convert basic thought
For the road institute connecting node of cutting is selected one from corresponding sub-network internal migration to coordination according to certain principle
Network internal, i.e. tearing node set.
Fig. 1 shows a simplified examples.Fig. 1 (a) is the network of two Branch cuttings segmentation, determines sequence in front two
Cutting branch is (v2, v4) and (v5, v4), and side cluster coefficients are respectively 0.67 and 0.50.It is converted into node tearing point
The cutting object of needs is cut, there are many conversion method, Fig. 1 shows possible 2 kinds of conversions, and Fig. 1 (b) is by the section in sub-network 1
Point v2, v5 are migrated into tearing node set；Similarly, Fig. 1 (c) migrates the node v4 in sub-network 2 to tearing node collection
In conjunction.The two is all node tearing segmentation, and complete network is divided into sub-network 1,2 and coordination network form.Wherein, it tears
Node set is respectively { v4 }, { v2, v5 }.
Different conversion methods are formed by coordination network and sub-network, and the node member for being included is different.Wherein,
Sub-network 1,2 and the included node member of coordination network after tearing by { v4 } are respectively { v1, v2, v3, v5 }, { v6, v7, v8 }
{ v4 }；By { v2, v5 } tearing after sub-network 1,2 and the included node member of coordination network be respectively { v1, v3 }, v4,
V6, v7, v8 } and { v2, v5 }.The difference of the two tearing, which is the former only, needs migration v4 node, and the latter need to migrate two nodes,
Just realize the purpose of network blocks, it is clear that increase the complexity of operation.
Optimal migration in order to obtain, it is necessary to fall into a trap and certain principle in transition process, migration combination be optimized with this,
It can make segmentation object Function Optimization.Further consider five principles, refers specifically to gradually by both ends corresponding to current weak route
When node is respectively as tearing node: 1) the big node of priority migration neighborhood Connected degree.The premise that neighborhood Connected degree judges is thin
The gradually traversal of weak line road k, k+1 item；2) priority migration does not increase the tearing node in the form of isolated island there are node；If 3) both ends
Neighbor domain of node Connected degree is identical, and does not increase isolated island node, randomly selects node as tearing node；4) it has been used as and has torn before this
The node for splitting node, is performed both by lock operation, and if subsequent newly-increased tearing node be locked in tearing node set in, go to
The tearing node of next weakness route is selected；5) when one tearing node of every acquisition, need to be sentenced using Depth Priority Algorithm
Disconnected current network segmentation pattern stores current each sub-network and the included node serial number of coordination network and line information.
During tearing, each sub-network scale in corresponding sub-network set that need to set occupies the threshold value of complete network scale
Thres terminates tearing process if reaching the proportionality coefficient prop of setting lower than the sub-network number of this threshold value.Threshold value setting
Depending on foundation network size, and the setting of this threshold value is affected to network division, that is, it is possible that more small rule after dividing
The sub-network or isolated node of mould.And increase the excessive number for crossing small scale network, it will be shown because of the processing of each sub-network data
Must be cumbersome, and waste process resource.At this point, the mode that merging can be used suitably assembles each small-scale sub-network, to be formed
Medium scale network, this given threshold need to be reached by increasing sub-network scale after merging newly, can be used as final sub-network.
For principle 2), it is to realize power flow parallel computing that grid, which divides purpose, to improve operation efficiency.Newly-increased isolated island
When node is calculated as a sub-network, each node of the network hindering certainly relative to short-circuited node when such as calculation of short-circuit current
Anti- or mutual impedance element the obvious very little of calculation amount, and isolated island node is compared, the scale of other sub-networks still can be very big, calculates speed
Operation of the degree still depending on the self-impedance, mutual impedance correlated variables of extensive sub-network.Therefore, isolated node excessively both wasted into
Cheng Ziyuan can not also improve the efficiency of concurrent operation.
Three, divide optimization aim conditional function
Segmentation optimization aim is to keep each subprocess load corresponding with Load flow calculation balanced as far as possible, i.e., inside each sub-network
Parallel computation amount substantial equilibrium, so each subtask execute the time and will not depend on the self-impedance, mutually of the excessive sub-network of scale
The calculating of impedance correlated variables；And under the premise of reaching the objective division of network, the tearing node that coordination network is included is few as far as possible.
Therefore, it can define the segmentation object conditional function K as shown in formula (1), to characterize the reasonability of segmentation.In formula (1), symbol " | "
Characterization condition premise, on the right of the symbol premised on condition, the left side corresponds to final goal conditional function value.
In formula: VconetThe tearing interstitial content for including by coordination network；Vnet_i、Vnet_jFor after dividing i-th, j it is sub
The total number of the included node of network internal.
To verify the validity that proposed node migrates network blocks method, using 30 node system of IEEE as test example.
The weak line set of the network is obtained using quick splitting algorithm, as shown in table 1.
1 IEEE of table, 30 node system partial line roadside cluster coefficients
More in view of route, table 1 only arranges the side cluster coefficients write out to sorting in preceding 8 routes weakness route, arranges in table
Sequence sequence from top to bottom, from left to right.It on this basis, is respectively after 0.3,0.95, by the system in setting thres, prop
The form for being gradually converted into sub-network set and coordination network and depositing determines optimal further combined with segmentation condition objective function K
Segmentation pattern, i.e. 8 sub-networks and a coordination network, corresponding K value is maximum, is 0.0909.Finally, small scale network is carried out
Appropriate to merge, final system subregion pattern in such as Fig. 3 by characterizing, i.e. sub-network 1,2, cover respectively node member for 7,10,
17,20,21,16,19,18,14},{23,24,25,26,28,8,29,30,11,13}；Coordination network include node be 3,4,
6、9、12、15、22、27、2、5、1}。
Claims (2)
1. a kind of node based on quick splitting algorithm migrates network blocks optimization method, which comprises the following steps:
Step 1: weak route is selected based on quick splitting algorithm, it may be assumed that calculate the side cluster coefficients of all routes in electric power networks；
By side cluster coefficients, currently includes that all routes carry out ascending sort to network, obtains and work as the smallest route of front cluster coefficients,
It is denoted as after curLine and is added in weak line set；CurLine is removed from current network, repeats sequence addition step,
Until all nodes of electric power networks are degenerated for an isolated node corporations；
Step 2: branch institute connecting node will be cut, according to certain principle, select current cutting branch for it from corresponding son
Network internal moves to inside coordination network, i.e. tearing node set；
The principle refers to: when gradually by two end nodes corresponding to current weak route respectively as tearing node: 1) preferential
Migrate the big node of neighborhood Connected degree；2) priority migration does not increase the tearing node in the form of isolated island there are node；If 3) both ends
Neighbor domain of node Connected degree is identical, and does not increase isolated island node, randomly selects node as tearing node；4) it has been used as and has torn before this
The node for splitting node, is performed both by lock operation, and if subsequent newly-increased tearing node be locked in tearing node set in, go to
The tearing node of next weakness route is selected；5) when one tearing node of every acquisition, need to be sentenced using Depth Priority Algorithm
Disconnected current network segmentation pattern stores current each sub-network and the included node serial number of coordination network and line information；
Step 3: segmentation object conditional function K is defined, the reasonability of segmentation is characterized:
In formula, symbol " | " characterizes condition premise, and condition premised on symbol the right, the left side corresponds to final goal conditional function value；
VconetThe tearing interstitial content for including by coordination network；Vnet_i、Vnet_jBy after dividing i-th, j sub- network internals are wrapped
Total number containing node.
2. a kind of node based on quick splitting algorithm as described in claim 1 migrates network blocks optimization method, feature
It is, during tearing, each sub-network scale in corresponding sub-network set that sets occupies the threshold value of complete network scale
Thres terminates tearing process if reaching the proportionality coefficient prop of setting lower than the sub-network number of this threshold value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710043297.3A CN106888112B (en) | 2017-01-19 | 2017-01-19 | A kind of node migration network blocks optimization method based on quick splitting algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710043297.3A CN106888112B (en) | 2017-01-19 | 2017-01-19 | A kind of node migration network blocks optimization method based on quick splitting algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106888112A CN106888112A (en) | 2017-06-23 |
| CN106888112B true CN106888112B (en) | 2019-10-18 |
Family
ID=59176276
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710043297.3A Expired - Fee Related CN106888112B (en) | 2017-01-19 | 2017-01-19 | A kind of node migration network blocks optimization method based on quick splitting algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106888112B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111626463B (en) * | 2020-03-31 | 2022-09-23 | 国网宁夏电力有限公司经济技术研究院 | Electric power system short circuit current parallel coordination method based on Hadoop framework |
| CN111770514B (en) * | 2020-06-28 | 2022-07-08 | 湖北工业大学 | Optimization generation method for backbone network of wireless ad hoc network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103246933A (en) * | 2013-04-02 | 2013-08-14 | 中国南方电网有限责任公司 | Online check partition method based on virtual impedance matrix and boundary node migration |
| US8934366B2 (en) * | 2012-04-20 | 2015-01-13 | Cisco Technology, Inc. | Distributed node migration between routing domains |
| CN104810826A (en) * | 2015-05-07 | 2015-07-29 | 东南大学 | Bidirectional iteration parallel probability load flow calculation method combining Latin hypercube sampling |
| CN105184669A (en) * | 2015-08-25 | 2015-12-23 | 四川大学 | 220kV urban ring network partitioning method based on node set GN splitting-up algorithm |
| CN105932675A (en) * | 2016-06-30 | 2016-09-07 | 四川大学 | Parallel coordination algorithm for power flow of power system |
-
2017
- 2017-01-19 CN CN201710043297.3A patent/CN106888112B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8934366B2 (en) * | 2012-04-20 | 2015-01-13 | Cisco Technology, Inc. | Distributed node migration between routing domains |
| CN103246933A (en) * | 2013-04-02 | 2013-08-14 | 中国南方电网有限责任公司 | Online check partition method based on virtual impedance matrix and boundary node migration |
| CN104810826A (en) * | 2015-05-07 | 2015-07-29 | 东南大学 | Bidirectional iteration parallel probability load flow calculation method combining Latin hypercube sampling |
| CN105184669A (en) * | 2015-08-25 | 2015-12-23 | 四川大学 | 220kV urban ring network partitioning method based on node set GN splitting-up algorithm |
| CN105932675A (en) * | 2016-06-30 | 2016-09-07 | 四川大学 | Parallel coordination algorithm for power flow of power system |
Non-Patent Citations (2)
| Title |
|---|
| Development of an MPI for power system distributed parallel;Qi Huang, Jianbo Yi, Shi Jing, Ke Huang;《IEEE，International Symposium on Parallel Computing in Electrical Engineering》;20060917;全文 * |
| 基于节点迁移的电力系统并行计算优化分割策略;万黎;《电网技术》;20070630;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106888112A (en) | 2017-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109272170B (en) | A kind of traffic zone dividing system based on Louvain algorithm | |
| CN110321999A (en) | Neural computing figure optimization method | |
| CN104466959A (en) | Power system key line identification method and system | |
| CN105893637A (en) | Link prediction method in large-scale microblog heterogeneous information network | |
| CN105721228A (en) | Method for importance evaluation of nodes of power telecommunication network based on fast density clustering | |
| CN105976048A (en) | Power transmission network extension planning method based on improved artificial bee colony algorithm | |
| CN106888112B (en) | A kind of node migration network blocks optimization method based on quick splitting algorithm | |
| CN107944705A (en) | A kind of all terminal reliability computational methods that communication corporations are divided based on modularity | |
| CN103888541A (en) | Method and system for discovering cells fused with topology potential and spectral clustering | |
| CN108765180A (en) | The overlapping community discovery method extended with seed based on influence power | |
| CN106485211B (en) | A kind of line of text accurate positioning method based on binary tree | |
| CN113190939B (en) | Large sparse complex network topology analysis and simplification method based on polygon coefficient | |
| CN110309248A (en) | A method of the traffic route network based on Voronoi diagram divides traffic zone automatically | |
| CN108847993B (en) | Link prediction method based on multi-order path intermediate node resource allocation | |
| CN111626338B (en) | Cloud environment matching method, device, equipment and medium based on fusion classification model | |
| CN106875043B (en) | Node migration network block optimization method based on GN splitting algorithm | |
| CN110162716B (en) | Influence community searching method and system based on community retrieval | |
| CN108960335A (en) | One kind carrying out efficient clustering method based on large scale network | |
| CN108595631A (en) | Three-dimensional CAD model bilayer search method based on Graph Spectral Theory | |
| CN104967114A (en) | Power grid load real-time digital modeling method and system | |
| CN110086670A (en) | Large-scale complex network community discovery method and application based on local neighbor information | |
| CN109711425A (en) | Urban road skeleton hierarchical division method and system | |
| CN109992593A (en) | A kind of large-scale data parallel query method based on subgraph match | |
| CN106780747B (en) | A kind of method that Fast Segmentation CFD calculates grid | |
| CN110881178B (en) | Data aggregation method for Internet of things based on branch migration |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20191018 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |