CN110048412A - A kind of coalmine high-voltage power network self-adaptive parallel topology analyzing method based on population - Google Patents

A kind of coalmine high-voltage power network self-adaptive parallel topology analyzing method based on population Download PDF

Info

Publication number
CN110048412A
CN110048412A CN201910330441.0A CN201910330441A CN110048412A CN 110048412 A CN110048412 A CN 110048412A CN 201910330441 A CN201910330441 A CN 201910330441A CN 110048412 A CN110048412 A CN 110048412A
Authority
CN
China
Prior art keywords
matrix
row
value
population
power network
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
Application number
CN201910330441.0A
Other languages
Chinese (zh)
Inventor
吴君
王新良
王新宇
刘志怀
刘娜
方玮
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hami Yuxin Energy Industry Research Institute LLC
Original Assignee
Hami Yuxin Energy Industry Research Institute LLC
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hami Yuxin Energy Industry Research Institute LLC filed Critical Hami Yuxin Energy Industry Research Institute LLC
Priority to CN201910330441.0A priority Critical patent/CN110048412A/en
Publication of CN110048412A publication Critical patent/CN110048412A/en
Pending legal-status Critical Current

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

Landscapes

  • Engineering & Computer Science (AREA)
  • Power Engineering (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

Coalmine high-voltage power network number of switches is more, and it is larger directly to complete coalmine high-voltage power network topological analysis time overhead using existing topological analysis algorithm.In order to which topological analysis time overhead is effectively reduced, the invention proposes a kind of coalmine high-voltage power network self-adaptive parallel topological analysis algorithm based on population, coal mine high voltage supply system is divided into several local coal mine high voltage supply system figures first, the matrix Ym then obtained according to the Parallel schedule proposed based on particle swarm algorithm completes the concurrent topology analysis of coalmine high-voltage power network.Coalmine high-voltage power network self-adaptive parallel topological analysis algorithm proposed by the present invention based on population can effectively realize coalmine high-voltage power network self-adaptive parallel topological analysis, improve computational efficiency.

Description

A kind of coalmine high-voltage power network self-adaptive parallel topology analyzing method based on population
Technical field
The invention discloses a kind of coalmine high-voltage power network self-adaptive parallel topology analyzing method based on population, belongs to coal Mine high voltage supply network automated topology analytical calculation field.
Background technique
Coalmine high-voltage power network number of switches is more, directly completes coalmine high-voltage power network using existing topological analysis algorithm and opens up It is larger to flutter analysis time expense.In order to which topological analysis time overhead is effectively reduced, the present invention is based on particle swarm algorithm propositions A kind of Parallel schedule can effectively realize coalmine high-voltage power network self-adaptive parallel topological analysis, improve computational efficiency.
Summary of the invention
Coal mine high voltage supply system high-voltage switch quantity is more, how to realize that coalmine high-voltage power network concurrent topology is analyzed, Reducing topological analysis time overhead is the critical issue that the present invention needs to solve.Realize that coal mine high voltage supply system is parallel Topological analysis first has to for coal mine high voltage supply system to be divided into several local coal mine high voltage supply system figures, specific piecemeal Process is as follows:
Step (1): all general incoming switches and general outlet switch in coal mine high voltage supply system figure are added to set B In；All electric power incoming line switches are added in set A, the value of i is set as 1, executes step (2)；
Step (2): taking out an electric power incoming line switch from set A, which is indicated with C, which is added set FiIn, And set F is added in the electric power incoming line switch powered to switch CiIn, it executes step (3)；
Step (3): searching the general incoming switch adjacent with switch C in set B, if the switch exists, is indicated with D, from Switch D is taken out in set B, which is added set FiIn set M, a switch is taken out from set M, executes step (4)；
Step (4): the switch taken out from set M is indicated with N, and the general outlet adjacent with switch N is searched in set B and is opened It closes, if the switch exists, is indicated with E, switch E is taken out from set B, which is added set FiIn, and by the switch It is added in set G, a switch is taken out from set G, is executed step (5)；
Step (5): the switch taken out from set G is indicated with H, and the switch K adjacent with switch D is searched in set B, if should Switch exists, and executes step (6)；If the switch is not present, execute step (7)；
Step (6): if switch K is general outlet switch, set G and set F is added in switchiIn, one is taken out from set G A switch executes step (5)；If switch K is general interconnection switch, set F is added in switchiIn, it executes step (6)；Such as Fruit switch K is general incoming switch, and set F is added in switchiIt neutralizes in set M, executes step (7)；
Step (7): if set M is not empty, one switch of taking-up, execution step (4) from set M；If set M is sky, The numerical value of i is added 1, is executed step (8)；
Step (8): if set A is not empty, execution step (2)；If set A is sky, execute step (9)；
Step (9): simply by the presence of identical interconnection switch in different sets Fi, different sets are just merged into a set, most The corresponding local coal mine high voltage supply system figure of each set after being merged eventually.
It is assumed that coal mine high voltage supply system figure is divided into d local coal mine high voltage supply according to above-mentioned group forming criterion System diagram, matrix TimeOverheadData are the matrix that d row 1 arranges, i-th of element ti meOverheadDataiNumerical value Equal to the topological analysis time of last i-th local coal mine high voltage supply system figure, wherein 1≤i≤d.It is calculated based on population Several elements in matrix TimeOverheadData are added separately to V queue Q by methodjIn, when making topological analysis in every group Between the sum of variance it is minimum, wherein 1≤j≤V.Specific step is as follows:
Step (1): initializing particle swarm algorithm parameter, and initial population quantity N, population Spatial Dimension d, inertia is arranged Weight w, accelerator coefficient c1 and c2, rate limitation vlimit, particle swarm algorithm the number of iterations ger=1；It is assumed that system allows to establish Thread Count is V；
Step (2): initial population matrix X is generated, matrix X is the null matrix of N row d column under initial situation, by each of matrix The number number V being randomly generatediReplacement, 1≤Vi≤V；Matrix Xm saves the history optimum position of each individual, by the value of new matrix X Xm is assigned, even Xm=X, is executed step (3)；
Step (3): initializing the renewal speed VE of population, and VE is the random matrix of N row d column, by each of matrix The number number K1 replacement being randomly generated, the value of K1 is -1,0 or 1；The history optimum position matrix Ym, Ym of population are generated simultaneously For the matrix of 1 row d column, the history optimal adaptation degree matrix of each individual is indicated with fxm, and fxm is the matrix that N row 1 arranges；Population is gone through History optimal adaptation degree is indicated with fym；
Step (4): Y is used in the corresponding grouping of i-th of element in matrix TimeOverheadDataiIt indicates, matrix Element in TimeOverheadData is divided into V group, is added separately to V queue QjIn, wherein 1≤Yi≤V；1≤ j≤V；To the element X of row k in matrix XkIt indicates, XkFor 1 row d column matrix, wherein 1≤k≤N；For each of matrix X Element XkIts fitness is calculated, is executed step (5)；
Step (5): according to XkData in matrix TimeOverheadData are grouped, XkiFor matrix XkI-th yuan Element, for XkIn each element XkiExecute following steps: if XkiIt, then will be in matrix TimeOverheadData equal to j I-th of element is added to queue QjIn；
Step (6): it is directed to each queue QjExecute following steps: by queue QjThe numerical value of middle all elements is added, and is obtained Numerical value ZkjIt indicates；
Step (7): individual XkFitness be f(X k ),；
Step (8): 1 is set by the value of k, is executed step (9)；
Step (9): if f(Xk) < fxmK, by f(Xk) value give fxmK, by the value of matrix XM row k matrix X row k Value replacement；If f(Xk) < fymK, by f(Xk) value give fymK, by the value of the value matrix X row k of matrix Ym row k Replacement；
Step (10): adding 1 for the value of k, if k≤N, repeats step (9)；If k > N, execute step (11)；
Step (11): foundation formula, Speed update is carried out, wherein w=1, c1=1, c2=1, rand are the random decimals between one 0 to 1, and repmat is a N row d The matrix of column, the value of every row use the first row of Ym matrix to replace；According to formulaLocation updating is carried out, is obtained For each of matrix X element numerical value if it is greater than 1, which just uses 1 replacement；Each of obtained matrix X member If it is less than -1, which replaces prime number value with regard to use -1；
Step (12): adding 1 for population the number of iterations ger numerical value, if ger executes step (13) when being greater than 1000, otherwise holds Row step (4)；
Step (13): saving in matrix Ym is group optimum position that final iteration generates, i.e. optimal solution.
According to the concurrent topology analysis for the matrix Ym completion coalmine high-voltage power network that Parallel schedule obtains, specific steps are such as Under:
Step (1): it is assumed that the available number of threads of system is V, 1 is set by the value of k；It executes step (2)；
Step (2): the numerical value of matrix Ym the first row kth column is indicated with j, and j-th of partial high pressure power supply system figure is added to collection Close QVjIn, it executes step (3)；
Step (3): if k is less than d, the numerical value of k is added 1, repeats step (2)；If k is more than or equal to d, step is executed Suddenly (4)；
Step (4): V thread of starting executes step (5) for each thread of starting；
Step (5): it is assumed that the thread serial number k, then the thread Thread started of startingkIt indicates, by QVkIn include it is all Partial high pressure power supply system figure and thread ThreadkBinding, thread ThreadkFor QVkIn include each partial high pressure supply Electric system figure proposes adaptive according to document " the mining high-voltage electric-network self-adaptive sites calculation method that single busbar divides multistage to run " It answers topological analysis algorithm is corresponding to carry out adaptive topology analysis, discharges the thread after the completion of topological analysis automatically.
Detailed description of the invention
Fig. 1 is coal mine high voltage supply system figure.
Specific embodiment
It in fig. 1, is gate-dividing state with the high-voltage switch gear node that dotted line is drawn, with the high-voltage switch gear node of depicted as solid lines For "on" position；Interconnection switch node serial number, incoming switch node serial number, outlet switch node serial number and line node number are such as Shown in attached drawing 1.Wherein, number be (1), (2), (3), (4), (5), (6), (7), (8) high-voltage switch gear be incoming switch node, Wherein (1) and (2) is electric power incoming line switching node；Number is 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16, 17,18,19,20,21,22,23,24,25,26 high-voltage switch gear is outlet switch node；Number is the high pressure of [1], [2], [3] Switch is interconnection switch node；Number is<1>,<2>,<3>,<4>,<5>,<6>route be line node.
It realizes that coal mine high voltage supply system concurrent topology is analyzed, first has to for coal mine high voltage supply system being divided into several A part coal mine high voltage supply system figure.
It is assumed that coal mine high voltage supply system figure is divided into d local coal mine high voltage supply according to above-mentioned group forming criterion System diagram, matrix TimeOverheadData are the matrix that d row 1 arranges, the numerical value of i-th of element ti meOverheadDatai Equal to the topological analysis time of last i-th local coal mine high voltage supply system figure, wherein 1≤i≤d.It is calculated based on population Several elements in matrix TimeOverheadData are added separately in V queue Qj by method, when making topological analysis in every group Between the sum of variance it is minimum, wherein 1≤j≤V.
Concurrent topology analysis according to the matrix Ym completion coalmine high-voltage power network that Parallel schedule obtains.

Claims (1)

1. a kind of coalmine high-voltage power network self-adaptive parallel topology analyzing method based on population, which is characterized in that described Self-adaptive parallel topology analyzing method includes the following steps:
Coal mine high voltage supply system is divided into several local coal mine high voltage supply system figures by step 1)；
Step 2 assumes coal mine high voltage supply system figure being divided into d local coal mine high pressure according to above-mentioned group forming criterion Power supply system figure, matrix TimeOverheadData are the matrix that d row 1 arranges, i-th element ti meOverheadDatai's Numerical value is equal to the topological analysis time of last i-th local coal mine high voltage supply system figure, wherein 1≤i≤d；Based on particle Several elements in matrix TimeOverheadData are added separately in V queue Qj by group's algorithm, make topology point in every group The variance for analysing the sum of time is minimum, wherein 1≤j≤V；
The concurrent topology analysis of step 3), the matrix Ym completion coalmine high-voltage power network obtained according to Parallel schedule；
In step 2, include the following steps:
Step (A1): initializing particle swarm algorithm parameter, and initial population quantity N, population Spatial Dimension d is arranged, and is used to Property weight w, accelerator coefficient c1 and c2, rate limitation vlimit, particle swarm algorithm the number of iterations ger=1；It is assumed that system allows to build Vertical Thread Count is V；
Step (A2): initial population matrix X is generated, matrix X is the null matrix of N row d column under initial situation, by each of matrix The number number V being randomly generatediReplacement, 1≤Vi≤V；Matrix Xm saves the history optimum position of each individual, by the value of new matrix X Xm is assigned, even Xm=X, is executed step (A3)；
Step (A3): initializing the renewal speed VE of population, and VE is the random matrix of N row d column, by each of matrix The number number K1 replacement being randomly generated, the value of K1 is -1,0 or 1；The history optimum position matrix Ym, Ym of population are generated simultaneously For the matrix of 1 row d column, the history optimal adaptation degree matrix of each individual is indicated with fxm, and fxm is the matrix that N row 1 arranges；Population is gone through History optimal adaptation degree is indicated with fym；
Step (A4): Y is used in the corresponding grouping of i-th of element in matrix TimeOverheadDataiIt indicates, matrix Element in TimeOverheadData is divided into V group, is added separately to V queue QjIn, wherein 1≤Yi≤V；1≤ j≤V；To the element X of row k in matrix XkIt indicates, XkFor 1 row d column matrix, wherein 1≤k≤N；For each of matrix X Element XkIts fitness is calculated, is executed step (A5)；
Step (A5): according to XkData in matrix TimeOverheadData are grouped, XkiFor matrix XkI-th yuan Element, for XkIn each element XkiExecute following steps: if XkiIt, then will be in matrix TimeOverheadData equal to j I-th of element is added to queue QjIn；
Step (A6): it is directed to each queue QjExecute following steps: by queue QjThe numerical value of middle all elements is added, and is obtained Numerical value ZkjIt indicates；
Step (A7): individual XkFitness be f(X k ),；
Step (A8): 1 is set by the value of k, is executed step (A9)；
Step (A9): if f(Xk) < fxmK, by f(Xk) value give fxmK, by the value of matrix XM row k matrix X row k Value replacement；If f(Xk) < fymK, by f(Xk) value give fymK, by the value of the value matrix X row k of matrix Ym row k Replacement；
Step (A10): adding 1 for the value of k, if k≤N, repeats step (A9)；If k > N, execute step (A11)；
Step (A11): foundation formula, Speed update is carried out, wherein w=1, c1=1, c2=1, rand are the random decimals between one 0 to 1, and repmat is a N row d The matrix of column, the value of every row use the first row of Ym matrix to replace；According to formulaLocation updating is carried out, is obtained For each of matrix X element numerical value if it is greater than 1, which just uses 1 replacement；Each of obtained matrix X member If it is less than -1, which replaces prime number value with regard to use -1；
Step (A12): adding 1 for population the number of iterations ger numerical value, if ger executes step (A13) when being greater than 1000, otherwise It executes step (A4)；
Step (A13): saving in matrix Ym is group optimum position that final iteration generates, i.e. optimal solution.
CN201910330441.0A 2019-04-23 2019-04-23 A kind of coalmine high-voltage power network self-adaptive parallel topology analyzing method based on population Pending CN110048412A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910330441.0A CN110048412A (en) 2019-04-23 2019-04-23 A kind of coalmine high-voltage power network self-adaptive parallel topology analyzing method based on population

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910330441.0A CN110048412A (en) 2019-04-23 2019-04-23 A kind of coalmine high-voltage power network self-adaptive parallel topology analyzing method based on population

