CN110083929A - The parallel short circuit calculation method of coalmine high-voltage power network based on simulated annealing - Google Patents
The parallel short circuit calculation method of coalmine high-voltage power network based on simulated annealing Download PDFInfo
- Publication number
- CN110083929A CN110083929A CN201910336383.2A CN201910336383A CN110083929A CN 110083929 A CN110083929 A CN 110083929A CN 201910336383 A CN201910336383 A CN 201910336383A CN 110083929 A CN110083929 A CN 110083929A
- Authority
- CN
- China
- Prior art keywords
- matrix
- branch node
- value
- short circuit
- assigned
- 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
- 238000004364 calculation method Methods 0.000 title claims abstract description 27
- 238000002922 simulated annealing Methods 0.000 title claims abstract description 18
- 238000004321 preservation Methods 0.000 claims abstract description 4
- 239000011159 matrix material Substances 0.000 claims description 87
- 239000003245 coal Substances 0.000 claims description 10
- 238000000034 method Methods 0.000 claims description 7
- 235000013399 edible fruits Nutrition 0.000 claims 1
- 238000010276 construction Methods 0.000 abstract description 2
- 230000005611 electricity Effects 0.000 description 1
Classifications
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Hardware Design (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Microelectronics & Electronic Packaging (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses the parallel short circuit calculation method of coalmine high-voltage power network based on simulated annealing, include the following steps: that n branch node is added separately to U queue R based on simulated annealingkIn, U new idle threads are added in idle thread queue QC, for each queue R by U new idle threads of creationkThe branch node set of middle preservation completes the parallel computation that each branch node corresponds to short circuit current；Short circuit calculation scheduling model of the parallel short circuit calculation method of coalmine high-voltage power network proposed by the present invention based on simulated annealing based on simulated annealing and parallel computing construction coalmine high-voltage power network, the branch node quantity for enabling per thread to handle during short circuit calculation is identical as far as possible, so as to effectively improve parallel short circuit calculation dispatching efficiency.
Description
Technical field
The invention discloses the parallel short circuit calculation methods of coalmine high-voltage power network based on simulated annealing, belong to the confession of coal mine high pressure
Electric network short circuit calculation field.
Background technique
There are multiple power supplys in the power network of 35kV or more, belong to complicated enclosed power grid, and short circuit calculation is complex；And mine
Well high voltage supply system is 6kV or 10kV grade, and two power supplys should use fanout operation mode, or all the way using standby all the way
With belonging to single supply open type power grid, fairly simple absolute-value scheme or relative value method can be used in short circuit calculation；Coal mine high-voltage electricity
Branch node quantity is more in net, and how to complete short circuit calculation to all branch nodes with lesser time overhead is one
Problem to be solved.
The parallel short circuit calculation method of coalmine high-voltage power network proposed by the present invention based on simulated annealing is calculated based on simulated annealing
The short circuit calculation scheduling model of method and parallel computing construction coalmine high-voltage power network, makes per thread during short circuit calculation
The branch node quantity of processing can be identical as far as possible, so as to effectively improve parallel short circuit calculation dispatching efficiency.
Summary of the invention
The power supply line directly controlled according to every branch node establishes branch node-power supply line adjacency list T；By this
Adjacency list can number according to corresponding branch node and inquire its power supply line's basic parameter directly controlled, including power supply
Line length, power supply line's model, unit resistance and unit reactance information；And coal mine high voltage supply system maximum operation side is set
The system reactance under system reactance and minimum operational mode under formula；The power branch node of coal mine high voltage supply system is set,
Power branch node refers to the branch node directly powered by higher level's power supply department.
The final power supply incidence matrix of branch node and branch node indicates that n is branch node quantity with G, and G is n row n
Column；N is the quantity of branch node in coal mine high voltage supply system；In incidence matrix G, the line number of matrix is the suitable of branch node
Serial number, matrix column number are the serial number of branch node；The element of i-th row jth column is usedIt indicates；If branch node i is by propping up
Circuit node j power supply, then；If branch node i is not powered by branch node j,；If i=j,。
Matrix P=[P1…Pi…Pn], wherein,, matrix, Q is the square of 1 row n column
Battle array, jth arrange corresponding element valueIndicate that j-th of branch node carries out the number of, lines that short circuit calculation is related to, wherein。
N branch node is added separately to U queue R based on simulated annealingkIn, wherein；U be
System allows the Thread Count established, the specific steps are as follows:
Step 1): system allows to establish Thread Count and is expressed as U, and branch node j carries out number of, lines involved in short circuit calculation and is, wherein；Markov chain length indicates that attenuation parameter is used with LIt indicates, initial temperature is indicated with T, terminates temperature
WithIt indicates, tolerance is usedIt indicates；
Step 2: n branch node needs to be divided into U group, is added separately in respective queue, and j-th of branch node is corresponding
Grouping is usedIt indicates,；
Step 3): the corresponding grouping individual of n branch node is usedIt indicates, Zk=[X1,X2…Xj…Xn], whereinIt is random whole
Number,, according to the random generation individual of individual definition, execute step 4)；
Step 4): by the individual of generationValue be assigned to matrix PreX, matrix PreX is the matrix of 1 row n column, and by matrix
The value of PreX is assigned in matrix PreBestX, and PreBestX is the matrix of 1 row n column；FoundationDefinition regenerates one at random
Individual, by the individual of generationValue be assigned to matrix B estX, BestX is the matrix of 1 row n column；By the value of matrix PreBest
It is assigned to matrix PB, calculates its corresponding fitness f (PB) for matrix PB, the fitness of matrix PreBest is expressed as f
(PreBest), the value of fitness f (PB) is assigned to f (PreBest)；
Step 5): being assigned to matrix PB for the value of matrix B estX, calculates its corresponding fitness f (PB), matrix for matrix PB
The fitness of BestX is f (BestX), and the value of fitness f (PB) is assigned to f (BestX)；
Step 6): ifOr temperature, then simulated annealing process is completed, and executes step
It is rapid 11)；Otherwise, step 7) is executed；
Step 7): temperature T withMultiplication obtains numerical value Temp1, the numerical value of Temp1 is assigned to T, the initial value of m is set as 1；
Step 8): if, execute step 6)；If, an individual is generated at random, is indicated with matrix N estX, it will
The value of matrix N estX is assigned to matrix PB, calculates its corresponding fitness f (PB), the fitness table of matrix N estX for matrix PB
It is shown as f (NestX), the value of fitness f (PB) is assigned to f (NestX)；
Step 9): if f (NestX) < f (BestX), is assigned to matrix PreBestX for the value of matrix B estX, by matrix
The value of NestX is assigned to matrix B estX；Execute step 10)；If f (NestX) >=f (BestX), fitness variable quantity, withProbability receive NestX and make new current solution BestX, that is, will
The value of matrix B estX is assigned to matrix PreBestX, and the value of matrix N estX is assigned to matrix B estX, executes step 10)；
Step 10): the numerical value of m is added 1, repeats step 8)；
Step 11): 1 is set by the numerical value that the numerical value of i is set as 1, k, executes step 12)；
Step 12): BestXiFor i-th of element of BestX, if, branch node i is added to queueIn；
If BestXiThe numerical value of i is added 1 by ≠ k；
Step 13): if i < n, step 12) is repeated；If i >=n, the numerical value of k is added 1, executes step 14)；
Step 14): if k > U, grouping process is completed；If k≤U, 1 is set by the numerical value of i, executes step 12)；
In above-mentioned steps, according to matrix PB generator matrix, and the corresponding fitness f (PB) of calculating matrix PB, it is specific to walk
It is rapid as follows:
Step 1): PYk=[ PYk1…PYkj…PYkU], under initial situationIn each element numerical value be 0, i initial value
The initial value for being set as 1, j is set as 1, executes step 2；
Step 2:For i-th of element of matrix PB, if, willNumerical value withThe numerical value obtained after addition
It assigns；The numerical value of i is added 1, if, it thens follow the steps 3), if, repeat step 2；
Step 3): if, add the initial value of 1, i to be set as 1 the numerical value of j, executes step 2, if, execute
Step 4)；
Step 4):, the fitness of matrix PB。
U new idle threads are created, U new idle threads are added to idle thread queueIn, for each
Queue RkThe branch node set of middle preservation completes the parallel computation that each branch node corresponds to short circuit current, specifically executes step
It is rapid as follows:
U new idle threads are added to idle thread queue by U step 1), creation new idle threadsIn,'s
Initial value is set as 1；
Step 2, from idle thread queueOne idle thread of middle taking-up, by queue RkIt is bundled in newly-built idle thread
In, busy thread is set by this thread, is added in busy thread queue B2, step 3) is executed；
It, will if step 3), j < UNumerical value add 1, execute step 2；If, execute step 4)；
Step 4) is directed to the busy thread of each of busy thread queue B2, executes step 5)；
Step 5) takes out the binding queue RkBusy thread, execute the busy thread, which is directed to queue RkIn include
Each branch node execute step 6)；
Step 6), the branch node serial number indicated with L, by numerical value in the L row of matrix G be 1 all elements it is corresponding
Row number is added to setIn；If gatheringIn be not present power branch node, then illustrate that the corresponding route of the set does not have
There is power supply power supply, without short circuit calculation；If setIn there are power branch nodes, then illustrate the corresponding route of the set
There is power supply power supply, thens follow the steps 7)；
Step 7), the query set in branch node-power supply line adjacency list TIn the corresponding power supply line of each branch node
Information；The resistance and reactance of every route are calculated according to every power supply line's length, unit resistance and the unit reactance obtained,
Execute step 8) and 9)；
Step 8), according to the resistance of every route, the calculating of system reactance under reactance and pre-set maximum operational mode obtains
Obtain the all-in resistance under maximum operational modeWith total reactance, then according to route where high voltage supply system short dot
Average voltage and all-in resistance, total reactance calculate the three short circuit current under maximum operational mode；
Step 9), according to the resistance of every route, the calculating of system reactance under reactance and pre-set minimum operational mode obtains
Obtain the all-in resistance under minimum operational modeWith total reactance, then according to route where high voltage supply system short dot
Average voltage and all-in resistance, total reactance calculate the two-phase short circuit current under minimum operational mode.
Detailed description of the invention
Fig. 1 is coal mine high voltage supply system figure.
Specific embodiment
It with the high-voltage switch gear on the branch node of filled black is gate-dividing state in attached drawing 1, on unfilled branch node
High-voltage switch gear be "on" position；In attached coal mine high voltage supply system figure shown in FIG. 1, branch node is (1), (2), (3)
, (4), (5), (6), (7), (8), (9), (10), (11), (12), (13), (14), (15), (16), (17) and (18), wherein
Power branch node is (1) and (2).
According to attached coal mine high voltage supply system figure shown in FIG. 1, the final power supply for obtaining branch node and branch contact is closed
Join matrix G,。
The final power supply incidence matrix G and matrix P calculating matrix Q of foundation,
。
18 branch nodes are added separately to U queue R based on simulated annealingkIn, wherein, U is to be
System allows the Thread Count established.
U new idle threads are created, U new idle threads are added to idle thread queueIn, for each
Queue RkThe branch node set of middle preservation completes the parallel computation that each branch node corresponds to short circuit current.
Claims (4)
1. the parallel short circuit calculation method of coalmine high-voltage power network based on simulated annealing, which is characterized in that described coal mine high pressure
The parallel short circuit calculation method of power grid includes the following steps:
Step 11, the final power supply incidence matrix of branch node and branch node is indicated with G, and n is branch node quantity, and G is n row
N column；N is the quantity of branch node in coal mine high voltage supply system；In incidence matrix G, the line number of matrix is branch node
Serial number, matrix column number are the serial number of branch node；The element of i-th row jth column is usedIt indicates；If branch node i by
Branch node j power supply, then；If branch node i is not powered by branch node j,；If i=j,；
Step 12, matrix P=[P1…Pi…Pn], wherein,, matrix, Q is 1 row n column
Matrix, jth arrange corresponding element valueIndicate that j-th of branch node carries out the number of, lines that short circuit calculation is related to, wherein；
Step 13, n branch node is added separately to by U queue R based on simulated annealingkIn, wherein；U is
System allows the Thread Count established；
Step 14, U new idle threads are added to idle thread queue by U new idle threads of creationIn, for
Each queue RkThe branch node set of middle preservation completes the parallel computation that each branch node corresponds to short circuit current.
2. the parallel short circuit calculation method of the coalmine high-voltage power network according to claim 1 based on simulated annealing, feature exist
In being substantially carried out following steps in step 13:
Step 21, system allow to establish Thread Count and are expressed as U, and branch node j carries out number of, lines involved in short circuit calculation and is, wherein；Markov chain length indicates that attenuation parameter is used with LIt indicates, initial temperature is indicated with T, terminates temperature
WithIt indicates, tolerance is usedIt indicates；
Step 22, n branch node need to be divided into U group, are added separately in respective queue, and j-th of branch node is corresponding
Grouping is usedIt indicates,；
The corresponding grouping individual of step 23, n branch node is usedIt indicates, Zk=[X1,X2…Xj…Xn], whereinIt is random whole
Number,, according to the random generation individual of individual definition, execute step 24；
Step 24, the individual by generationValue be assigned to matrix PreX, matrix PreX is the matrix of 1 row n column, and by matrix PreX
Value be assigned in matrix PreBestX, PreBestX be 1 row n column matrix；FoundationDefinition, regenerates a random individual, by the individual of generationValue be assigned to matrix B estX, BestX is the matrix of 1 row n column；The value of matrix PreBest is assigned to
Matrix PB calculates its corresponding fitness f (PB) for matrix PB, and the fitness of matrix PreBest is expressed as f (PreBest),
The value of fitness f (PB) is assigned to f (PreBest)；
The value of matrix B estX is assigned to matrix PB by step 25, calculates its corresponding fitness f (PB), matrix for matrix PB
The fitness of BestX is f (BestX), and the value of fitness f (PB) is assigned to f (BestX)；
If step 26,Or temperature, then simulated annealing process is completed, and executes step
Rapid 2B；Otherwise, step 27 is executed；
Step 27, temperature T withMultiplication obtains numerical value Temp1, the numerical value of Temp1 is assigned to T, the initial value of m is set as 1；
If step 28,, execute step 26；If, an individual is generated at random, is indicated with matrix N estX, it will
The value of matrix N estX is assigned to matrix PB, calculates its corresponding fitness f (PB), the fitness table of matrix N estX for matrix PB
It is shown as f (NestX), the value of fitness f (PB) is assigned to f (NestX)；
If step 29, f (NestX) < f (BestX), are assigned to matrix PreBestX for the value of matrix B estX, by matrix
The value of NestX is assigned to matrix B estX；Execute step 2A；If f (NestX) >=f (BestX), fitness variable quantity, withProbability receive NestX and make new current solution BestX, that is, will
The value of matrix B estX is assigned to matrix PreBestX, and the value of matrix N estX is assigned to matrix B estX, executes step 2A；
Step 2A, the numerical value of m is added 1, repeats step 28；
Step 2B, 1 is set by the numerical value that the numerical value of i is set as 1, k, executes step 2C；
Step 2C, BestXiFor i-th of element of BestX, if, branch node i is added to queueIn；Such as
Fruit BestXiThe numerical value of i is added 1 by ≠ k；
If step 2D, i < n, step 2C is repeated；If i >=n, the numerical value of k is added 1, executes step 2E；
If step 2E, k > U, grouping process is completed；If k≤U, 1 is set by the numerical value of i, executes step 2C.
3. the parallel short circuit calculation method of the coalmine high-voltage power network according to claim 2 based on simulated annealing, feature exist
According to matrix PB generator matrix, and the corresponding fitness f (PB) of calculating matrix PB, it is substantially carried out following steps:
Step 31, PYk=[ PYk1…PYkj…PYkU], under initial situationIn each element numerical value be 0, i initial value set
The initial value for being set to 1, j is set as 1, executes step 32；
Step 32,For i-th of element of matrix PB, if, willNumerical value withThe numerical value obtained after addition
It assigns；The numerical value of i is added 1, if, 33 are thened follow the steps, if, repeat step 32；
If step 33,, add the initial value of 1, i to be set as 1 the numerical value of j, executes step 32, if, execute step
Rapid 34；
Step 34,, the fitness of matrix PB。
4. the parallel short circuit calculation method of the coalmine high-voltage power network according to claim 1 based on simulated annealing, feature exist
In at step 14, being substantially carried out following steps:
U new idle threads are added to idle thread queue by U step 41, creation new idle threadsIn,Just
Initial value is set as 1；
Step 42, from idle thread queueOne idle thread of middle taking-up, by queue RkIt is bundled in newly-built idle thread,
Busy thread is set by this thread, is added in busy thread queue B2, step 43 is executed；
It, will if step 43, j < UNumerical value add 1, execute step 42；If, execute step 44；
Step 44 is directed to the busy thread of each of busy thread queue B2, executes step 45；
Step 45 takes out the binding queue RkBusy thread, execute the busy thread, which is directed to queue RkIn include
Each branch node execute step 46；
Step 46, the branch node serial number indicated with L, by numerical value in the L row of matrix G be 1 all elements it is corresponding
Row number is added to setIn；If gatheringIn be not present power branch node, then illustrate that the corresponding route of the set does not have
There is power supply power supply, without short circuit calculation；If setIn there are power branch nodes, then illustrate the corresponding route of the set
There is power supply power supply, thens follow the steps 47；
Step 47, the query set in branch node-power supply line adjacency list TIn the corresponding power supply line of each branch node
Information；The resistance and reactance of every route are calculated according to every power supply line's length, unit resistance and the unit reactance obtained,
Execute step 48 and 49；
Step 48, according to the resistance of every route, the calculating of system reactance under reactance and pre-set maximum operational mode obtains
Obtain the all-in resistance under maximum operational modeWith total reactance, then according to route where high voltage supply system short dot
Average voltage and all-in resistance, total reactance calculate the three short circuit current under maximum operational mode；
Step 49, according to the resistance of every route, the calculating of system reactance under reactance and pre-set minimum operational mode obtains
Obtain the all-in resistance under minimum operational modeWith total reactance, then according to route where high voltage supply system short dot
Average voltage and all-in resistance, total reactance calculate the two-phase short circuit current under minimum operational mode.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910336383.2A CN110083929A (en) | 2019-04-25 | 2019-04-25 | The parallel short circuit calculation method of coalmine high-voltage power network based on simulated annealing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910336383.2A CN110083929A (en) | 2019-04-25 | 2019-04-25 | The parallel short circuit calculation method of coalmine high-voltage power network based on simulated annealing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110083929A true CN110083929A (en) | 2019-08-02 |
Family
ID=67416558
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910336383.2A Pending CN110083929A (en) | 2019-04-25 | 2019-04-25 | The parallel short circuit calculation method of coalmine high-voltage power network based on simulated annealing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110083929A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106526427A (en) * | 2016-11-28 | 2017-03-22 | 河南理工大学 | Parallel calculation method for short-circuit current of coal mine high-voltage power grid based on load balancing |
| CN106709134A (en) * | 2016-11-21 | 2017-05-24 | 河南理工大学 | Parallel computing method for short-circuit currents of high voltage power grids of coal mines |
| CN106816872A (en) * | 2017-03-30 | 2017-06-09 | 河南理工大学 | Coalmine high-voltage power network self-adaptive parallel short circuit calculation method based on genetic algorithm |
-
2019
- 2019-04-25 CN CN201910336383.2A patent/CN110083929A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106709134A (en) * | 2016-11-21 | 2017-05-24 | 河南理工大学 | Parallel computing method for short-circuit currents of high voltage power grids of coal mines |
| CN106526427A (en) * | 2016-11-28 | 2017-03-22 | 河南理工大学 | Parallel calculation method for short-circuit current of coal mine high-voltage power grid based on load balancing |
| CN106816872A (en) * | 2017-03-30 | 2017-06-09 | 河南理工大学 | Coalmine high-voltage power network self-adaptive parallel short circuit calculation method based on genetic algorithm |
Non-Patent Citations (1)
| Title |
|---|
| 刘科研等: "基于分布式并行遗传算法的电力系统无功优化", 《北京航空航天大学学报》, vol. 34, no. 1, 31 January 2008 (2008-01-31), pages 9 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107579518B (en) | Power system environment economic load dispatching method and apparatus based on MHBA | |
| CN104484833A (en) | Photovoltaic power generation output power tracking algorithm based on genetics algorithm improved RBF-BP neural network | |
| CN107358352A (en) | Model in Reliability Evaluation of Power Systems system and method based on Monte Carlo simulation | |
| CN107423839A (en) | A kind of method of the intelligent building microgrid load prediction based on deep learning | |
| CN106786977B (en) | Charging scheduling method of electric vehicle charging station | |
| Zhang et al. | Application of simulated annealing genetic algorithm-optimized back propagation (BP) neural network in fault diagnosis | |
| CN106777449A (en) | Distribution Network Reconfiguration based on binary particle swarm algorithm | |
| CN106102079A (en) | Based on the C RAN carrier wave emigration resource requirement Forecasting Methodology improving PSO | |
| CN103337861A (en) | Power distribution network reactive power optimization method based on gold chaotic ecological niche particle swarm algorithm | |
| CN106816872B (en) | Coalmine high-voltage power network self-adaptive parallel short circuit calculation method based on genetic algorithm | |
| CN106709134B (en) | Coal mine high-voltage power grid short-circuit current parallel computing method | |
| CN112491096A (en) | Method and system for generating power grid simulation analysis examples | |
| CN113435625B (en) | Dynamic economic dispatching optimization method and device for power system | |
| CN112347694A (en) | Sea island micro-grid power supply planning method containing ocean current-offshore wind power-tidal current power generation | |
| CN109507527A (en) | A kind of SNP system Fault Locating Method containing distributed power distribution network based on synaptic plasticity | |
| CN109214565A (en) | A kind of subregion system loading prediction technique suitable for the scheduling of bulk power grid subregion | |
| Mohapatra et al. | Equivalent line limit calculation for power system equivalent networks | |
| CN105633971B (en) | A kind of intelligent distribution network probabilistic loadflow method based on imperial competition algorithm | |
| CN105069517B (en) | Power distribution network multiple target fault recovery method based on hybrid algorithm | |
| Dong et al. | Combination of genetic algorithm and ant colony algorithm for distribution network planning | |
| CN106850253A (en) | A kind of method of the transmission time reliability measurement based on multimode network | |
| CN106169771A (en) | A kind of combining inverter of measurable generated energy data | |
| CN110083929A (en) | The parallel short circuit calculation method of coalmine high-voltage power network based on simulated annealing | |
| CN106526427B (en) | A kind of coalmine high-voltage power network short circuit current parallel calculating method based on load balancing | |
| CN107026450A (en) | B2G and V2G power distribution networks power control system and method based on genetic algorithm |
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 |