CN105610153B - A kind of quick, intelligent partitioning algorithm based on cluster analysis - Google Patents
A kind of quick, intelligent partitioning algorithm based on cluster analysis Download PDFInfo
- Publication number
- CN105610153B CN105610153B CN201610029950.6A CN201610029950A CN105610153B CN 105610153 B CN105610153 B CN 105610153B CN 201610029950 A CN201610029950 A CN 201610029950A CN 105610153 B CN105610153 B CN 105610153B
- Authority
- CN
- China
- Prior art keywords
- cluster
- circuit
- values
- cut
- cut values
- 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
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 12
- 238000007621 cluster analysis Methods 0.000 title claims abstract description 9
- 238000000638 solvent extraction Methods 0.000 title claims abstract description 7
- 238000005192 partition Methods 0.000 claims abstract description 11
- 238000004364 calculation method Methods 0.000 abstract description 4
- 239000011159 matrix material Substances 0.000 description 5
- 238000000034 method Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000013499 data model Methods 0.000 description 1
- 230000002123 temporal effect Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000013316 zoning Methods 0.000 description 1
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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/36—Circuit design at the analogue level
- G06F30/367—Design verification, e.g. using simulation, simulation program with integrated circuit emphasis [SPICE], direct methods or relaxation methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/06—Electricity, gas or water supply
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- 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]
-
- 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02E—REDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
- Y02E60/00—Enabling technologies; Technologies with a potential or indirect contribution to GHG emissions mitigation
Abstract
The invention discloses a kind of quick, intelligent partitioning algorithm based on cluster analysis, and it is that single region plant stand number is more than m or the number of partitions is less than n to set partition termination condition first；Then using each plant stand as a cluster, the cut values between cluster and cluster are assigned according to the connection topological relation between cluster；The average value of the cut values between the cluster is obtained again, and then cluster that cut values are more than to average value merges, and forms new cluster, updates the cut values between cluster；Repeat upper step, until meeting end condition, then subregion is completed.The algorithm quickly can carry out Intelligent partition to power network, so as to provide guarantee to reduce amount of calculation.
Description
Technical field
The present invention relates to power system automatic field, more particularly to a kind of quick, intelligent subregion based on cluster analysis to calculate
Method.
Background technology
With the development of power network, capital construction, transformation project are largely gone into operation, and temporal fashion becomes increasingly complex, and operation of power networks faces
Challenge constantly strengthen.The first line of defence of the relay protection as power network, vital work is played to electric power netting safe running
With.To ensure the safe and stable operation of power system, many places have been built on ground leveling platform is based on intelligent scheduling technology branch
Hold system platform and build relay protection constant value on-line check and early warning application platform.
But found during actually checking, with the increase of electric network model, calculating speed exponentially declines.Because
When calculating, first have to generate bus admittance matrix, Node impedance matrix is obtained after then being inverted to admittance matrix, because to matrix
Invert be related to it is substantial amounts of calculate operation, with the increase of nodes, its used time exponentially of inverting rises, so passing through loading unit
Sub-model can greatly reduce to reduce the operation of nodes and calculate the used time, raising calculating speed.In order to adapt to this case,
Need to carry out quick subregion to power network.
The content of the invention
It is an object of the invention to provide a kind of intelligent algorithm based on cluster analysis, the algorithm can be carried out quickly to power network
Intelligent partition, so as to provide guarantee to reduce amount of calculation.
To achieve the above object, the present invention takes following technical scheme：
A kind of quick, intelligent partitioning algorithm based on cluster analysis, comprises the following steps：
(a) it is that single region plant stand number is more than m or the number of partitions is less than n to set partition termination condition；
(b) using each plant stand as a cluster, assigned according to the connection topological relation between cluster between cluster and cluster
Cut values, the cut values are the circuit number and each circuit weights sum between two clusters, and the circuit weights of the circuit of no mutual inductance are set
0 is set to, the circuit weights for having mutual inductance circuit are arranged to 100~200；
(c) average value of the cut values between the cluster is obtained, then cluster that cut values are more than to average value merges, and is formed new
Cluster, update the cut values between cluster；
(d) repeat step (c), the end condition until meeting step (a), then subregion completion.
Preferably, m values are that 500, n values are 5 in step (a), and the circuit weights for having mutual inductance circuit in step (b) are arranged to
100。
The present invention uses the thought of cluster analysis, and power is assigned according to the degree that is completely embedded and with the presence or absence of inductance to plant stand
Value, and mean value calculation is carried out on this basis, the plant stand that then will be greater than average value is divided into a region, new as one
Cluster, and constantly repeat this operation, it is known that complete subregion when meeting end condition.This method is simple and quick, intelligent strong, gained
Subregion is scientific and reasonable, reduces amount of calculation for the later stage and lays a good foundation.
Brief description of the drawings
Fig. 1 is cluster algorithm flow chart.
Fig. 2 is example plant stand annexation figure.
Fig. 3 annexation figures between cluster after renewal once.
Fig. 4 annexation figures between the cluster after the completion of subregion.
Embodiment
Using the partitioning algorithm of the present invention, the connection and mutual inductance situation to studied power network are it should be clear that these are
Initial data, scientific and reasonable quick subregion can be carried out with this algorithm on the basis of these initial data.
The present invention comprises the following steps：
(a) it is that single region plant stand number is more than m or the number of partitions is less than n to set partition termination condition；
(b) using each plant stand as a cluster, assigned according to the connection topological relation between cluster between cluster and cluster
Cut values, the cut values are the circuit number and each circuit weights sum between two clusters, and the circuit weights of the circuit of no mutual inductance are set
0 is set to, the circuit weights for having mutual inductance circuit are arranged to 100~200；
(c) average value of the cut values between the cluster is obtained, then cluster that cut values are more than to average value merges, and is formed new
Cluster, update the cut values between cluster；
(d) repeat step (c), the end condition until meeting step (a), then subregion completion.
M, n and mutual inductance circuit weights can be set according to power network scale and zoning objectives.
Illustrate the application of this method below by specific embodiment, this method flow chart is as shown in figure 1, electric involved by this example
Net as shown in Fig. 2 the topological connection relation of the power network as shown in Table 1 and Table 2.
Table 1
Table 1 is the data model of plant stand, represents the topological connection relation between each plant stand, and each plant stand corresponds to as a cluster
Unique node number.First, all clusters are numbered, this example is 10 plant stands, that is, there are 10 node numbers, and topological relation is closed by connection
Series determines.Annexation corresponding to the cluster that the interior joint number of table 1 is 1 is 2@1 and 3@1, then it represents that node number is 1 cluster and node
Number for 2 cluster between have a connection, a circuit between the cluster that the cluster and node number that node number is 1 are 3 be present.Equally
Also represent that representation is the@mutual inductances branch road 2 of mutual inductance branch road 1, such as table 2 by the node number of cluster for the circuit of mutual inductance relationships be present
It is shown.
Table 2
The node number of mutual inductance branch route first and last cluster represents, as mutual inductance be present between circuit L12 and circuit L15, then it represents that be
(8,9)@(8,10).Then cut values are calculated according to Tables 1 and 2, represented with a matrix type, ranks are the node number of cluster.
cutijCut values between cluster i and cluster j, cut values are the circuit number and each circuit weights sum between two clusters,
The circuit weights of circuit without mutual inductance are arranged to 0, and the circuit weights for having mutual inductance circuit are arranged to 100.Because plant stand itself with from
Connection between body, arranged so 10 plant stands are 9 rows 9.
The average value for obtaining cut between all clusters is 32.3 (numbers of cut values sum divided by cut values), then cut values
Cluster more than cut average values merges, that is, it is a new cluster to merge cluster 8, cluster 9, cluster 10, and cluster 2, cluster 3, cluster 4 are a new cluster；
Cluster after merging is as shown in figure 3, judge whether to meet partition termination condition.Because the electric network model of citing is smaller,
Using each plant stand as a cluster, if each initial cluster of Fig. 2 is that have accumulated the set of the cluster after n times, then now
End condition may be met, be divided into 6 regions.If being still unsatisfactory for, the cut values between new cluster are recalculated；
Merge cluster 1, cluster 2, cluster 6, while merge cluster 3 and cluster 5, generate the model of new cluster as shown in figure 4, now number of regions
For 3, subregion is completed.
Above-described embodiment is to present inventive concept and the explanation realized, is not limited, in the present invention
Under design, without the technical scheme that substantially converts still in protection domain.
Claims (2)
1. a kind of quick, intelligent partitioning algorithm based on cluster analysis, comprises the following steps：
(a) it is that single region plant stand number is more than m or the number of partitions is less than n to set partition termination condition；
(b) using each plant stand as a cluster, the cut between cluster and cluster is assigned according to the connection topological relation between cluster
Value, the cut values are the circuit number and each circuit weights sum between two clusters, and the circuit weights of the circuit of no mutual inductance are arranged to
0, the circuit weights for having mutual inductance circuit are arranged to 100~200；
(c) average value of the cut values between the cluster is obtained, then cluster that cut values are more than to average value circuit both ends merges, shape
Into new cluster, the cut values between cluster are updated；
(d) repeat step (c), the end condition until meeting step (a), then subregion completion.
2. the quick, intelligent partitioning algorithm based on cluster analysis as claimed in claim 1, it is characterised in that m values in step (a)
It is 5 for 500, n values, the circuit weights for having mutual inductance circuit in step (b) are arranged to 100.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610029950.6A CN105610153B (en) | 2016-01-18 | 2016-01-18 | A kind of quick, intelligent partitioning algorithm based on cluster analysis |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610029950.6A CN105610153B (en) | 2016-01-18 | 2016-01-18 | A kind of quick, intelligent partitioning algorithm based on cluster analysis |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105610153A CN105610153A (en) | 2016-05-25 |
| CN105610153B true CN105610153B (en) | 2017-12-26 |
Family
ID=55989784
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610029950.6A Active CN105610153B (en) | 2016-01-18 | 2016-01-18 | A kind of quick, intelligent partitioning algorithm based on cluster analysis |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105610153B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006119482A2 (en) * | 2005-05-04 | 2006-11-09 | West Virginia University Research Corporation | Method for data clustering and classification by a graph theory model -- network partition into high density subgraphs |
| CN103577896A (en) * | 2013-11-12 | 2014-02-12 | 国网安徽省电力公司 | Regional division method for large-scale power grid setting calculation |
| CN104821580A (en) * | 2015-05-08 | 2015-08-05 | 杭州沃瑞电力科技有限公司 | Three-phase reactive power control partitioning method based on reactive power source clustering analysis |
| CN105184669A (en) * | 2015-08-25 | 2015-12-23 | 四川大学 | 220kV urban ring network partitioning method based on node set GN splitting-up algorithm |
-
2016
- 2016-01-18 CN CN201610029950.6A patent/CN105610153B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006119482A2 (en) * | 2005-05-04 | 2006-11-09 | West Virginia University Research Corporation | Method for data clustering and classification by a graph theory model -- network partition into high density subgraphs |
| CN103577896A (en) * | 2013-11-12 | 2014-02-12 | 国网安徽省电力公司 | Regional division method for large-scale power grid setting calculation |
| CN104821580A (en) * | 2015-05-08 | 2015-08-05 | 杭州沃瑞电力科技有限公司 | Three-phase reactive power control partitioning method based on reactive power source clustering analysis |
| CN105184669A (en) * | 2015-08-25 | 2015-12-23 | 四川大学 | 220kV urban ring network partitioning method based on node set GN splitting-up algorithm |
Non-Patent Citations (3)
| Title |
|---|
| K-AP: Generating Specified K Clusters by Efficient Affinity Propagation;Xiangliang Zhang，et al;《2010 IEEE International Conference on Data Mining》;20101231;全文 * |
| 基于聚类的阶段理论线损快速计算与分析;李学平;《电工技术学报》;20150630;第30卷(第12期);全文 * |
| 基于聚类经验模态分解和最小二乘支持向量机的短期风速组合预测;王贺 等;《电工技术学报》;20140430;第29卷(第4期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105610153A (en) | 2016-05-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106972504B (en) | Interval reactive power optimization method based on genetic algorithm | |
| CN104809309B (en) | A kind of method and device of the three-dimensional automatic routing based on Quick Extended random tree | |
| CN105511801B (en) | The method and apparatus of data storage | |
| EP2482417A2 (en) | Systems, Methods, and Apparatus for Accelerating Volt/VAR Load Flow Optimization | |
| CN104050536B (en) | Topology analysis method for power distribution network crossing voltage grades | |
| CN109919313B (en) | Gradient transmission method and distributed training system | |
| CN100481668C (en) | Parallel computation method for large-scale electrical power system network tidal current segmentation | |
| JP2014039463A5 (en) | ||
| CN107886158A (en) | A kind of bat optimized algorithm based on Iterated Local Search and Stochastic inertia weight | |
| CN109638838A (en) | The recognition methods of power grid key sections, device and electronic equipment | |
| CN104462714B (en) | A kind of municipal drain network plane layout design optimized calculation method | |
| CN112818588B (en) | Optimal power flow calculation method, device and storage medium of power system | |
| CN106254244A (en) | A kind of merging stream list item method based on SDN | |
| CN107046501A (en) | For SDN determining method of path, device, computer equipment and storage medium | |
| CN105471893B (en) | A kind of distributed equivalent data flow connection method | |
| CN111526213A (en) | Equipment control system based on block chain | |
| CN106228459A (en) | Equivalent reliability estimation method based on Monte Carlo | |
| CN109710542A (en) | A kind of completely N-ary tree construction method and device | |
| CN109378819A (en) | The power system voltage partition method and system verified based on spectral clustering and modularity | |
| CN103633668A (en) | Reconstruction method of power distribution network | |
| CN105610153B (en) | A kind of quick, intelligent partitioning algorithm based on cluster analysis | |
| CN111199494A (en) | Method and device for improving setting calculation speed of power system | |
| CN110275868A (en) | A kind of multi-modal pretreated method of manufaturing data in intelligent plant | |
| CN110046838A (en) | A kind of rail traffic industrial chain configuration method based on multilayer complex network | |
| CN105896565B (en) | Var Optimization Method in Network Distribution based on proportion Mutation Particle Swarm Optimizer |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| CB03 | Change of inventor or designer information |
Inventor after: Gao Yan Inventor after: Ma Jingjing Inventor after: Han Tao Inventor after: Cai Guihua Inventor after: Hu Wenli Inventor after: Wang Zhigang Inventor after: Xu Songxiao Inventor after: Jin Liping Inventor after: Wan Hongyan Inventor after: Wang Rui Inventor after: Guo Lirui Inventor after: Zhang Baoping Inventor after: Cao Lei Inventor before: Gao Yan Inventor before: Wang Zhigang Inventor before: Xu Songxiao |
|
| CB03 | Change of inventor or designer information |