Publications (1)

Publication Number Publication Date
CN110048412A true CN110048412A (en) 2019-07-23

Family

ID=67278790

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910330441.0A Pending CN110048412A (en) 2019-04-23 2019-04-23 A kind of coalmine high-voltage power network self-adaptive parallel topology analyzing method based on population

Country Status (1)

Country Link
CN (1) CN110048412A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102664423A (en) * 2012-05-30 2012-09-12 山东大学 Wind power station energy storage capacity control method based on particle swarm optimization
WO2012171147A1 (en) * 2011-06-17 2012-12-20 辽宁省电力有限公司 Coordination and control system for regulated charging and discharging of pure electric vehicle in combination with wind power generation
CN107302208A (en) * 2017-05-16 2017-10-27 河南理工大学 A kind of coalmine high-voltage power network quick-break sets verified in parallel method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012171147A1 (en) * 2011-06-17 2012-12-20 辽宁省电力有限公司 Coordination and control system for regulated charging and discharging of pure electric vehicle in combination with wind power generation
CN102664423A (en) * 2012-05-30 2012-09-12 山东大学 Wind power station energy storage capacity control method based on particle swarm optimization
CN107302208A (en) * 2017-05-16 2017-10-27 河南理工大学 A kind of coalmine high-voltage power network quick-break sets verified in parallel method

