CN107658840B - Distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm - Google Patents
Distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm Download PDFInfo
- Publication number
- CN107658840B CN107658840B CN201710938867.5A CN201710938867A CN107658840B CN 107658840 B CN107658840 B CN 107658840B CN 201710938867 A CN201710938867 A CN 201710938867A CN 107658840 B CN107658840 B CN 107658840B
- Authority
- CN
- China
- Prior art keywords
- power
- node
- algorithm
- load
- solution
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000009826 distribution Methods 0.000 title claims abstract description 81
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000011084 recovery Methods 0.000 claims abstract description 20
- 230000005611 electricity Effects 0.000 claims abstract description 18
- 238000010248 power generation Methods 0.000 claims description 30
- 230000008569 process Effects 0.000 claims description 7
- 239000002360 explosive Substances 0.000 claims description 6
- 240000002853 Nelumbo nucifera Species 0.000 claims description 5
- 235000006508 Nelumbo nucifera Nutrition 0.000 claims description 5
- 235000006510 Nelumbo pentapetala Nutrition 0.000 claims description 5
- 238000007689 inspection Methods 0.000 claims description 3
- 208000001613 Gambling Diseases 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 claims description 2
- 150000001875 compounds Chemical class 0.000 claims description 2
- 238000001514 detection method Methods 0.000 claims description 2
- 238000004146 energy storage Methods 0.000 claims description 2
- 238000005498 polishing Methods 0.000 claims description 2
- 238000010009 beating Methods 0.000 claims 1
- 239000011800 void material Substances 0.000 claims 1
- 238000005457 optimization Methods 0.000 abstract description 9
- 238000013459 approach Methods 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 239000004744 fabric Substances 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000035699 permeability Effects 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
- GOLXNESZZPUPJE-UHFFFAOYSA-N spiromesifen Chemical compound CC1=CC(C)=CC(C)=C1C(C(O1)=O)=C(OC(=O)CC(C)(C)C)C11CCCC1 GOLXNESZZPUPJE-UHFFFAOYSA-N 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02H—EMERGENCY PROTECTIVE CIRCUIT ARRANGEMENTS
- H02H3/00—Emergency protective circuit arrangements for automatic disconnection directly responsive to an undesired change from normal electric working condition with or without subsequent reconnection ; integrated protection
- H02H3/02—Details
- H02H3/06—Details with automatic reconnection
- H02H3/066—Reconnection being a consequence of eliminating the fault which caused disconnection
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02H—EMERGENCY PROTECTIVE CIRCUIT ARRANGEMENTS
- H02H3/00—Emergency protective circuit arrangements for automatic disconnection directly responsive to an undesired change from normal electric working condition with or without subsequent reconnection ; integrated protection
- H02H3/02—Details
- H02H3/06—Details with automatic reconnection
- H02H3/063—Details concerning the co-operation of many similar arrangements, e.g. in a network
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02H—EMERGENCY PROTECTIVE CIRCUIT ARRANGEMENTS
- H02H7/00—Emergency protective circuit arrangements specially adapted for specific types of electric machines or apparatus or for sectionalised protection of cable or line systems, and effecting automatic switching in the event of an undesired change from normal working conditions
- H02H7/26—Sectionalised protection of cable or line systems, e.g. for disconnecting a section on which a short-circuit, earth fault, or arc discharge has occured
- H02H7/261—Sectionalised protection of cable or line systems, e.g. for disconnecting a section on which a short-circuit, earth fault, or arc discharge has occured involving signal transmission between at least two stations
- H02H7/262—Sectionalised protection of cable or line systems, e.g. for disconnecting a section on which a short-circuit, earth fault, or arc discharge has occured involving signal transmission between at least two stations involving transmissions of switching or blocking orders
-
- H02J3/382—
-
- 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
- H02J3/38—Arrangements for parallely feeding a single network by two or more generators, converters or transformers
- H02J3/388—Islanding, i.e. disconnection of local power supply from the network
Landscapes
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses the distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm, comprising the following steps: (1) reads power distribution network initial data, simplify to power distribution network；(2) virtual distributed power generator DG is converted by interconnection switch, and classified to DG；(3) first stage algorithm is defined start node and solution node, is restored electricity using A* algorithm to important load；(4) second stage algorithm, the distribution network data after reading first stage optimization, restores electricity to remaining load using fireworks algorithm；(5) comprehensive two stage optimal case, determines final fault recovery scheme.The present invention has ensured globally optimal solution, and have the characteristics that arithmetic speed is fast using method stage by stage.
Description
Technical field
The present invention relates to Distribution Automation Technology fields, more particularly to the power distribution network event based on A* algorithm and fireworks algorithm
Hinder restoration methods.
Background technique
Distribution network failure recovery refer to when distribution feeder somewhere is broken down, feeder automation starting quickly positioning and every
After failure, the interoperation by various switches is that the non-faulting region having a power failure restores electricity.The fault recovery of power distribution network is not
It is only played an important role in guaranteeing power distribution network the safe and economic operation, and is related to the sustainable development of national economy production.
The continuous propulsion built with smart grid, it is desirable that following power distribution network can freely receive all kinds of distributed electricals
The source, (Distributed in recent years, wind-powered electricity generation, solar power generation, small size gas turbine power generation distributed generate electricity
Generation, DG) permeability in a power distribution system is continuously improved, and role is more and more prominent, thus, it has to
Consider influence of the distributed generation resource to the fault recovery of power distribution network.On the other hand, since IEEE 1547-2003 standard,
No longer forbid the appearance of isolated island, but supplier of electricity and user is encouraged to realize isolated operation consciously by technological means.Therefore
Research is how in distribution network failure, utilization system and DG generating capacity, realizes fault recovery, can to system power supply is improved
It has a very important significance and is worth by property.
In conventional electrical distribution net, since it does not contain distributed generation resource, fault recovery is not necessarily to consider the problems of that isolated island divides,
Only need to consider the reconstruction of a Unified Network.In modern intelligent distribution network, due to a large amount of additions of DG, it has to consider
The generating capacity of DG and reasonable isolated island divide, and then to improve the reliability of system.The method for solving the problems, such as this at present is big
It mostly uses isolated island to divide to independently execute with two processes of major network reconstruct, is sought optimal solution respectively, then by simply coordinating rule
It then integrates and generates final recovery scheme.But there are some apparent defects for the algorithm, the method that two processes use is often
It is not identical, and the standard optimized may not be identical, optimization aim disunity causes final result unsatisfactory.In addition, two mistakes
It is exactly global optimal solution that the optimal solution of journey, which does not represent, cannot achieve global optimization.Two processes influence each other, the first stage
With absolute priority, under the driving of objective function, supply district will necessarily be expanded as far as possible, preferentially seized important negative
Lotus causes important path in next stage to be destroyed, it is difficult to obtain satisfied recovery scheme.
Distribution network failure is restored in network reconstructing part point, main research method can be divided into three classes: Mathematical Planning
Method, heuristic, artificial intelligence optimization's algorithm.It generally to be carried out in mathematic programming methods solution procedure at approximate and simplified
Reason, it is long that serious dimension calamity will lead to the calculating time, it is difficult to meet the requirement of fault recovery rapidity；Heuristic is fast with it
Speed obtains the extensive concern of industry, but its traversal search process relies on node serial number sequence, and programming realizes that logic is complicated and difficult
To guarantee recovery effects；Using genetic algorithm as artificial intelligence optimization's method of representative, by random search, there may be largely not
Feasible solution, computational efficiency is poor, time-consuming seriously to endure, and the requirement that distance is applied in real time is also farther out.
Summary of the invention
In order to solve the deficiencies in the prior art, the present invention provides extensive based on A* algorithm and the distribution network failure of fireworks algorithm
Compound method.
Distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm, first reading power distribution network initial data, to matching
Power grid is simplified, and the interconnection switch in non-faulting power loss region is converted into virtual distributed power generator DG, and to DG into
Row classification.First stage restores the power supply of simplified power loss area important load using heuritic approach A* algorithm.Second stage
It is restored electricity on the basis of in the first stage using load of the fireworks algorithm to still unrecovered non-faulting power loss region.Most
After integrate two stage optimal case, determine final fault recovery scheme.
Distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm, step are as follows:
Step (1): power distribution network initial data is read, power distribution network is simplified；
Step (2): in non-faulting power loss region, converting virtual distributed power generator DG for interconnection switch, and
Classify to virtual distributed power generator DG；
Step (3): the first stage restores electricity to the important load in non-faulting power loss region using A* algorithm；
Step (4): second stage carries out the still unrecovered load in non-faulting power loss region using fireworks algorithm extensive
Multiple power supply；
Step (5): the optimal solution of comprehensive first stage and second stage, the algorithm between second stage are based on the first rank
Power distribution network after Duan Huifu, so two stage solution and Lothrus apterus, two stage solution can directly be merged, obtain the overall situation most
Excellent fault recovery scheme.
The step of step (1) are as follows:
First read power distribution network initial data, the power distribution network initial data, comprising: each branch impedance, load power with
And power distribution network topological structure, search for all important loads, the important load, comprising: all first order loads and two stage loads, and
It judges whether there is two or more important loads to be connected directly, is a weight by all important load equivalences being connected directly
Want load, power be all power by duty value and it is all the sum of be lost by duty value internal wiring, will be simplified
Important load is arranged according to the power sequence from big to small of load, is put into queue IM, and IM record is all important negative
Lotus node.
In the step (2):
Interconnection switch between feeder line is known as virtual distributed power generator DG, virtual distributed power generator DG's is active standby
With capacity PMFor
PM=UavIMcosθ (1-1)
Wherein, UavFor rating average voltage；Cos θ is average power factor；For branch BiMaximum allowed current；Ii
For branch BiActual current；Branch BiFor the route on interconnection switch to feeder support path；IMFor branch BiElectric current it is abundant
Amount.
In the step (2):
By all distributed power generation unit DG, including the virtual distributed power generator DG that is converted by interconnection switch and
The distributed power generation unit DG of necessary being in power distribution network, is divided into three classes according to function:
The first kind, virtual distributed power generator DG, is converted, it is not possible to virtual distributed with other by interconnection switch
Power generator DG is grid-connected；
Second class, the distributed power generation unit DG of the necessary being with black starting-up, the necessary being with black starting-up
Distributed power generation unit DG allows and the virtual distributed power generator DG of the first kind, the second class actual distribution formula power generator DG sheet
Body and third class actual distribution formula power generator DG are grid-connected；
Third class is filled without the actual distribution formula power generator DG of black starting-up without the distributed power generation of black starting-up
It sets DG and is only incorporated into the power networks and can be powered for non-faulting power loss region load with the first kind and the second class DG.
The step of step (3) are as follows:
Step (3-1): objective function is established:
1) restore important power loss load to greatest extent:
Wherein, M is the number of important load in non-faulting power loss region.PiFor the power of i-th of important load, f1Attach most importance to
Want the sum of the power of load.
2) number for restoring insignificant load in the first phase reaches minimum:
F is the number of insignificant load in non-faulting power loss region, Pi' be the i-th insignificant load power, f2It is insignificant
The sum of power of load.
Step (3-2): constraint condition is established:
Step (3-2-1): node voltage constraint:
Vi min≤Vi≤Vi max (4)
Step (3-2-2): Branch Power Flow constraint:
Step (3-2-3): the virtual distributed non-interconnected constraint of power generator DG isolated island:
Dj1∩Dj2=0 Dj1,Dj2∈SDx (6)
Step (3-2-4): distributed power generation unit DG power constraint:
In formula, ViFor node i virtual voltage, Vi minFor the upper limit of node i virtual voltage, Vi maxFor node i virtual voltage
Lower limit；SlFor the practical trend of branch l,For the practical trend capacity of branch l, SDxIt is formed for virtual distributed power generator DG
Isolated island splitting scheme collection；Dj1For the isolated island set that jth 1 virtual distributed power generator DG is formed, Dj2It is jth 2 virtual point
The isolated island set that cloth power generator DG is formed, j1 ≠ j2.SNzFor the set of all loads in z-th of tree that restores electricity.PnFor
SNzInterior joint NnPower；PGzFor SNzIn all distributed power generation unit DG power total capacity, all distributed power generation dresses
Set the active reserve capacity P that DG power includes the virtual distributed power generator DGM, k is Margin coefficient.
Before carrying out A* algorithm, searching is all to be directly put into set E with the first kind and the second class DG node being connected,
What is recorded in E is terminal note, i.e. solution node.
Step (3-3): A* algorithm is executed.
The step of step (3-3) are as follows:
Step (3-3-1): whether detection queue IM is sky, and A* algorithm terminates if queue IM is sky, carries out second stage
Fireworks algorithm；If not empty, then first node current in queue IM is denoted as S and is put into OPEN table, remember dissipation value g=0, enabled
CLOSED is empty table；
Step (3-3-2): not set mistake in OPEN table is chosen, and the node with minimum g value is optimal node
BESTNODE, and optimal node BESTNODE is put into CLOSED table；
Step (3-3-3): if optimal node BESTNODE is destination node, a solution is successfully acquired, solution checking computations is carried out, tests
Whether the optimal path for calculating current solution node to start node meets binding character；If meeting constraint goes to step (3-3-7), if
It is unsatisfactory for constraint and goes to step (3-3-8)；
Step (3-3-4): if optimal node BESTNODE is not destination node, to optimal node BESTNODE without
Extension generates descendant node SUCCSSOR；
Step (3-3-5): the dissipation value g (SUC) of each descendant node SUCCSSOR is calculated:
G (SUC)=g (BES)+k (SUC) * q (SUC)；
Wherein, g (BES) is the dissipation value of optimal node BESTNODE node, and k (SUC) * q (SUC) is to save from BESTNODE
Point arrives cost required for descendant node SUCCSSOR, the load level and load of the cost and descendant node SUCCSSOR
Capacity is related, if descendant node SUCCSSOR is important load, descendant node SUCCSSOR number is put into set C, and
And enabling k (SUC) is -1.5, otherwise enabling k (SUC) is the load that 1, q (SUC) is descendant node SUCCSSOR node；
Step (3-3-6): being put into descendant node SUCCSSOR in OPEN table, goes to step (3-3-2)；
Step (3-3-7): all nodes in the start node S of current operation and set C are left out from M；Find solution
The process of node really forms an optimal road from the maximum important load node of current load amount to optimal DG
Diameter, due to the unicity of solution, so optimal path is without branch.If generate optimal path in DG there are also allowances, and be enough to
The arbitrary node for the non-powered side being connected directly with start node is powered, then is one and DG phase by the optimal path equivalence of generation
Load bus even, it is equivalent after load bus be connected with whole tip child nodes of the optimal path of generation, former DG type guarantor
It holds constant, the load bus after equivalence is put into E, as solution node, and go to step (3-3-1), otherwise do not do equivalence,
Pass directly to step (3-3-1)；
Step (3-3-8): the destination node is extended, and is generated descendant node SUCCSSOR, is gone to step (3-3-5).
The step of step (4) are as follows:
Step (4-1) establishes objective function:
Step (4-1-1) restores the load in remaining power loss region to greatest extent:
Wherein, G is the number of still unrecovered load in non-faulting power loss region, Pi" it is i-th of not yet recovery load
Power.f3For the sum of the power for not yet restoring load in the first stage.
It is minimum that step (4-1-2) switchs number of operations:
Wherein, m is the quantity of block switch in non-faulting power loss region, since interconnection switch has turned in the first phase
Virtual distributed power generator DG is turned to, as power supply, therefore does not consider further that connection in the case where switching the least objective function of number of operations
The closed-ended question of network switch, f4For the number summation of Operation switch.
Step (4-2) establishes constraint condition:
The constraint of step (4-2-1) node voltage:
Vi min≤Vi≤Vi max (4)
The constraint of step (4-2-2) Branch Power Flow:
The virtual distributed non-interconnected constraint of power generator DG isolated island of step (4-2-3):
Dj1∩Dj2=0 Dj1,Dj2∈SDx (6)
Step (4-2-4) distributed power generation unit DG power constraint:
In formula, ViFor node i virtual voltage, Vi minFor the upper limit of node i virtual voltage, Vi maxFor node i virtual voltage
Lower limit；SlFor the practical trend of branch l,For the practical trend capacity of branch l, SDxIt is formed for virtual distributed power generator DG
Isolated island splitting scheme collection；Dj1For the isolated island set that jth 1 virtual distributed power generator DG is formed, Dj2It is jth 2 virtual point
The isolated island set that cloth power generator DG is formed, j1 ≠ j2；SNzFor the set of all loads in z-th of tree that restores electricity.PnFor
SNzInterior joint NnPower；PGzFor SNzIn all distributed power generation unit DG power total capacity, k is Margin coefficient.
Step (4-3): fireworks algorithm steps are executed；
After fireworks algorithm, if obtaining an optimal solution, optimal solution is decoded, obtains all block switches
Opening and closing situation.If the optimal solution being unable to get, the solution in non-dominant disaggregation NP is taken out, according to actual needs,
Most suitable solution is chosen, most suitable solution is decoded, obtains the opening and closing situation of all switches.
The step of step (4-3) are as follows:
Step (4-3-1): system initialization reads in first stage postrun power distribution network underlying parameter and operation data,
Power distribution network underlying parameter and operation data, comprising: each branch impedance, load power and power distribution network topological structure after merging,
Fireworks algorithm parameter: maximum number of iterations N is set simultaneously, and spark sum is m, and convergence difference is σa；
Step (4-3-2): setting evolutionary generation n is 0, then random to generate p solution, forms disaggregation P, and create a sky
Non-dominant disaggregation NP, from disaggregation P select non-domination solution put NP into, using binary mode to objective function and constraint condition
It is encoded；
Step (4-3-3): out-of-limit inspection is carried out to solution each in disaggregation P: after the individual decoding in disaggregation P, by right
Original power distribution network progress three-phase, which is pushed forward, pushes back Load flow calculation, obtains distribution system trend distribution, has by constraint condition inspection
It is out-of-limit without individual, out-of-limit individual is rejected if having, while the random new individual that generates carries out polishing, is until there is no out-of-limit individuals
Only；
Step (4-3-4): blast operations are carried out to each solution in disaggregation P: calculating the explosive spark number of each fireworks
And burst radius, it generates explosive spark and Gauss explosive spark scans for, the fitness of all sparks is calculated, from all fire
Non-domination solution is selected in spending to update NP；
Step (4-3-5): p solution is selected altogether from fireworks and spark with the method for roulette, each solution is used
Variation, intersection and selection obtain an intersection solution ui,
When objective function is to be maximized, if intersecting solution uiGreater than xi, then u is usediReplace xiAnd use uiIt goes to update NP；
When objective function is to be minimized, if intersecting solution uiLess than xi, then u is usediReplace xiAnd use uiIt goes to update NP；
Step (4-3-6): the optimal solution of one fitness value of selection is solved with roulette selection p-1, forms new P.Wheel
The select probability of disk gambling depends on current solution at a distance from other solutions, and bigger with other solution distances, the probability of selection is bigger, with it
He solves apart from smaller, and the probability of selection is smaller；
Step (4-3-7): if termination condition meets, fireworks algorithm stops；Otherwise step (4-3-3) is skipped to；It is described
Termination condition is poor less than convergence to reach maximum number of iterations or fitness criteria difference.
Step (2): in non-faulting power loss region, power loss load can both be carried out by virtual distributed power generator DG
Restore, can also be restored by interconnection switch line between feeder line.Interconnection switch line is connected power supply capacity with bulk power grid by route
Current-carrying capability constraint, but load fluctuation is small under short trouble, interconnection switch line and the virtual distributed power generation dress with energy storage device
It sets DG all and can be considered the power supply of power output approximately constant.For purposes of illustration only, interconnection switch between feeder line is known as virtual distributed power generation
Device DG.Interconnection switch is identical as virtual distributed power generator DG function in failover procedure, all can be power loss area
Load power supply.
Step (2): in non-faulting power loss region, by interconnection switch conversion virtual distributed power generator DG between not
Can be grid-connected, because forming the original that looped network violates power distribution network radial structure if virtual distributed power generator DG is grid-connected
Then.A part of virtual distributed power generator DG does not have black starting-up function, it is necessary to by grid-connected by other virtual distributed
Power generator DG obtains startup power supply, and non-faulting power loss area could be given to power.
Important load avoids restoring insignificant load power supply during restoring electricity as far as possible, is existed with reducing insignificant load
First stage is resumed, and provides operable switch as much as possible for the fireworks algorithm optimization of next stage, and then calculate for fireworks
Method provides more switch combinations.
Compared with prior art, the beneficial effects of the present invention are:
The first, the present invention converts virtual distributed power generator DG for interconnection switch and carries out global optimizing, avoids big
Most distribution network failure recovery algorithms divide isolated island and network reconfiguration substep hard execution is to obtain the situation of global optimum.
The second, the present invention considers the black start-up ability of DG, and is reasonably classified to DG accordingly, and reality is improved
Engineering operability.
Searching process is divided into two stages by third, the present invention, and the first stage uses A* algorithm, will be simplified important negative
For lotus as start node, DG has ensured that each simplified important load can obtain optimal path as terminal note
It restores electricity, and uses heuritic approach, guarantee the rapidity of first stage.After A* algorithm, the important load in power loss area
It by equivalence is a load bus being connected with DG with the DG that is connect.Only it is left insignificant load, reduces fireworks algorithm
The solution space of search.
4th, it is run after the optimization of second stage of the invention in the first stage, reduces area to be restored, greatly reduce
Search space is solved, the requirement of rapidity is further ensured.
5th, the present invention has used emerging intelligent algorithm fireworks algorithm in second stage, carries out multiple-objection optimization
The optimizing of problem assesses the fitness of individual using intensity is dominated and is used to select, introduces the operation of differential evolution to enhance
The search capability and diversity of algorithm have higher stability, faster convergence rate compared with other intelligent algorithms
The quality preferably solved.
6th, the present invention has used fireworks algorithm in second stage, carries out the optimizing of multi-objective optimization question, obtains
Solution is the solution that optimal solution is either selected non-domination solution to concentrate according to actual needs by operator, and it is practical to improve Practical Project
Property.
Detailed description of the invention
The accompanying drawings constituting a part of this application is used to provide further understanding of the present application, and the application's shows
Meaning property embodiment and its explanation are not constituted an undue limitation on the present application for explaining the application.
Fig. 1 is that the present invention is based on the control flow charts of A* algorithm and the active power distribution network fault recovery method of fireworks algorithm.
Fig. 2 is IEEE33 Node power distribution system original graph.
Fig. 3 is simplified power distribution network, and adjacent important load is merged into an important load.
Fig. 4 is that interconnection switch is converted into the power distribution network after virtual distributed power generator DG, due to 5 near fault of node,
Block switch 4-5,5-6 disconnect isolated fault, and the interconnection switch of 33-18 is not connected with bulk power grid, then without conversion, herein
Only make switch to use.
Fig. 5 is important load service restoration figure in A* algorithm.
Fig. 6 is the simplification figure after algorithm restores electricity important load by first stage A*.
Fig. 7 is the fault recovery scheme of fireworks algorithm
Fig. 8 is the 33 node failure recovery scheme figures after being isolated, restoring electricity after failure occurs.
Specific embodiment
It is noted that following detailed description is all illustrative, it is intended to provide further instruction to the application.Unless another
It indicates, all technical and scientific terms used herein has usual with the application person of an ordinary skill in the technical field
The identical meanings of understanding.
It should be noted that term used herein above is merely to describe specific embodiment, and be not intended to restricted root
According to the illustrative embodiments of the application.As used herein, unless the context clearly indicates otherwise, otherwise singular
Also it is intended to include plural form, additionally, it should be understood that, when in the present specification using term "comprising" and/or " packet
Include " when, indicate existing characteristics, step, operation, device, component and/or their combination.
Embodiment
The present embodiment is operated according to flow chart described in Fig. 1.
Power distribution network figure used in the present embodiment is as shown in Figure 2.The power distribution network shares 33 nodes, burden with power 3715kW,
Load or burden without work 2300kVar, node 1 are slack bus, and calculating uses per unit value (to take voltage reference value for 12.66kV, power base
Quasi- value is 10MVA).In order to increase system scale, there is switch in every branch road, i.e. switch number is equal to circuitry number, the i.e. distribution
Net shares 33 nodes, 32 branches, 3 interconnection switch branches.System master data and DG information are shown in annex.
The restoration methods of the present embodiment specific steps are as follows:
(1) 5 near fault of node, block switch 4-5 after 5-6 disconnects isolated fault, read power distribution network initial data, right
Power distribution network is simplified, and adjacent important load is merged.As shown in figure 3, node 27 and 28 is that the important load being connected directly can
To merge into 26', the active power after merging is 120kW, and reactive power 45kvar ignores loss.Similarly 9 He of important load
It is 9', active power 120kW, reactive power 40kvar after 10 merging.
(2) virtual distributed power generator DG is converted by interconnection switch, and carries out DG classification.By interconnection switch 25-
29 are converted to virtual distributed power generator DG4, and interconnection switch 12-22 is converted to virtual distributed power generator DG5, such as Fig. 4
It is shown.Then DG can be divided into three classes:
First kind DG (virtual distributed power generator DG): DG4, DG5
Second class DG (can be with black starting-up): DG1, DG2
Third class DG (cannot black starting-up): DG3
(3) important load in non-faulting power failure area is as shown in table 3 after simplifying.The node number then stored in M is respectively as follows: 30,
27,9,12.The node number stored in E is respectively 7,12,29,31.
(4) important load being carried out using A* algorithm and finding optimal DG, the scheme that is restored is as shown in Figure 5.
(5) power distribution network after A* algorithm is simplified, power distribution network after simplifying is as shown in fig. 6,27 " be in first wife's power grid
The sum of 27,28,29,30 four point loads and internal loss, 9 " in first wife's power grid 9,10,11,12 four point loads and
The sum of internal loss.
(6) multiple target for carrying out fireworks algorithm solves, the scheme that is restored as shown in fig. 7, i.e. final fault recovery scheme,
It is as shown in Figure 8 to finally obtain 33 node failure recovery figures.
1 33 Node power distribution system basic parameter of table
2 distributed electrical source information of table
The important load of power distribution network after table 3 simplifies
The foregoing is merely preferred embodiment of the present application, are not intended to limit this application, for the skill of this field
For art personnel, various changes and changes are possible in this application.Within the spirit and principles of this application, made any to repair
Change, equivalent replacement, improvement etc., should be included within the scope of protection of this application.
Claims (10)
1. the distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm, characterized in that step are as follows:
Step (1): power distribution network initial data is read, power distribution network is simplified；
Step (2): in non-faulting power loss region, virtual distributed power generator DG is converted by interconnection switch, and to void
Quasi- distributed power generation unit DG classifies；
Step (3): the first stage restores electricity to the important load in non-faulting power loss region using A* algorithm；
Step (4): second stage carries out recovery confession to the still unrecovered load in non-faulting power loss region using fireworks algorithm
Electricity；
Step (5): the optimal solution of comprehensive first stage and second stage, the algorithm between second stage are extensive based on the first stage
Power distribution network after multiple, so two stage solution and Lothrus apterus, two stage solution is directly merged, it is extensive to obtain global optimum's failure
Compound case.
2. the distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm as described in claim 1, characterized in that described
The step of step (1) are as follows:
Power distribution network initial data, the power distribution network initial data are read first, comprising: each branch impedance, load power and are matched
Topological structure of electric searches for all important loads, the important load, comprising: all first order loads and two stage loads, and judge
Whether there are two or more than two important load be connected directly, be one important negative by all important load equivalences being connected directly
Lotus, power be all power by duty value and it is all by duty value internal wiring be lost the sum of, will be simplified important
Load is arranged according to the power sequence from big to small of load, is put into queue IM, and IM record is all important load sections
Point.
3. the distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm as described in claim 1, characterized in that described
In step (2):
Interconnection switch between feeder line is known as virtual distributed power generator DG, the reserve of virtual distributed power generator DG holds
Measure PMFor
PM=UavIMcosθ (1-1)
Wherein, UavFor rating average voltage；Cos θ is average power factor；For branch BiMaximum allowed current；IiFor branch
BiActual current；Branch BiFor the route on interconnection switch to feeder support path；IMFor branch BiCurrent margin.
4. the distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm as described in claim 1, characterized in that described
In step (2):
By all distributed power generation unit DG, including the virtual distributed power generator DG and distribution converted by interconnection switch
The distributed power generation unit DG of necessary being in net, is divided into three classes according to function:
The first kind, virtual distributed power generator DG, is converted by interconnection switch, it is not possible to other virtual distributed power generations
Device DG is grid-connected；
Second class, the distributed power generation unit DG of the necessary being with black starting-up, the distribution of the necessary being with black starting-up
Formula power generator DG allow with the virtual distributed power generator DG of the first kind, the second class actual distribution formula power generator DG itself with
And third class actual distribution formula power generator DG is grid-connected；
Third class, without the actual distribution formula power generator DG of black starting-up, without the distributed power generation unit DG of black starting-up
Only being incorporated into the power networks with the first kind and the second class distributed power generation unit DG can power for non-faulting power loss region load.
5. the distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm as claimed in claim 4, characterized in that described
The step of step (3) are as follows:
Step (3-1): objective function is established:
1) restore important power loss load to greatest extent:
Wherein, M is the number of important load in non-faulting power loss region；PiFor the power of i-th of important load, f1It is important negative
The sum of power of lotus；
2) number for restoring insignificant load in the first phase reaches minimum:
F is the number of insignificant load in non-faulting power loss region, Pi' be the i-th insignificant load power, f2Insignificant load
The sum of power；
Step (3-2): constraint condition is established:
Step (3-2-1): node voltage constraint:
Vi min≤Vi≤Vi max (4)
Step (3-2-2): Branch Power Flow constraint:
Step (3-2-3): the virtual distributed non-interconnected constraint of power generator DG isolated island:
Dj1∩Dj2=0 Dj1,Dj2∈SDx (6)
Step (3-2-4): distributed power generation unit DG power constraint:
In formula, ViFor node i virtual voltage, Vi minFor the lower limit of node i virtual voltage, Vi maxFor the upper of node i virtual voltage
Limit；SlFor the practical trend of branch l,For the practical trend capacity of branch l, SDxThe orphan formed for virtual distributed power generator DG
Island splitting scheme collection；Dj1For the isolated island set that jth 1 virtual distributed power generator DG is formed, Dj2For jth 2 virtual distributions
The isolated island set that formula power generator DG is formed, j1 ≠ j2；SNzFor the set of all loads in z-th of tree that restores electricity；PnFor SNz
Interior joint NnPower；PGzFor SNzIn all distributed power generation unit DG power total capacity, all distributed power generation units
DG power includes the active reserve capacity P of the virtual distributed power generator DGM, k is Margin coefficient；
Before carrying out A* algorithm, searching is all directly to be put with the first kind and the second class distributed power generation unit DG node being connected
Enter in set E, what is recorded in E is terminal note, i.e. solution node；
Step (3-3): A* algorithm is executed.
6. the distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm as claimed in claim 5, characterized in that described
The step of step (3-3) are as follows:
Step (3-3-1): whether detection queue IM is sky, and A* algorithm terminates if queue IM is sky, carries out second stage fireworks
Algorithm；If not empty, then first node current in queue IM is denoted as S and is put into OPEN table, remembered dissipation value g=0, enable CLOSED
For empty table；
Step (3-3-2): choosing not set mistake in OPEN table, and the node with minimum g value is optimal node BESTNODE,
And optimal node BESTNODE is put into CLOSED table；
Step (3-3-3): if optimal node BESTNODE is destination node, a solution is successfully acquired, solution checking computations are carried out, checking computations are worked as
Whether the optimal path of preceding solution node to start node meets binding character；If meeting constraint goes to step (3-3-7), if discontented
Foot constraint goes to step (3-3-8)；
Step (3-3-4): if optimal node BESTNODE is not destination node, to optimal node BESTNODE without expanding
Exhibition generates descendant node SUCCSSOR；
Step (3-3-5): the dissipation value g (SUC) of each descendant node SUCCSSOR is calculated:
G (SUC)=g (BES)+k (SUC) * q (SUC)；
Wherein, g (BES) be optimal node BESTNODE node dissipation value, k (SUC) * q (SUC) be from BESTNODE node to
Cost required for descendant node SUCCSSOR, the load level and load capacity of the cost and descendant node SUCCSSOR
It is related, if descendant node SUCCSSOR is important load, descendant node SUCCSSOR number is put into set C, and enable k
It (SUC) is -1.5, otherwise enabling k (SUC) is the load that 1, q (SUC) is descendant node SUCCSSOR node；
Step (3-3-6): being put into descendant node SUCCSSOR in OPEN table, goes to step (3-3-2)；
Step (3-3-7): all nodes in the start node S of current operation and set C are left out from M；Find solution node
Process, really form one from the maximum important load node of current load amount to Optimal Distribution formula power generator DG's
One optimal path, due to the unicity of solution, so optimal path is without branch；If the distributed power generation in the optimal path generated
There are also allowances by device DG, and are enough to give the arbitrary node power supply for the non-powered side that start node is connected directly, then by generation
Optimal path equivalence is a load bus being connected with distributed power generation unit DG, and the load bus and generation after equivalence are most
Whole tip child nodes of shortest path are connected, and former distributed power generation unit DG type remains unchanged, by the load bus after equivalence
It is put into E, as solution node, and goes to step (3-3-1), otherwise do not do equivalence, pass directly to step (3-3-1)；
Step (3-3-8): the destination node is extended, and is generated descendant node SUCCSSOR, is gone to step (3-3-5).
7. the distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm as described in claim 1, characterized in that described
The step of step (4) are as follows:
Step (4-1): objective function is established:
Step (4-1-1): restore the load in remaining power loss region to greatest extent:
Wherein, G is the number of still unrecovered load in non-faulting power loss region, Pi" it is i-th of the power for not yet restoring load；
f3For the sum of the power for not yet restoring load in the first stage；
Step (4-1-2): switch number of operations is minimum:
Wherein, m is the quantity of block switch in non-faulting power loss region, since interconnection switch has been converted into the first phase
Virtual distributed power generator DG as power supply, therefore does not consider further that contact is opened in the case where switching the least objective function of number of operations
The closed-ended question of pass, f4For the number summation of Operation switch；
Step (4-2) establishes constraint condition:
The constraint of step (4-2-1) node voltage:
Vi min≤Vi≤Vi max (4)
The constraint of step (4-2-2) Branch Power Flow:
The virtual distributed non-interconnected constraint of power generator DG isolated island of step (4-2-3):
Dj1∩Dj2=0 Dj1,Dj2∈SDx (6)
Step (4-2-4) distributed power generation unit DG power constraint:
In formula, ViFor node i virtual voltage, Vi minFor the upper limit of node i virtual voltage, Vi maxFor under node i virtual voltage
Limit；SlFor the practical trend of branch l,For the practical trend capacity of branch l, SDxThe orphan formed for virtual distributed power generator DG
Island splitting scheme collection；Dj1For the isolated island set that jth 1 virtual distributed power generator DG is formed, Dj2For jth 2 virtual distributions
The isolated island set that formula power generator DG is formed, j1 ≠ j2；SNzFor the set of all loads in z-th of tree that restores electricity；PnFor SNz
Interior joint NnPower；PGzFor SNzIn all distributed power generation unit DG power total capacity, k is Margin coefficient；
Step (4-3): fireworks algorithm steps are executed.
8. the distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm as claimed in claim 7, characterized in that
After fireworks algorithm, if obtaining an optimal solution, optimal solution is decoded, obtains beating for all block switches
Situation is closed in open and close；If the optimal solution being unable to get, the solution in non-dominant disaggregation NP is taken out, according to actual needs, is chosen
Most suitable solution is decoded most suitable solution, obtains the opening and closing situation of all switches.
9. the distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm as claimed in claim 7, characterized in that described
The step of step (4-3) are as follows:
Step (4-3-1): system initialization reads in first stage postrun power distribution network underlying parameter and operation data, distribution
Net underlying parameter and operation data, comprising: each branch impedance, load power and power distribution network topological structure after merging, simultaneously
Fireworks algorithm parameter: maximum number of iterations N is set, and spark sum is m, and convergence difference is σa；
Step (4-3-2): setting evolutionary generation n is 0, then random to generate p solution, forms disaggregation P, and empty non-of creation one
Disaggregation NP is dominated, selects non-domination solution to put NP into from disaggregation P, objective function and constraint condition are carried out using binary mode
Coding；
Step (4-3-3): out-of-limit inspection is carried out to solution each in disaggregation P: after the individual decoding in disaggregation P, by original
Power distribution network progress three-phase, which is pushed forward, pushes back Load flow calculation, obtains distribution system trend distribution, checks for by constraint condition a
Body is out-of-limit, and out-of-limit individual is rejected if having, while the random new individual that generates carries out polishing, until there is no out-of-limit individual；
Step (4-3-4): blast operations are carried out to each solution in disaggregation P: calculates the explosive spark number of each fireworks and quick-fried
Fried radius, generates explosive spark and Gauss explosive spark scans for, and the fitness of all sparks is calculated, from all sparks
Non-domination solution is selected to update non-dominant disaggregation NP；
Step (4-3-5): with the method for roulette from fireworks and spark altogether selection p solution, for each solution use make a variation,
Intersect and selection obtains an intersection solution ui,
When objective function is to be maximized, if intersecting solution uiGreater than xi, then u is usediReplace xiAnd use uiIt goes to update NP；
When objective function is to be minimized, if intersecting solution uiLess than xi, then u is usediReplace xiAnd use uiIt goes to update NP；
Step (4-3-6): the optimal solution of one fitness value of selection is solved with roulette selection p-1, forms new disaggregation P；Wheel
The select probability of disk gambling depends on current solution at a distance from other solutions, and bigger with other solution distances, the probability of selection is bigger, with it
He solves apart from smaller, and the probability of selection is smaller；
Step (4-3-7): if termination condition meets, fireworks algorithm stops；Otherwise step (4-3-3) is skipped to；The termination
Condition is poor less than convergence to reach maximum number of iterations or fitness criteria difference.
10. the distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm as described in claim 1, characterized in that step
Suddenly (2): in non-faulting power loss region, power loss load can either be restored by virtual distributed power generator DG, also can
Enough it is restored by interconnection switch line between feeder line；Interconnection switch line be connected with bulk power grid power supply capacity by line energizing flow ability about
Beam, but load fluctuation is small under short trouble, and interconnection switch line and the virtual distributed power generator DG with energy storage device are all considered as
The power supply of power output approximately constant.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710938867.5A CN107658840B (en) | 2017-09-30 | 2017-09-30 | Distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710938867.5A CN107658840B (en) | 2017-09-30 | 2017-09-30 | Distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107658840A CN107658840A (en) | 2018-02-02 |
| CN107658840B true CN107658840B (en) | 2019-03-15 |
Family
ID=61117553
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710938867.5A Expired - Fee Related CN107658840B (en) | 2017-09-30 | 2017-09-30 | Distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107658840B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108446455B (en) * | 2018-02-27 | 2019-09-27 | 天津大学 | A kind of multiple target Method for HW/SW partitioning based on fireworks algorithm |
| CN109409420B (en) * | 2018-10-08 | 2022-05-03 | 西安热工研究院有限公司 | Photovoltaic string fault diagnosis method under non-uniform irradiance |
| CN110097267B (en) * | 2019-04-19 | 2023-04-18 | 天津大学 | Multi-target multi-robot task allocation method based on improved firework algorithm |
| CN110676842B (en) * | 2019-09-23 | 2021-05-04 | 南方电网科学研究院有限责任公司 | Power distribution network reconstruction and modeling solving method and device for minimally removing fault area |
| CN111245099B (en) * | 2020-03-19 | 2021-03-12 | 山东科技大学 | Power distribution network state estimation method based on event trigger transmission mechanism and hybrid measurement |
| CN111525578A (en) * | 2020-05-12 | 2020-08-11 | 通号（长沙）轨道交通控制技术有限公司 | Distributed urban rail power supply system supporting power supply method for networked operation |
| CN111934320B (en) * | 2020-08-20 | 2023-08-01 | 三峡大学 | Active power distribution network rapid reconstruction method based on linear tide equation and improved firework algorithm |
| CN112929913B (en) * | 2021-03-31 | 2022-05-27 | 广东电网有限责任公司电力调度控制中心 | Virtual network service fault recovery method based on routing survivability under network slice |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103855707A (en) * | 2014-02-20 | 2014-06-11 | 深圳供电局有限公司 | Power supply reliability assessment method of power distribution network comprising distributed power supply |
| CN105244912A (en) * | 2015-10-27 | 2016-01-13 | 上海电力学院 | Method for active power distribution network island power supply recovery and black-start |
| CN105740970A (en) * | 2016-01-22 | 2016-07-06 | 中国电力科学研究院 | Power distribution network reconstruction method based on fireworks algorithm |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8965591B2 (en) * | 2012-02-16 | 2015-02-24 | General Electric Company | Regenerating electric power distribution switching plans based on changing power distribution network conditions |
-
2017
- 2017-09-30 CN CN201710938867.5A patent/CN107658840B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103855707A (en) * | 2014-02-20 | 2014-06-11 | 深圳供电局有限公司 | Power supply reliability assessment method of power distribution network comprising distributed power supply |
| CN105244912A (en) * | 2015-10-27 | 2016-01-13 | 上海电力学院 | Method for active power distribution network island power supply recovery and black-start |
| CN105740970A (en) * | 2016-01-22 | 2016-07-06 | 中国电力科学研究院 | Power distribution network reconstruction method based on fireworks algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107658840A (en) | 2018-02-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107658840B (en) | Distribution network failure restoration methods based on A* algorithm Yu fireworks algorithm | |
| CN105098762B (en) | A kind of isolated island division methods containing distributed power distribution network | |
| Taylor et al. | Convex models of distribution system reconfiguration | |
| Miranda et al. | Differential evolutionary particle swarm optimization (DEEPSO): a successful hybrid | |
| CN105958486B (en) | Consider the multi-period dynamic fault-recovery method of power distribution network of distributed generation resource power curve | |
| CN107316113B (en) | Power transmission network planning method and system | |
| CN102801790A (en) | Microgrid energy management system based on IEC (International Electrotechnical Commission) 61850 and multi-agent method | |
| Li et al. | Controlled islanding for a hybrid AC/DC grid with VSC-HVDC using semi-supervised spectral clustering | |
| Seker et al. | Artificial Bee Colony algorithm for optimal placement and sizing of distributed generation | |
| CN103401241A (en) | Control method for smooth handoff of micro grid operation mode based on DG ad-hoc network strategy | |
| CN108281959A (en) | A kind of bulk transmission grid optimization method of high proportion type power system of renewable energy | |
| Matos et al. | Multicontingency steady state security evaluation using fuzzy clustering techniques | |
| Gonzalez-Longatt et al. | Power flow solution on multi-terminal HVDC systems: supergrid case | |
| CN110311372A (en) | Sub-area division method based on spectral clustering | |
| Natarajan et al. | Optimal placement and sizing of DGs in the distribution system for loss minimization and voltage stability improvement using CABC | |
| Pahwa et al. | A complex networks approach for sizing and siting of distributed generators in the distribution system | |
| Ding et al. | Graph theory based splitting strategies for power system islanding operation | |
| Chowdhury et al. | Optimal placement and sizing of renewable distributed generation in electricity networks considering different load models | |
| CN106487001B (en) | A kind of isolated power system intelligent reconstruction method | |
| CN109193706A (en) | A kind of electric system generator rotor angle Transient Instability cuts the searching method and device of machine automatically | |
| Tyuryukanov et al. | Controlled islanding of power networks based on graph reduction and spectral clustering | |
| CN115425637A (en) | Floyd-MPSO algorithm-based island power grid emergency reconstruction method | |
| Shawon et al. | Optimal microgrid formation through performance optimization in distribution networks with distributed generation | |
| CN114665481A (en) | Urban power grid partitioning method and device based on power grid node vectorization | |
| CN109995021B (en) | Micro-grid system source-grid coordination planning method based on typical topology matching |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190315 Termination date: 20210930 |