CN105958486A - Power distribution network multi-period dynamic fault recovery method considering DG (Distributed Generation) output curve - Google Patents
Power distribution network multi-period dynamic fault recovery method considering DG (Distributed Generation) output curve Download PDFInfo
- Publication number
- CN105958486A CN105958486A CN201610425258.5A CN201610425258A CN105958486A CN 105958486 A CN105958486 A CN 105958486A CN 201610425258 A CN201610425258 A CN 201610425258A CN 105958486 A CN105958486 A CN 105958486A
- Authority
- CN
- China
- Prior art keywords
- distribution network
- power distribution
- recovery
- branch road
- period
- 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.)
- Granted
Links
- 238000009826 distribution Methods 0.000 title claims abstract description 109
- 238000011084 recovery Methods 0.000 title claims abstract description 82
- 238000000034 method Methods 0.000 title claims abstract description 29
- 239000002245 particle Substances 0.000 claims abstract description 41
- 230000008859 change Effects 0.000 claims abstract description 9
- 238000005457 optimization Methods 0.000 claims abstract description 4
- 238000005520 cutting process Methods 0.000 claims description 27
- 238000011217 control strategy Methods 0.000 claims description 13
- 239000011159 matrix material Substances 0.000 claims description 12
- 238000011144 upstream manufacturing Methods 0.000 claims description 11
- 230000000694 effects Effects 0.000 claims description 4
- 238000004220 aggregation Methods 0.000 claims description 3
- 230000002776 aggregation Effects 0.000 claims description 3
- 230000006872 improvement Effects 0.000 claims description 2
- 230000001172 regenerating effect Effects 0.000 claims description 2
- 230000009471 action Effects 0.000 claims 1
- 230000015572 biosynthetic process Effects 0.000 claims 1
- 238000012217 deletion Methods 0.000 claims 1
- 230000037430 deletion Effects 0.000 claims 1
- 230000003068 static effect Effects 0.000 abstract description 3
- 239000003795 chemical substances by application Substances 0.000 description 6
- 230000005855 radiation Effects 0.000 description 5
- 239000002253 acid Substances 0.000 description 3
- 230000005611 electricity Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000005286 illumination Methods 0.000 description 2
- DEPMSUUWSGUYKQ-IWXIMVSXSA-N (2r,3s,4r,5r)-2,3,4,5-tetrahydroxy-6-[(4-nitro-2,1,3-benzoxadiazol-7-yl)amino]hexanal Chemical compound O=C[C@H](O)[C@@H](O)[C@H](O)[C@H](O)CNC1=CC=C([N+]([O-])=O)C2=NON=C12 DEPMSUUWSGUYKQ-IWXIMVSXSA-N 0.000 description 1
- 238000005304 joining Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000010271 massa medicata fermentata Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000003860 storage 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
- 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—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy 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]
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- Marketing (AREA)
- Tourism & Hospitality (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Public Health (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Water Supply & Treatment (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Power Engineering (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention relates to a power distribution network multi-period dynamic fault recovery method considering a DG (Distributed Generation) output curve. A power distribution network fault recovery model generally carries out static recovery on conditions at one moment, and an output of a DG is changed along with time, and thus, consideration to fault recovery of a power distribution network containing the DG on one time section is impractical. According to the power distribution network multi-period dynamic fault recovery method disclosed by the invention, a fault recovery period is subjected to period division in accordance with the output situation of the DG according to the actual situation on site, an optimal solution is obtained in one single period, and finally, an optimal fault recovery scheme in all periods is finally obtained, so that power distribution network multi-period dynamic fault recovery considering the DG output curve is implemented. The power distribution network multi-period dynamic fault recovery method disclosed by the invention sufficiently considers the output change of the DG, proposes combination of a load shedding strategy based on an optimal fault recovery path on the basis of improving a binary particle swarm optimization algorithm, and solves the problem of power distribution network multi-period dynamic fault recovery considering the DG output curve.
Description
Patent field
The invention belongs to power system automation technology field, relate to the fault recovery of power distribution network, specifically a kind of consideration DG
The power distribution network multi-period dynamic fault-recovery method of power curve.
Background technology
The scale of modern power systems, capacity and coverage are increasing, occupy critical role in national economy and people's lives,
Fault outage brings heavy losses can to social production and people's lives, once occurs the extensive fault outage of power distribution network to affect responsible consumer
Power supply, may directly jeopardize the safety of society and stablize.Along with distributed power source (calling DG in the following text) application in a power distribution system
Also become the most feasible and convenient, that it changes traditional fault recovery model, it is necessary to the change of exerting oneself of DG different time sections examined
Including Lving.So, make the multi-period dynamic optimal fault recovery scheme of the power distribution network containing DG with prestissimo, improve power supply reliable
Property is extremely urgent.After distribution network failure occurs, fault recovery scheme can be made accurately and in time, recover non-faulting as much as possible
Dead electricity load, significant for improving power supply reliability.
The target that distribution network failure containing DG recovers is to recover non-faulting dead electricity load as much as possible as early as possible, i.e. by other feeder lines and
DG provides to turn and recovers non-faulting dead electricity load for path.The research of this technical field at present is mainly based upon fault and occurs moment DG to go out
The static failure of power situation recovers.Radial distribution networks Lu Zhi has been obtained just etc., (Lu Zhigang, Yang Guoliang, Zhang Xiao about network reconfiguration
Brightness, etc. improve Binary Particle Swarm Optimization application [J] in Distribution Networks Reconfiguration. protecting electrical power system and control, 2009,
37 (7): 30-34.) propose improvement binary particle swarm algorithm and carry out network reconfiguration.Moment DG is occurred to exert oneself situation based on fault
The main achievement recovered of static failure be Lu Zhi just wait (Lu Zhigang, Dong Yuxiang. distribution network failure containing distributed power source recovers plan
Slightly [J]. Automation of Electric Systems, 2007,31 (1): 89-92.) fail-over policy that proposes, it is contemplated that NBDG and BDG
Difference, but do not account for the situation of change of exerting oneself of DG；Chen Xin etc. (Chen Xin, Tang Wei, Chen Yu, etc. based on machine
The planning distribution network failure containing photovoltaic generation can be retrained and recover [J]. electric power network technique, 2014,38 (1): 99-106.) according to difference
The probability density function of the period intensity of illumination enough early discrete probabilistic model of photovoltaic generation power, but finally will photovoltaic exert oneself with
Convergence in probability is a steady state value, have ignored photovoltaic in one day with intensity of illumination change and produce go out fluctuation；(Lee such as Li Zhikeng
Will clang, Wang Gang, Chen Zhigang, etc. the distribution network failure recovery algorithms containing distributed power source [J] based on Interval Power Flow. power system
Automatization, 2011,35 (24): 53-58.) " interval number " this concept is proposed uncertain to describe that distributed power source exerts oneself
Property also considers the fault recovery in very short time based on this, but for its model of long-time fault recovery inapplicable.Due to respectively
Kind of fault recovery model does not all account for DG and exerts oneself the practical situation of change, thus all cannot practice in scene.
Summary of the invention
It is an object of the invention to existing distribution network failure recovery policy is improved, propose a kind of to consider DG power curve
Power distribution network multi-period dynamic fault-recovery method.The application is concrete by the following technical solutions:
Consider the power distribution network multi-period dynamic fault-recovery method of distributed power source power curve, it is characterised in that: first according to fault
Situation set failure recovery time, according to DG exert oneself situation setting recovery time hop count, then use improve binary particle swarm algorithm enter
Row network reconfiguration, obtains radial distribution networks, the Emergency Control Strategy based on the optimum fail-over path radial net to each generation
Shelf structure carries out cutting load operation, and employing is enumerated combined method and is combined by the optimum recovery scheme of each single period, draws switching manipulation
The scheme of least number of times, is power distribution network multi-period dynamic fault-recovery method.
Consider that the power distribution network multi-period dynamic fault-recovery method of distributed power source power curve specifically includes following steps:
Consider the power distribution network multi-period dynamic fault-recovery method of distributed power source power curve, in distribution network failure recovery process,
Distributed power source is gone out force value and includes distribution network failure Restoration model in as negative load；It is characterized in that, described method includes following
Step:
Step 1: after power distribution network breaks down, hop count T when setting fault recovery duration and recover, sets up with minimum total losses load
The distribution network failure Restoration model that amount is main target function, minimal switches number of operations is by-end function, i.e. distribution network failure
First recovery scheme meets main target function, just considers by-end function, described main target functional value is identical when
Distributed power source is gone out force value by distribution network failure Restoration model and includes model in as negative load, will initially recover the initial of period t
Value tax 1；
Step 2: when the input node load matrix of power distribution network, branch impedance matrix, incidence matrix, fault occur the moment and recover
Between etc. basic data, use repeated power flow to calculate the power distribution network after failure judgement the need of cutting load, be to make cutting load mark
Flag=1, otherwise makes Flag=0；
Step 3: branch road group is merged in multiple connected branch road equivalence identical for effect of unlinking power distribution network looped network agent structure；Order is repeatedly
Generation number k=1；
Step 4: the not branch road in looped network agent structure is put 1 by force, i.e. in distribution network failure Restoration model, this branch road is opened
Closing Guan Bi, initialize population, the value respectively tieed up with particle represents the on off state of respective branch in power distribution network, and this dimension value of particle is 0
This branch switch i.e. disconnects, and this dimension value of particle is 1 i.e. this branch switch Guan Bi；
Step 5: carry out the power distribution network reconfiguration after fault based on the Sigmoid functional value improved in binary particle swarm algorithm, obtain
Radial distribution networks；
Step 6: judging to obtain whether radial distribution networks exists the branch road that electric current is out-of-limit through step 5, electric current is out-of-limit when not existing
Branch road, enters step 7；
When there is the out-of-limit branch road of electric current, if cutting load sign of flag being 0, returning step 5 and obtaining according to the random number regenerated
Particle rapidity after renewal and Sigmoid functional value, repeat step 5-6；If cutting load sign of flag is 1, then use setting
Emergency Control Strategy radial distribution networks network that step 5 is generated in each tree network carry out cutting load operation, subsequently into step
7, wherein, described tree network refers to the network of every bussed supply in radial distribution networks；
Step 7: update the individual optimum extreme value in particle cluster algorithm and colony's optimum extreme value according to minimum total losses loading and make repeatedly
Generation number k=k+1, repeats step 5-7, reaches maximum iteration time kmaxAfter, draw present period distribution network failure optimum recovery side
Case, now, obtains " position of the particle of least disadvantage loading " according to colony's optimum extreme value, i.e. distribution network failure optimum recovers
The topological structure of scheme；
Step 8: hop count t=t+1 when order recovers, repeats step 5-7, until t stops more than during T, obtains the distribution of each period
Net fault optimum recovery scheme；By-end function according to minimal switches number of operations, enters the optimum recovery scheme of each single period
Row enumerates combination, show that the excision scheme of switching manipulation least number of times is the best approach of the multi-period dynamic fault-recovery of power distribution network.
The application farther includes following preferred version:
In step 1, distribution network failure Restoration model considers the change of exerting oneself of DG, fault recovery is divided into multi-period dynamic
States model.
In steps of 5, the iterative formula improving binary particle swarm algorithm speed is:
In formula,Being respectively i-th particle d and tie up the n-th generation and the speed in the (n+1)th generation, ω is inertial factor, c1With
c2For Studying factors, r1And r2For the random number on [0,1], PibestFor the individual optimum extreme value of i-th particle, GbestFor colony
Excellent extreme value；
The position that particle is respectively tieed up is to be together decided on by the optimization of Sigmoid functional value and equivalence branch road group, equivalence branch road, Sigmoid
Function is:
Wherein,Representing Sigmoid functional value, e is natural constant,The speed in the n-th generation is tieed up for i-th particle d；
In step 6, when there is the out-of-limit branch road of electric current and cutting load sign of flag is 0, returning step 5 and regenerating at random
Number r1And r2And again draw speedWith Sigmoid functional value, based on update after Sigmoid functional value carry out fault after
Power distribution network reconfiguration, obtains radial distribution networks.
In step 6, when there is the out-of-limit branch road of electric current and cutting load sign of flag is 1, use based on optimum fault recovery road
The Emergency Control Strategy in footpath carries out the load excision of the out-of-limit branch road of electric current, recovers tree for one, first finds its all fault recovery roads
Footpath, then by whole for all fail-over path write switch archives, carries out the traversal combination switched, selects optimum fault recovery road
Footpath；Wherein recover tree and refer to that with the upstream node of out-of-limit branch road as root node, downstream traversal search is to all leaf nodes, is formed
Topological network.
In step 6, it is preferred to use following strategy carries out load excision:
(1) X that more limits the quantity of the out-of-limit branch road of electric current in tree network is calculated；
(2) with the upstream node of out-of-limit branch road as root node, downstream traversal search is to all leaf nodes, forms topological network,
Referred to as recover tree；From each leaf node tr recovering tree trend.iThe most upstream search for, until searching niNode, makes leaf
Child node trend.iTo niLoading sum exceed the X that more limits the quantity, this path be referred to as recover tree tr i-th fail-over path；
(3) branch road between switch i.e. node each on fail-over path is write according to the node level size sequence of its upstream node
Fail-over path switch archives, once on-off control loading exceed more limitation or this path on all loads be all written into Ze Ci road
The archives write in footpath terminates, and starts to write the switch archives of a fail-over path, until the switch archives of all fail-over path
All writes；Wherein, the node level of root node is 1, and child node level is sequentially arranged；
(4) when taking cut-out load aggregation, whether the on-off control load of switch archives every paths end is first looked at more than more
Limitation, if more than, will be switched off this switch and be classified as alternative excision scheme and by this switch from switch file delet, do not delete
Operation；
(5) carry out the traversal combination switched, every fail-over path at most disconnects a switch, if in alternative excision scheme
There is same switch and then leave out one of them；If there is relationship between superior and subordinate, then subordinate's switch is deleted from alternative excision scheme, if
Excised distributed power source in alternative excision scheme, then carry out isolated island dividing is i.e. that load is powered and is by amount of recovery by distributed power source
The loading that isolated island is powered by distributed power source in dividing counts cut-out loading；
(6) select excision loading to carry out excising the sequence of loading more than each alternative excision scheme of more limitation, select wherein to cut
The scheme of loading minimum is optimum fail-over path；
The most all can make to excise the situation that loading is minimum when there is certain distributed power source of excision, selecting not excise this distributed electrical
Source.
The present invention has a following useful technique effect:
(1) consider distributed power source change of exerting oneself in time, establish multi-period dynamic fault-recovery model, meet existing
The actual requirement that field is run；(2) Emergency Control Strategy based on optimum fail-over path is proposed, can be to the radiation comprising DG
Shape power distribution network carries out cutting load operation accurately, obtains optimum excision scheme.
Accompanying drawing explanation
Fig. 1 is the flow chart that the present invention considers the power distribution network multi-period dynamic fault-recovery method of DG power curve；
The distribution network line figure that Fig. 2 is up；
Fig. 3 is that Fig. 2 median generatrix 101 breaks down, chopper S1And S2Distribution network line figure during disconnection；
Fig. 4 is photovoltaic generation whole day day part EIAJ curve chart；Fig. 5 is lead-acid accumulator and diesel-driven generator day part maximum
Power curve figure；
Fig. 6 is a recovery tree graph in example；
Wherein, in Fig. 2, black filled circle is node load, and square represents chopper, solid for closure state, hollow for disconnecting
State, DG1For lead battery, DG2、DG4For photovoltaic generating system, DG3、DG5For diesel generating set.DG's
Power supply capacity is as shown in Figure 4 and Figure 5.Branch road 3-4,8-10,15-16,15-20,6-23,9-25 and 14-27 time properly functioning
Disconnect.
Detailed description of the invention
Below with reference to accompanying drawing and example, the content of invention is described further.
Table 1 example loading
As in figure 2 it is shown, branch switch 3-4,8-10,15-16,15-20,6-23,9-25 and 14-27 when power distribution network is properly functioning
Disconnecting, load 1,2,3,7,8 and 9 is by the chopper S of bus 1011Control power supply；Load 10,11,12,13,14
With 15 by the chopper S of bus 1012And DG4Control power supply；Load 4,5,6,20,21 and 22 is by bus 102 open circuit
Device S3Control power supply；Load 16,17,18 and 19 is by bus 103 chopper S4And DG2Control power supply, the load of each load
Amount is as shown in table 1.When as Fig. 3 bus 101 in the morning 9 break down, chopper S1And S2During disconnection, use the present invention
The disclosed power distribution network multi-period dynamic fault-recovery method considering DG power curve, comprises the steps (as shown in Figure 1):
Step 1: after power distribution network breaks down, sets fault recovery duration pre-according to exerting oneself of distributed power source according to failure condition
Survey hop count T when curve setting is recovered, set up with minimum total losses loading be main target function, minimal switches number of operations be secondary
The distribution network failure Restoration model wanting object function (first meets main target function, main target functional value is identical when
Consider by-end function), distributed power source is gone out force value by described distribution network failure Restoration model and includes mould in as negative load
Type, composes 1 by the initial value initially recovering period t；
In embodiments herein, failure recovery time is set as 5 hours, if Fig. 4 is that photovoltaic generation whole day day part is maximum
Photovoltaic generating system DG in power curve figure, i.e. example2And DG4Situation of exerting oneself at whole day day part；Fig. 5 is lead acid storage battery
Pond and diesel-driven generator day part EIAJ curve chart, wherein solid line represents lead-acid batteries DG1Within working 7 hours continuously
Day part EIAJ curve chart, dotted line represents diesel generating set DG3And DG5Within working 7 hours continuously, day part maximum goes out
Massa Medicata Fermentata line chart；Situation of exerting oneself according to distributed power source we will be divided into five periods, one hour each period recovery time；
Step 2: when the input node load matrix of power distribution network, branch impedance matrix, incidence matrix, fault occur the moment and recover
Between etc. basic data, use repeated power flow to calculate the power distribution network after failure judgement the need of cutting load, be to make cutting load mark
Flag=1, otherwise makes Flag=0；
Input the node load matrix of example power distribution network, branch impedance matrix, incidence matrix, input fault occurs the moment to be morning nine
Point, 5 hours recovery times, using repeated power flow to calculate judged result is needs cutting load, makes Flag=1；
Step 3: branch road group is merged in multiple connected branch road equivalence identical for effect of unlinking power distribution network looped network agent structure；Order is repeatedly
Generation number k=1；
This branch switch is closed by distribution network failure Restoration model, merge ring network structure equivalent branch road group: branch road 1-2,2-3,
3-4,4-5,5-20,15-20,11-15,10-11,8-10,7-8,1-7 merge into a branch road group, branch road 15-16,
16-18,18-19,19-bus 103 merges into a branch road group, and branch road 20-21,21-22,22-bus 102 merges into one
Individual branch road group；Make iterations k=1；
Step 4: the not branch road in looped network agent structure is put 1 by force, i.e. in distribution network failure Restoration model, this branch road is opened
Closing Guan Bi, initialize population, the value respectively tieed up with particle represents the on off state of respective branch in power distribution network, and this dimension value of particle is 0
This branch switch i.e. disconnects, and this dimension value of particle is 1 i.e. this branch switch Guan Bi；
By not branch road 5-6,6-23,11-12,12-13,12-14,13-26,14-27,17-18,17-24 on ring network structure
Put 1 by force；Initialize population: maximum iteration time k is setmaxBeing 100, k initial value composes 1, and inertial factor ω takes 1, learns
Practise factor c1And c2All take 2；
Step 5: carry out the power distribution network reconfiguration after fault based on the Sigmoid functional value improved in binary particle swarm algorithm, obtain
Radial distribution networks；
Carry out the power distribution network reconfiguration after fault based on the Sigmoid functional value improved in binary particle swarm algorithm, obtain radial joining
Electrical network；
(1) particle initial velocity and position are set, calculate the Sigmoid functional value of each particle, select in looped network agent structure
The minimum branch road 1-7 of the functional value of branch road Sigmoid sets to 0, by other branch roads 1-2 of its place branch road group, 2-3,3-4,4-5,
5-20,15-20,11-15,10-11,8-10,7-8 put 1 by force；
(2) take out disconnected branches group, the branch road unrelated with remaining ring network structure after taking-up disconnected branches group is put 1 by force (surplus
Under looped network agent structure refer to take out after disconnected branches group, the circuluses after remaining all switch Guan Bis), from remaining looped network
Main body branch road selects branch road (be the herein branch road 15-20) disconnection that Sigmoid functional value is minimum, by other of its place branch road group
Branch road puts 1, and the most without looped network, remaining all branch roads all put 1；
(3) step (2) is repeated until disconnecting 2 branch road groups, generation radial distribution networks structure: branch switch 1-7,15-20
Disconnect；
Step 6: judging to obtain whether radial distribution networks exists the branch road that electric current is out-of-limit through step 5, electric current is out-of-limit when not existing
Branch road, enters step 7；
Length is limited, as a example by only lifting the first period and the 5th period:
First period that is 9 .-10 point, according to improve binary particle swarm algorithm obtain radiation network shelf structure be disconnected branches 1-7 and
15-20, the most all branch currents are the most out-of-limit；
5th period that is 13 .-14 point, is disconnected branches 1-7 according to improve binary particle swarm algorithm obtaining radiation network shelf structure
And 15-20, the out-of-limit branch road of electric current is 22-bus 102.It will be appreciated by those skilled in the art that any cutting load plan of setting
The most all can realize the technical scheme of the application.The embodiment of the present application preferably introduces following two Emergency Control Strategy, however it is necessary that explanation
It is that the following two Emergency Control Strategy introduced is intended merely to help reader to be more fully understood that present invention is spiritual rather than right
The present invention even restriction of claim.The application lists the Emergency Control Strategy that following two is concrete, and the first Emergency Control Strategy is i.e.
Emergency Control Strategy based on optimum fail-over path comprises the following steps:
(1) X that more limits the quantity of out-of-limit branch road in radiation network is calculated；
5th period branch road 22-bus 102 more limitation is 26A；
(2) with the upstream node of out-of-limit branch road as root node, downstream traversal search is to all leaf nodes, forms topological network,
Referred to as recover tree；From each leaf node t recovering tree tend.iThe most upstream deep search, until searching niNode, makes
Leaf node tend.iTo niLoading sum exceed the X that more limits the quantity, this path be referred to as recover tree t i-th fail-over path；
Recover tree graph and see Fig. 6: its Article 1 fail-over path is DG1, node 6 and node 5, Article 2 fail-over path
For node 1 and node 2；
(3) branch road between switch i.e. node each on fail-over path is write according to the node level size sequence of its upstream node
Fail-over path switch archives, once on-off control loading exceed more limitation or this path on all loads be all written into Ze Ci road
The archives write in footpath terminates, and starts to write the switch archives of a fail-over path, until the switch archives of all fail-over path
All writes；Wherein, the node level of root node is 1, and child node level is sequentially arranged；
Switch archives are: (scale in bracket reaches this branch switch and controls loading)
(4) when taking cut-out load aggregation, whether the on-off control load of switch archives every paths end is first looked at more than more
Limitation, if more than, will be switched off this switch and be classified as alternative excision scheme and by this switch from switch file delet, do not delete
Operation；
The on-off control load of switch archives every paths end is more limited the quantity and is the most more limited the quantity, so deleting from switch archives without switch
Remove；
(5) carry out the traversal combination switched, every fail-over path at most disconnects a switch, if in alternative excision scheme
There is same switch and then leave out one of them；If there is relationship between superior and subordinate, then subordinate's switch is deleted from alternative excision scheme, if
Excised DG in alternative excision scheme, then carry out isolated island dividing is i.e. that load is powered by DG, and during the i.e. isolated island of amount of recovery is divided by
The loading that DG powers counts cut-out loading；
Do not enumerate, as a example by only taking typical case:
Scheme 3: path 1 disconnects switch 5-6, path 2 disconnects switch 2-1, actual excision load 1 and load 6, altogether 58A (DG
Cannot be carried out isolated island to divide, amount of recovery is 0)；
If path 1 select disconnect switch 20-5, path 2 select disconnect switch 2-1, then due to 20-5 be switch 2-1 higher level
Switch, leaves out 2-1 from operation scheme, leaves behind 20-5；
(6) select excision loading to carry out excising the sequence of loading more than the scheme of more limitation, select wherein cutting load amount minimum
Scheme, be optimum fail-over path；
Excision loading minimum for scheme 2 and scheme 3, scheme 2 remains DG1, improve feeder line current-carrying nargin, so choosing
Going out optimum excision scheme is scheme 2；
The second Emergency Control Strategy uses the cutting load mode of the close load of more limiting the quantity of preferential excision, including herein below:
(1) X that more limits the quantity of out-of-limit branch road in radiation network is calculated；
5th period branch road 22-bus 102 more limitation is 26A；
(2) search obtains all end load buses, finds loading closest to the load excision of more limitation；
End load is load 1 and load 23 (DG1), its loading is respectively 25A and-20A, selects closest to more limitation (26A)
Load 1 excise；
(3) updating more limitation and end load bus, repeat step (2), until more limitation is less than 0, cutting load operation terminates；
More limitation is updated to 1A, and end load bus is updated to load 2 and load 23, and its loading is respectively 30A and-20A,
Select excision load 23；More limitation is updated to 21A, and end load bus is updated to load 2 and load 6, and loading is respectively 30A
And 33A, select load 2 to excise, more limitation is updated to-9A, and cutting load operation terminates, and disconnected branches is 6-23,1-2,2-3；
Step 7: update the individual optimum extreme value in particle cluster algorithm and colony's optimum extreme value according to minimum total losses loading and make repeatedly
Generation number k=k+1, repeats step 5-7, reaches maximum iteration time kmaxAfter, draw present period distribution network failure optimum recovery side
Case, now, obtains " position of the particle of least disadvantage loading " according to colony's optimum extreme value, i.e. distribution network failure optimum recovers
The topological structure of scheme；
Update individual optimum extreme value and colony's optimum extreme value；K=k+1, is updated iteration to the speed of particle according to formula, repeats step
Rapid 5 and 7, reach to stop after maximum iteration time, draw single period optimum recovery scheme, i.e. disconnected branches 1-2,2-3,1-7,
15-20；
Step 8: hop count t=t+1 when order recovers, repeats step 5-7, until t stops more than during T, obtains the distribution of each period
Net fault optimum recovery scheme；By-end function according to minimal switches number of operations, enters the optimum recovery scheme of each single period
Row enumerates combination, show that the excision scheme of switching manipulation least number of times is the best approach of the multi-period dynamic fault-recovery of power distribution network.
Obtain recovery scheme as follows:
The present invention, in order to the present invention and its actual application to be described, is not made any pro forma limit by example given above
System, any one professional and technical personnel, in the range of without departing from technical solution of the present invention, makees according to above technology and method
Certain modification and change are when the Equivalent embodiments being considered as equivalent variations.
Claims (8)
1. consider the power distribution network multi-period dynamic fault-recovery method of distributed power source power curve, it is characterized in that: first set failure recovery time according to failure condition, according to DG exert oneself situation setting recovery time hop count, then improvement binary particle swarm algorithm is used to carry out network reconfiguration, obtain radial distribution networks, Emergency Control Strategy based on optimum fail-over path carries out cutting load operation to the radial grid structure of each generation, employing is enumerated combined method and is combined by the optimum recovery scheme of each single period, draw the scheme of switching manipulation least number of times, it is power distribution network multi-period dynamic fault-recovery method.
2. consider the power distribution network multi-period dynamic fault-recovery method of distributed power source power curve, in distribution network failure recovery process, distributed power source is gone out force value and includes distribution network failure Restoration model in as negative load；It is characterized in that, said method comprising the steps of:
Step 1: after power distribution network breaks down, hop count T when setting fault recovery duration and recover, set up with minimum total losses loading be main target function, minimal switches number of operations be by-end function distribution network failure Restoration model, first i.e. distribution network failure recovery scheme meets main target function, by-end function is just considered main target functional value is identical when, in described distribution network failure Restoration model, distributed power source is gone out force value and includes model in as negative load, the initial value initially recovering period t is composed 1；
Step 2: the input node load matrix of power distribution network, branch impedance matrix, incidence matrix, fault occur the basic data such as moment and recovery time, use the power distribution network after repeated power flow calculating failure judgement the need of cutting load, it is to make cutting load sign of flag=1, otherwise make Flag=0；
Step 3: branch road group is merged in multiple connected branch road equivalence identical for effect of unlinking power distribution network looped network agent structure；Make iterations k=1；
Step 4: the not branch road in looped network agent structure is put 1 by force, i.e. in distribution network failure Restoration model, this branch switch is closed, initialize population, the value respectively tieed up with particle represents the on off state of respective branch in power distribution network, this dimension value of particle is that 0 i.e. this branch switch disconnects, and this dimension value of particle is 1 i.e. this branch switch Guan Bi；
Step 5: carry out the power distribution network reconfiguration after fault based on the Sigmoid functional value improved in binary particle swarm algorithm, obtain radial distribution networks；
Step 6: judge to obtain whether radial distribution networks exists the branch road that electric current is out-of-limit through step 5, when there is not the out-of-limit branch road of electric current, enters step 7；
When there is the out-of-limit branch road of electric current, if cutting load sign of flag being 0, returning the particle rapidity after step 5 is updated according to the random number regenerated and Sigmoid functional value, repeating step 5-6；If cutting load sign of flag is 1, each tree network in the radial distribution networks network that step 5 generates by the Emergency Control Strategy of setting is then used to carry out cutting load operation, subsequently into step 7, wherein, described tree network refers to the network of every bussed supply in radial distribution networks；
Step 7: update the individual optimum extreme value in particle cluster algorithm and colony's optimum extreme value according to minimum total losses loading and make iterations k=k+1, repeating step 5-7, reach maximum iteration time kmaxAfter, draw present period distribution network failure optimum recovery scheme, now, obtain " position of the particle of least disadvantage loading ", the i.e. topological structure of distribution network failure optimum recovery scheme according to colony's optimum extreme value；
Step 8: hop count t=t+1 when order recovers, repeats step 5-7, until t stops more than during T, obtains the distribution network failure optimum recovery scheme of each period；By-end function according to minimal switches number of operations, carries out enumerating combination by the optimum recovery scheme of each single period, show that the excision scheme of switching manipulation least number of times is the best approach of the multi-period dynamic fault-recovery of power distribution network.
3. according to the power distribution network multi-period dynamic fault-recovery method considering distributed power source power curve described in right 2, it is characterised in that:
In step 1, distribution network failure Restoration model considers the change of exerting oneself of DG, fault recovery is divided into multi-period dynamic model.
4. according to the power distribution network multi-period dynamic fault-recovery method considering distributed power source power curve described in right 2, it is characterised in that:
In steps of 5, the iterative formula improving binary particle swarm algorithm speed is:
In formula,Being respectively i-th particle d and tie up the n-th generation and the speed in the (n+1)th generation, ω is inertial factor, c1And c2For Studying factors, r1And r2For the random number on [0,1], PibestFor the individual optimum extreme value of i-th particle, GbestFor colony's optimum extreme value；
The position that particle is respectively tieed up is to be together decided on by the optimization of Sigmoid functional value and equivalence branch road group, equivalence branch road, and Sigmoid function is:
Wherein,Representing Sigmoid functional value, e is natural constant,The speed in the n-th generation is tieed up for i-th particle d.
5. according to the power distribution network multi-period dynamic fault-recovery method considering distributed power source power curve described in right 4, it is characterised in that:
In step 6, when there is the out-of-limit branch road of electric current and cutting load sign of flag is 0, returning step 5 and regenerating random number r1And r2And again draw speedWith Sigmoid functional value, carry out the power distribution network reconfiguration after fault based on the Sigmoid functional value after updating, obtain radial distribution networks.
6. according to the power distribution network multi-period dynamic fault-recovery method considering distributed power source power curve described in right 2, it is characterised in that:
In step 6, when there is the out-of-limit branch road of electric current and cutting load sign of flag is 1, Emergency Control Strategy based on optimum fail-over path is used to carry out the load excision of the out-of-limit branch road of electric current, tree is recovered for one, first its all fail-over path are found, then by whole for all fail-over path write switch archives, carry out the traversal combination switched, select optimum fail-over path；Wherein recover tree and refer to that, with the upstream node of out-of-limit branch road as root node, downstream traversal search is to all leaf nodes, the topological network of formation.
7. according to the power distribution network multi-period dynamic fault-recovery method considering distributed power source power curve described in claim 2 or 6, it is characterised in that:
In step 6, it is preferred to use following strategy carries out load excision:
(1) X that more limits the quantity of the out-of-limit branch road of electric current in tree network is calculated；
(2) with the upstream node of out-of-limit branch road as root node, downstream traversal search is to all leaf nodes, forms topological network, referred to as recovers tree；From each leaf node tr recovering tree trend.iThe most upstream search for, until searching niNode, makes leaf node trend.iTo niLoading sum exceed the X that more limits the quantity, this path be referred to as recover tree tr i-th fail-over path；
(3) branch road between switch i.e. node each on fail-over path is switched archives according to the node level size sequence Write fault restoration path of its upstream node, once on-off control loading exceed more on limitation or this path all loads be all written into, the write of the archives in this path terminates, start to write the switch archives of a fail-over path, until the switch archives of all fail-over path all write；Wherein, the node level of root node is 1, and child node level is sequentially arranged；
(4) when taking cut-out load aggregation, whether first look at the on-off control load of switch archives every paths end more than more limitation, if more than, will be switched off this switch and be classified as alternative excision scheme and by this switch from switch file delet, the most do not carry out deletion action；
(5) carry out the traversal combination switched, every fail-over path at most disconnects a switch, if alternative excision scheme exists same switch, leaves out one of them；If there is relationship between superior and subordinate, then subordinate's switch is deleted from alternative excision scheme, if having excised distributed power source in alternative excision scheme, then carry out isolated island dividing is i.e. that during load is powered and divided by the i.e. isolated island of amount of recovery, the loading powered by distributed power source counts cut-out loading by distributed power source；
(6) select excision loading to carry out excising the sequence of loading more than each alternative excision scheme of more limitation, select the scheme that wherein cutting load amount is minimum to be optimum fail-over path.
The power distribution network multi-period dynamic fault-recovery method of consideration distributed power source power curve the most according to claim 7, it is characterised in that:
In the scheme that (6th) step cutting load amount is minimum, the most all can make to excise the situation that loading is minimum when there is certain distributed power source of excision, selecting not excise this distributed power source.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610425258.5A CN105958486B (en) | 2016-06-15 | 2016-06-15 | Consider the multi-period dynamic fault-recovery method of power distribution network of distributed generation resource power curve |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610425258.5A CN105958486B (en) | 2016-06-15 | 2016-06-15 | Consider the multi-period dynamic fault-recovery method of power distribution network of distributed generation resource power curve |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105958486A true CN105958486A (en) | 2016-09-21 |
| CN105958486B CN105958486B (en) | 2018-05-01 |
Family
ID=56905693
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610425258.5A Active CN105958486B (en) | 2016-06-15 | 2016-06-15 | Consider the multi-period dynamic fault-recovery method of power distribution network of distributed generation resource power curve |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105958486B (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106655155A (en) * | 2016-10-12 | 2017-05-10 | 中国农业大学 | Power distribution network fault recovery method with consideration of the uncertainty of fault recovery time |
| CN106684862A (en) * | 2016-12-15 | 2017-05-17 | 国网黑龙江省电力有限公司 | Method of searching distribution network load transfer path based on greedy algorithm |
| CN107066639A (en) * | 2016-10-25 | 2017-08-18 | 贵州电网有限责任公司六盘水供电局 | Area power grid breakdown loss Consequence calculation method based on topological analysis |
| CN107341591A (en) * | 2017-06-15 | 2017-11-10 | 国网浙江省电力公司嘉兴供电公司 | A kind of transformer station's warning information Intelligent statistical analysis system and method |
| CN108199371A (en) * | 2018-01-03 | 2018-06-22 | 燕山大学 | A kind of active distribution network failure Dynamic- Recovery policy development method based on VCG |
| CN108574289A (en) * | 2018-03-13 | 2018-09-25 | 浙江大学 | A kind of related piconet island operation based on central controlled staged frequency modulation method |
| CN108985561A (en) * | 2018-06-08 | 2018-12-11 | 天津大学 | A kind of active power distribution network isolated island division methods based on chance constraint |
| CN110350510A (en) * | 2019-05-23 | 2019-10-18 | 国网河南省电力公司郑州供电公司 | A kind of power distribution network service restoration method considering failure disturbance degree |
| CN110729770A (en) * | 2019-10-24 | 2020-01-24 | 北京交通大学 | Active power distribution network load fault recovery strategy optimization algorithm |
| CN111200286A (en) * | 2020-02-13 | 2020-05-26 | 东方电子股份有限公司 | Intelligent power supply recovery method for self-healing of power distribution network |
| CN112485587A (en) * | 2020-11-11 | 2021-03-12 | 国网福建省电力有限公司宁德供电公司 | Layered positioning method for fault section of distribution-containing photovoltaic power distribution network |
| CN112711895A (en) * | 2020-12-30 | 2021-04-27 | 上海电机学院 | Power distribution network reconstruction method based on time interval division and improved particle swarm algorithm |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105281344A (en) * | 2015-11-20 | 2016-01-27 | 武汉大学 | Smart distribution network self-restoration optimization method considering power quality and uncertainty constraint thereof |
-
2016
- 2016-06-15 CN CN201610425258.5A patent/CN105958486B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105281344A (en) * | 2015-11-20 | 2016-01-27 | 武汉大学 | Smart distribution network self-restoration optimization method considering power quality and uncertainty constraint thereof |
Non-Patent Citations (3)
| Title |
|---|
| YOUNG-MOON PARK,ETC: "Application of Expert System to Power System Restoration in Sub-control Center", 《IEEE TRANSACTIONS ON POWER SYSTEMS》 * |
| 卢志刚等: "改进二进制粒子群优化算法在配电网络重构中的应用", 《电力系统保护与控制》 * |
| 陈昕玥等: "基于机会约束规划含光伏发电的配电网故障恢复", 《电网技术》 * |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106655155A (en) * | 2016-10-12 | 2017-05-10 | 中国农业大学 | Power distribution network fault recovery method with consideration of the uncertainty of fault recovery time |
| CN106655155B (en) * | 2016-10-12 | 2023-02-28 | 中国农业大学 | Power distribution network fault recovery method considering uncertainty of fault recovery time |
| CN107066639A (en) * | 2016-10-25 | 2017-08-18 | 贵州电网有限责任公司六盘水供电局 | Area power grid breakdown loss Consequence calculation method based on topological analysis |
| CN107066639B (en) * | 2016-10-25 | 2020-07-28 | 贵州电网有限责任公司六盘水供电局 | Regional power grid fault loss consequence calculation method based on topology analysis |
| CN106684862A (en) * | 2016-12-15 | 2017-05-17 | 国网黑龙江省电力有限公司 | Method of searching distribution network load transfer path based on greedy algorithm |
| CN107341591A (en) * | 2017-06-15 | 2017-11-10 | 国网浙江省电力公司嘉兴供电公司 | A kind of transformer station's warning information Intelligent statistical analysis system and method |
| CN107341591B (en) * | 2017-06-15 | 2020-06-05 | 国网浙江省电力公司嘉兴供电公司 | Intelligent statistical analysis system and method for substation warning information |
| CN108199371A (en) * | 2018-01-03 | 2018-06-22 | 燕山大学 | A kind of active distribution network failure Dynamic- Recovery policy development method based on VCG |
| CN108574289A (en) * | 2018-03-13 | 2018-09-25 | 浙江大学 | A kind of related piconet island operation based on central controlled staged frequency modulation method |
| CN108985561B (en) * | 2018-06-08 | 2021-09-07 | 天津大学 | Active power distribution network island division method based on opportunity constraint |
| CN108985561A (en) * | 2018-06-08 | 2018-12-11 | 天津大学 | A kind of active power distribution network isolated island division methods based on chance constraint |
| CN110350510A (en) * | 2019-05-23 | 2019-10-18 | 国网河南省电力公司郑州供电公司 | A kind of power distribution network service restoration method considering failure disturbance degree |
| CN110729770A (en) * | 2019-10-24 | 2020-01-24 | 北京交通大学 | Active power distribution network load fault recovery strategy optimization algorithm |
| CN110729770B (en) * | 2019-10-24 | 2022-07-29 | 北京交通大学 | Active power distribution network load fault recovery strategy optimization algorithm |
| CN111200286B (en) * | 2020-02-13 | 2021-04-06 | 东方电子股份有限公司 | Intelligent power supply recovery method for self-healing of power distribution network |
| CN111200286A (en) * | 2020-02-13 | 2020-05-26 | 东方电子股份有限公司 | Intelligent power supply recovery method for self-healing of power distribution network |
| CN112485587A (en) * | 2020-11-11 | 2021-03-12 | 国网福建省电力有限公司宁德供电公司 | Layered positioning method for fault section of distribution-containing photovoltaic power distribution network |
| CN112485587B (en) * | 2020-11-11 | 2024-04-19 | 国网福建省电力有限公司宁德供电公司 | Layered positioning method for fault section of distribution network containing distributed photovoltaic |
| CN112711895A (en) * | 2020-12-30 | 2021-04-27 | 上海电机学院 | Power distribution network reconstruction method based on time interval division and improved particle swarm algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105958486B (en) | 2018-05-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105958486A (en) | Power distribution network multi-period dynamic fault recovery method considering DG (Distributed Generation) output curve | |
| Abdelaziz et al. | Reconfiguration of distribution systems for loss reduction using the hyper-cube ant colony optimisation algorithm | |
| Syahputra | Fuzzy multi-objective approach for the improvement of distribution network efficiency by considering DG | |
| Syahputra et al. | Distribution network efficiency improvement based on fuzzy multi-objective method | |
| CN108988322B (en) | Microgrid operation strategy optimization method considering system time-varying property | |
| Ashari et al. | Power loss reduction strategy of distribution network with distributed generator integration | |
| CN110676842B (en) | Power distribution network reconstruction and modeling solving method and device for minimally removing fault area | |
| CN103199510B (en) | The ordered binary decision diagram modeling method that distribution network failure recovers | |
| CN104820865A (en) | Graph-theory-based intelligent optimization method for failure recovery of smart distribution grid | |
| CN103138227B (en) | Power distribution network fast power restoration method containing distributed power connected grid | |
| CN100576680C (en) | Big grid equipment overload is at the intelligence connection blanking method of line sensitivity | |
| CN107994582A (en) | Reconstruction method of power distribution network and system containing distributed generation resource | |
| WO2023005113A1 (en) | Reliability analysis method for power distribution system having micro-grid on the basis of path description | |
| CN113178864A (en) | Power distribution network power supply fault recovery method and device and terminal equipment | |
| CN104881708A (en) | Method for reconstructing power distribution network based on topology correction | |
| CN107069801A (en) | A kind of power distribution network isolated island division methods based on minimum Custom interruption cost | |
| Ravibabu et al. | Implementation of improved genetic algorithm in distribution system with feeder reconfiguration to minimize real power losses | |
| CN112232382B (en) | Branching and ammeter membership identification method and system for low-voltage transformer area | |
| Biswal et al. | Optimal overcurrent relay coordination scheme for microgrid | |
| CN105634117A (en) | Smart distribution network reconstruction method on the basis of multiple targets | |
| CN115549075A (en) | Power supply recovery method and system for power distribution network containing micro-grid | |
| CN105634041B (en) | A kind of battery network management method | |
| CN110165712B (en) | Backbone net rack planning modeling method based on network flow constraint derivation | |
| Wang et al. | Optimized tie-line planning of distribution networks with explicit reliability constraints | |
| CN208142301U (en) | A kind of battery management system |
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 | ||
| GR01 | Patent grant |