Similar Documents

Publication Publication Date Title
Dasgupta Parallel search for multi-modal function optimization with diversity and learning of immune algorithm
Chao et al. Probabilistic analysis of two heuristics for the 3-satisfiability problem
Fishelson et al. Optimizing exact genetic linkage computations
CN103235743B (en) A kind of based on decomposing and the multiple goal test assignment dispatching method of optimum solution follow-up strategy
CN110288126B (en) Robot casting production line productivity optimization method
Chen et al. PEA: Parallel evolutionary algorithm by separating convergence and diversity for large-scale multi-objective optimization
CN105159148B (en) Robot instruction processing method and device
CN106779219A (en) A kind of electricity demand forecasting method and system
CN107911300B (en) Multicast routing optimization method based on whale algorithm and application of multicast routing optimization method on Spark platform
Talbi Hybrid metaheuristics for multi-objective optimization
Li et al. A hybrid salp swarm algorithm with gravitational search mechanism
CN109325530A (en) Compression method based on the depth convolutional neural networks on a small quantity without label data
Saburov et al. Mathematical models of nonlinear uniform consensus II
CN103699653A (en) Method and device for clustering data
CN110048412A (en) A kind of coalmine high-voltage power network self-adaptive parallel topology analyzing method based on population
CN114153828A (en) Intelligent data cleaning method and device for photovoltaic power generation system
Wang et al. Time series analysis of production decline in carbonate reservoirs with machine learning
Freschi et al. Multiobjective optimization and artificial immune systems: a review
CN106096117A (en) Uncertain graph key limit based on flow and reliability appraisal procedure
CN115936926A (en) SMOTE-GBDT-based unbalanced electricity stealing data classification method and device, computer equipment and storage medium
CN106406082A (en) System control method and device, controller and control system
CN109359650A (en) Object detection method and device, embedded device
Ruochen et al. Immunity clonal strategies
D'Anna et al. Concurrent system analysis using Petri nets: an optimized algorithm for finding net invariants
Kamal et al. Filter-wrapper approach to feature selection of GPCR protein

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