CN104716670B - Unit Combination method under grid-connected based on Network Security Constraints - Google Patents
Unit Combination method under grid-connected based on Network Security Constraints Download PDFInfo
- Publication number
- CN104716670B CN104716670B CN201510151613.XA CN201510151613A CN104716670B CN 104716670 B CN104716670 B CN 104716670B CN 201510151613 A CN201510151613 A CN 201510151613A CN 104716670 B CN104716670 B CN 104716670B
- Authority
- CN
- China
- Prior art keywords
- unit
- constraints
- network security
- power
- security constraints
- 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
- 238000000034 method Methods 0.000 title claims abstract description 21
- 238000005457 optimization Methods 0.000 claims abstract description 17
- 238000003462 Bender reaction Methods 0.000 claims abstract description 8
- 238000001514 detection method Methods 0.000 claims abstract description 5
- 108010074506 Transfer Factor Proteins 0.000 claims description 13
- 238000009987 spinning Methods 0.000 claims description 11
- 238000009826 distribution Methods 0.000 claims description 9
- 230000005540 biological transmission Effects 0.000 claims description 8
- 230000005611 electricity Effects 0.000 claims description 8
- 239000003245 coal Substances 0.000 claims description 4
- 239000011159 matrix material Substances 0.000 claims description 3
- 230000000977 initiatory effect Effects 0.000 claims description 2
- 238000006243 chemical reaction Methods 0.000 claims 1
- 239000004744 fabric Substances 0.000 claims 1
- 230000009452 underexpressoin Effects 0.000 claims 1
- 238000000354 decomposition reaction Methods 0.000 abstract description 2
- 238000002372 labelling Methods 0.000 abstract 1
- 241000196324 Embryophyta Species 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 4
- 238000012804 iterative process Methods 0.000 description 2
- 240000002853 Nelumbo nucifera Species 0.000 description 1
- 235000006508 Nelumbo nucifera Nutrition 0.000 description 1
- 235000006510 Nelumbo pentapetala Nutrition 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000000205 computational method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000002045 lasting effect Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Classifications
-
- H02J3/383—
-
- 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/46—Controlling of the sharing of output between the generators, converters, or transformers
-
- 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]
-
- 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/003—Load forecast, e.g. methods or systems for forecasting future load demand
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02B—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO BUILDINGS, e.g. HOUSING, HOUSE APPLIANCES OR RELATED END-USER APPLICATIONS
- Y02B10/00—Integration of renewable energy sources in buildings
- Y02B10/10—Photovoltaic [PV]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02E—REDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
- Y02E10/00—Energy generation through renewable energy sources
- Y02E10/50—Photovoltaic [PV] energy
- Y02E10/56—Power conversion systems, e.g. maximum power point trackers
Landscapes
- Engineering & Computer Science (AREA)
- Power Engineering (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses it is a kind of it is grid-connected under Unit Combination method based on Network Security Constraints, step is as follows：Step 1：Predicted using 7 models of place；Step 2：Set up model, description object function and constraints；Step 3：Simplify DC power flow constraints；Step 4：Optimization of Unit Commitment By Improved is resolved into into two subproblems for mutually restricting；Step 5：SP1 is calculated, start and stop scheme is obtained；Step 6：By step（5）Initial value of the gained Unit Commitment scheme as SP2 computings, increases punishment variable in object function and Network Security Constraintsχ l , calculate SP2, and detection branch whether active power is out-of-limit；Step 7：The non-zero punishment variate-value of labelling, increases constraints in SP1, calculates SP1, repeat step 5,6.Cut set of the method for the present invention using 7 models of place, Benders algorithms in Unit Combination optimization decomposes thought, by complicated SCUC PROBLEM DECOMPOSITIONs into two integer programming subproblems for mutually restricting, the linking of SP1 and SP2 is realized by the method for mutually iterating, the difficulty and speed for solving the problem is considerably reduced.
Description
Technical field
The present invention relates to Operation of Electric Systems, analysis and dispatching technique field, more particularly to it is grid-connected lower based on network
The Unit Combination method of security constraint.
Background technology
Consider security constraint Unit Combination (SCUC) refer to make on the premise of Network Security Constraints are met certain or it is multiple
Object function optimization and the Unit Commitment plan that draws, are the key links for formulating generation schedule, transport in power-system short-term
In row, structural optimization can be carried out for power resource.It is substantial amounts of it is grid-connected network system can be impacted, in order to press down
The safety problem brought by the impact is made, makes resource obtain the greater area of ability to transmit electricity distributed rationally, give full play to electrical network,
Realize that power grid security is mutually unified with economy.Therefore, how to realize that large-scale photovoltaic is grid-connected and power system security constraints Unit Combination
Linking, it will become a vital problem.
It is many with regard to solving the method for Unit Combination both at home and abroad, but it is to solve for grid-connected lower consideration security constraint unit group
That what is closed is considerably less；Such as priority list method, intelligent algorithm and Lagrangian Relaxation scheduling algorithm, it is adapted to the common Unit Combination of solution
Problem, for solving, security constraint Unit Combination is still not comprehensive enough.
The content of the invention
The present invention is to solve lacking in prior art in grid-connected lower consideration Network Security Constraints Unit Combination
The technical problems such as comprehensive computational methods, so as to provide a kind of rationally efficient grid-connected lower base based on Benders algorithms
In the Unit Combination method of Network Security Constraints.
To solve above-mentioned technical problem, the technical solution adopted in the present invention is as follows：
It is a kind of it is grid-connected under Unit Combination method based on Network Security Constraints, it is characterised in that：Step is as follows：
Step 1：Following 24 hours load of system and photovoltaic generation power are made prediction using classical 7 model of place；
Step 2：Set up it is grid-connected under computation model based on Network Security Constraints Unit Combination, transport according to actual electric network
Row feature describes object function and constraints；
Step 3：DC power flow constraints in Network Security Constraints is carried out using generated output power transfer factor
Simplify so that the constraints is only relevant with transmission line parameters；
Step 4：The Optimization of Unit Commitment By Improved of considering security constraint is resolved into into two mutual restrictions with Benders algorithms
Subproblem, the branch road respectively without Network Security Constraints Optimization of Unit Commitment By Improved SP1 and meter and Network Security Constraints Unit Combination have
Work(power detection problems SP2；
Step 5：Calculate without Network Security Constraints Optimization of Unit Commitment By Improved SP1 with CPLEX instruments, obtain now each unit
Start and stop scheme；
Step 6：Unit Commitment scheme obtained by step (5) is active as the branch road of meter and Network Security Constraints Unit Combination
The initial value of power detection problems SP2 computings, increases punishment variable χ in object function and Network Security Constraintsl, SP2 is calculated,
And whether the start and stop scheme obtained by detecting step (5) can cause branch road active power out-of-limit, if not out-of-limit, obtained by step (5)
Unit Commitment scheme is system optimal scheme；If out-of-limit, next step is carried out；
Step 7：The non-zero punishment variate-value obtained in step (6) is marked, and increases a new pact in SP1
Beam condition, then calculates SP1, and repeat step 5 and step 6 make SP1 and SP2 mutual iteration repeatedly, until obtaining system optimal side
Case.
In the step (1), classical 7 model of place to the model that system loading is set up is
(1)；
Wherein,The actual value of load under scene s is represented,Represent predicted load,For the normal state predicted under scene s
Distribution error value；To the model that photovoltaic generation is set up it is
(2)；
Wherein,Represent that photovoltaic plant actually goes out force value under scene s,Represent that photovoltaic plant predicts force value.
In the step (2), object function is that system operation expense is minimum, and formula is：
In the step (2), constraints includes generating electricity and load power Constraints of Equilibrium, system spinning reserve capacity, machine
The active restriction of exerting oneself of group, unit active power adjustment rate constraint, minimum start-off time constraints, Network Security Constraints.
In the step (3), Network Security Constraints are
Wherein, Pl,tFor the through-put power of t circuit l；For the maximum that branch road l through-put powers are allowed；
Pl,tRepresent that concrete formula is as follows with generated output power transfer factor：
(10),
Wherein, M is node set, Gl←jFor power transfer distribution factors of the node j to circuit l；Pj,tIt is node j in t
Net injecting power；Output transfer factor Gl←jBe react the impact of generated output power and line transmission power relation because
Son, be
Wherein θkAnd θmThe top k voltage phase angles and end m voltage phase angles of circuit l are represented respectively；XkjAnd XmjRepresent DC power flow
The resistance value of correspondence position in impedance matrix；xlFor the resistance value of circuit l.
In the step (4), include object function without security constraint Optimization of Unit Commitment By Improved SP1, generate electricity and put down with load power
Weighing apparatus constraint, system spinning reserve capacity, the active restriction of exerting oneself of unit, unit active power adjustment rate constraint and minimum are opened
Stop time-constrain；The branch road active power test problems SP2 of considering security constraint Unit Combination includes the mesh for increasing punishment variable
Scalar functions, generating are active with load power Constraints of Equilibrium, system spinning reserve capacity, the active restriction of exerting oneself of unit, unit
The Network Security Constraints of power adjustment rate constraint, minimum start-off time constraints and increase punishment variable.
The increase punishes that the object function of variable is：
Wherein, χlTo punish variable；ε is penalty coefficient；L be system line set, l ∈ L；The network for increasing punishment variable
Security constraint is：
In the step (7), the new constraints increased in SP1 is：
WhereinFor the solution of SP1；For the solution of SP2；For current decision amount,For the electromotor output work of t circuit l
Rate transfer factor.
The invention has the beneficial effects as follows, the method for the present invention is excellent in Unit Combination using 7 models of place, Benders algorithms
Cut set in change decomposes thought, by complicated SCUC PROBLEM DECOMPOSITIONs into two mutual restrictions integer programming subproblems, respectively
Branch road active power test problems without Network Security Constraints Optimization of Unit Commitment By Improved SP1 and meter and Network Security Constraints Unit Combination
SP2, realizes the linking of SP1 and SP2 by the method for mutually iterating, and considerably reduces the difficulty and speed for solving the problem
Degree.
Description of the drawings
Fig. 1 is the 7 scene equivalent models of the present invention.
Fig. 2 is the daily load curve of 7 models of place prediction.
Fig. 3 is the day photovoltaic generation power curve of 7 models of place prediction.
Fig. 4 is the Benders algorithm flow charts of the present invention.
Fig. 5 is IEEE14 node system wiring diagrams.
Specific embodiment
Embodiment：It is a kind of it is grid-connected under Unit Combination method based on Network Security Constraints, step is as follows：
Step 1：Following 24 hours load of system and photovoltaic generation power are made prediction using classical 7 model of place.
The equivalent model of 7 models of place is as shown in figure 1,7 models of place to the model that system loading is set up are
Wherein,The actual value of load under scene s is represented, D*t represents predicted load,For the normal state predicted under scene s
Distribution error value.The daily load curve of prediction is as shown in Figure 2.
7 models of place to the model that photovoltaic generation power is set up are
Wherein,Represent that photovoltaic plant actually goes out force value under scene s,Represent that photovoltaic plant predicts force value.Prediction
Day photovoltaic generation power curve is as shown in Figure 3.
Step 2：Set up it is grid-connected under computation model based on Network Security Constraints Unit Combination, transport according to actual electric network
Row feature describes object function and constraints.
The object function is that system operation expense is minimum, and formula is：
Wherein, Ui,tIt is unit i in the running status of t, starts shooting as 1, shut down as 0；s∈SgFor scene set；psFor
The probability density of scene s；T gathered for the time；NgFor unit set；Pi,tFor unit i t it is active go out force value, Ci(Pi,t)
For corresponding coal consumption expense；CsiPayment for initiation for unit i is used.
Constraints include generating electricity it is active with load power Constraints of Equilibrium, system spinning reserve capacity, unit go out power restriction
Constraint, unit active power adjustment rate constraint, minimum start-off time constraints, Network Security Constraints.Unit active power is adjusted
Rate constraint, minimum start-stop time are about
Generate electricity and load power Constraints of Equilibrium, formula is：
Wherein, PloadtFor t system load value；Ppv.tFor t photovoltaic generation power.
System spinning reserve capacity, formula is：
Wherein, RtRepresent the spinning reserve capacity of t, Pi.maxMaximum technology for unit i is exerted oneself.
Unit active power technology units limits, formula is：
Ui,tPi.min≤Pi,t≤Ui,tPi.max, i ∈ Ng, t ∈ T (6),
Wherein, Pi.minRepresent that the minimum technology of unit i is exerted oneself.
Unit active power adjusts rate constraint, and formula is：
Wherein,Unit i maximums climb lotus speed,For the unloding speed of the maximum of unit i.
Unit minimum start-off time constraints, formula is：
Wherein,WithThe minimum continuous working period and minimum lasting idle time of unit are represented respectively,WithDuration and duration needed for shutdown respectively needed for the startup of unit i.
Network Security Constraints, formula is：
Wherein, Pl,tFor the through-put power of t circuit l；For the maximum that circuit l through-put powers are allowed.
Step 3：DC power flow constraints in Network Security Constraints is carried out using generated output power transfer factor
Simplify so that the constraints is only relevant with transmission line parameters.
Pl,tAvailable generated output power transfer factor represents that concrete formula is as follows：
Wherein, M is node set, Gl←jFor power transfer distribution factors of the node j to circuit l；Pj,tIt is node j in t
The net injecting power carved.
Power transfer factor Gl←jIt is the factor of influence for reacting generated output power and line transmission power relation, formula is：
Wherein, θkAnd θmThe top k voltage phase angles and end m voltage phase angles of circuit l, X are represented respectivelykjAnd XmjRepresent direct current
The resistance value of correspondence position in trend impedance matrix；xlFor the impedance of circuit l.
So, the nonlinear restriction in formula 9 with generated output power transfer factor linearisation, concrete formula can be：
Step 4：The Optimization of Unit Commitment By Improved of considering security constraint is resolved into into two mutual restrictions with Benders algorithms
Subproblem, the branch road active power inspection respectively without security constraint Optimization of Unit Commitment By Improved SP1 and considering security constraint Unit Combination
Survey problem SP2.
Include object function, generate electricity and load power Constraints of Equilibrium, system without Network Security Constraints Optimization of Unit Commitment By Improved SP1
The active restriction of exerting oneself of spinning reserve capacity, unit, unit active power adjustment rate constraint and minimum start-off time constraints.
The branch road active power test problems SP2 of meter and Network Security Constraints Unit Combination includes the mesh for increasing punishment variable
Scalar functions, generating are active with load power Constraints of Equilibrium, system spinning reserve capacity, the active restriction of exerting oneself of unit, unit
The Network Security Constraints of power adjustment rate constraint, minimum start-off time constraints and increase punishment variable.
Step 5：Calculate without Network Security Constraints Optimization of Unit Commitment By Improved SP1 with CPLEX instruments, obtain now each unit
Start and stop scheme.
Step 6：Unit Commitment scheme obtained by step (5) is active as the branch road of meter and Network Security Constraints Unit Combination
The initial value of power detection problems SP2 computings, increases punishment variable χ in object function and Network Security Constraintsl, SP2 is calculated,
And whether the start and stop scheme obtained by detecting step (5) can cause branch road active power out-of-limit, if not out-of-limit, obtained by step (5)
Unit Commitment scheme is system optimal scheme；If out-of-limit, next step is carried out.
Increase punishes that the object function of variable is：
Wherein, χlTo punish variable；ε is penalty coefficient.
Increase punishes that the Network Security Constraints of variable are：
Wherein, L be system branch set, l ∈ L.
Step 7：The non-zero punishment variate-value obtained in step (6) is marked, and increases a new pact in SP1
Beam condition, then calculates SP1, and repeat step 5 and step 6 make SP1 and SP2 mutual iteration repeatedly, until obtaining system optimal side
Case.
The new constraints increased in SP1 is：
WhereinFor the solution of SP1；For the solution of SP2；For current decision amount,For the generated output power of circuit l
Transfer factor.
Benders algorithm flows are as shown in Figure 4.
The mutual iteration of SP1 and SP2, the punishment variable in SP2 gradually level off to zero in an iterative process, when punishment variable is
When zero, the Unit Combination for obtaining is system optimal scheme.
Test result is as follows：
After grid-connected, the size of grid connection capacity can directly affect the distribution of transmission line active power, when certain node optical
When volt grid connection capacity is excessive, if it is out-of-limit to cause main line in system that active power occurs.Fig. 5 is IEEE14 node system wiring
Figure.
The installed capacity that photovoltaic plant is accessed at bus 9 is 50MW, and by obtained by 7 model of place forecast models, 24 is little
When photovoltaic generation power data.
By test, the Unit Commitment scheme in SP1 in the first iterative process is as shown in table 1, by this Unit Commitment side
Case is calculated in being updated to SP2, as a result shows circuit 2-3 8:00 to 11:00 generation active power is out-of-limit, and its corresponding circuit is passed
Defeated power and punishment variable are as shown in table 2, it can be seen that punishment variate-value at this moment is not 0.The now total operation of Unit Combination
Cost is $ 748457.5.
Table 1：Unit Combination scheme
Table 2：The line transmission power and punishment variable of circuit 2-3
| Moment | 8:00 | 9:00 | 10:00 | 11:00 |
| Through-put power/MW | 86.95 | 88.49 | 88.49 | 87.72 |
| Punishment variable/MW | 8.95 | 8.49 | 8.49 | 7.72 |
As shown in Table 2, the punishment variable of circuit 2-3 is not 0, active power occurs out-of-limit.
Bring generated output power transfer distribution factor in table 3 into SP1, carry out second iteration, the second filial generation for obtaining
The test result of SP1 is as shown in table 4.
Table 3：Generated output power shifts distribution factor
Table 4：The test result of second filial generation SP1
| Moment | 8:00 | 9:00 | 10:00 | 11:00 |
| Unit 1 | 0 | 0 | 0 | 0 |
Table 1 and table 4 are carried out into contrast discovery, the Unit Commitment state of SP1 changes after increasing new constraints, machine
1 is organized 8:00 to 11:00 moment was changed into stopped status from open state, and circuit 2-3 is 8:00 to 11:There is wattful power in 00 moment
Rate is out-of-limit, and SP2 eliminates punishment variable in second iteration, shows that new Unit Combination scheme meets Network Security Constraints.
Now, as shown in table 5, if not considering the construction cost of photovoltaic plant, the grid-connected lower unit group for considering Network Security Constraints
The more grid-connected lower $ 748457.5 without during security constraint of total operating cost of conjunction rises to $ 751137.9, but compared to unglazed
Lie prostrate and total operating cost off the net is greatly reduced, the total coal consumption expense of system is reduced after this explanation adds photovoltaic, is further considered
After security constraint, total operating cost slightly rises, its reason be consider security constraint after can increase the start and stop expense of part of generating units
With.
Table 5：Operating cost
Claims (7)
1. it is a kind of it is grid-connected under Unit Combination method based on Network Security Constraints, it is characterised in that：Step is as follows：
Step 1：Following 24 hours load of system and photovoltaic generation power are made prediction using classical 7 model of place；
Step 2：Set up it is grid-connected under computation model based on Network Security Constraints Unit Combination, it is special according to actual electric network operation
Point description object function and constraints；
Step 3：DC power flow constraints in Network Security Constraints is simplified using generated output power transfer factor,
So that the constraints is only relevant with transmission line parameters；Network Security Constraints are-Pl max≤Pl,t≤Pl max, t ∈ T (9), its
In, Pl,tFor the through-put power of t circuit l；Pl maxFor the maximum that branch road l through-put powers are allowed；
Pl,tRepresent that concrete formula is as follows with generated output power transfer factor：
T ∈ T (10), wherein, M is node set, Gl←jFor power transfer distribution factors of the node j to circuit l；Pj,tFor node j
In the net injecting power of t；Output transfer factor Gl←jIt is reaction generated output power and line transmission power relation
Factor of influence, be
Wherein, θkAnd θmThe top k voltage phase angles and end m voltage phase angles of circuit l are represented respectively；XkjAnd XmjRepresent DC power flow
The resistance value of correspondence position in impedance matrix；xlFor the resistance value of circuit l；PjFor the net injecting power of node j；PlFor circuit l's
Through-put power；
Step 4：To count with Benders algorithms and the Optimization of Unit Commitment By Improved of Network Security Constraints resolves into two mutual restrictions
Subproblem, the branch road respectively without Network Security Constraints Optimization of Unit Commitment By Improved SP1 and meter and Network Security Constraints Unit Combination have
Work(power detection problems SP2；
Step 5：The start and stop that now each unit is obtained without Network Security Constraints Optimization of Unit Commitment By Improved SP1 are calculated with CPLEX instruments
Scheme；
Step 6：Using Unit Commitment scheme obtained by step (5) as meter and the branch road active power of Network Security Constraints Unit Combination
The initial value of test problems SP2 computings, increases punishment variable χ in object function and Network Security Constraintsl, SP2 is calculated, and is examined
Survey whether the start and stop scheme obtained by step (5) can cause branch road active power out-of-limit, if not out-of-limit, unit obtained by step (5)
Start and stop scheme is system optimal scheme；If out-of-limit, next step is carried out；
Step 7：The non-zero punishment variate-value obtained in step (6) is marked, and increases a new constraint bar in SP1
Part, then calculates SP1, and repeat step 5 and step 6 make SP1 and SP2 mutual iteration repeatedly, until obtaining system optimal scheme.
2. it is according to claim 1 it is grid-connected under Unit Combination method based on Network Security Constraints, it is characterised in that：
In the step (1), classical 7 model of place to the model that system loading is set up is
Wherein,Represent the actual value of load under scene s, Dt *Represent predicted load,For the normal state point predicted under scene s
Cloth error amount；To the model that photovoltaic generation is set up it is
Wherein,Under expression scene s, photovoltaic plant actually goes out force value, Gt *Represent that photovoltaic plant predicts force value.
3. it is according to claim 1 it is grid-connected under Unit Combination method based on Network Security Constraints, it is characterised in that：
In the step (2), object function is that system operation expense is minimum, and formula is：
Wherein, Ui,tIt is unit i in the running status of t, starts shooting as 1, shut down as 0；s∈SgFor scene set；psFor scene s
Probability density；T gathered for the time；NgFor unit set；Pi,tFor unit i t it is active go out force value, Ci(Pi,t) it is right
The coal consumption expense answered；CsiPayment for initiation for unit i is used.
4. it is according to claim 1 it is grid-connected under Unit Combination method based on Network Security Constraints, it is characterised in that：
In the step (2), constraints include generating electricity it is active with load power Constraints of Equilibrium, system spinning reserve capacity, unit go out
Power restriction constraint, unit active power adjustment rate constraint, minimum start-off time constraints, Network Security Constraints.
5. it is according to claim 1 it is grid-connected under Unit Combination method based on Network Security Constraints, it is characterised in that：
In the step (4), include object function without Network Security Constraints Optimization of Unit Commitment By Improved SP1, generating electricity is balanced about with load power
When the active restriction of exerting oneself of beam, system spinning reserve capacity, unit, unit active power adjustment rate constraint and minimum start and stop
Between constrain；The branch road active power test problems SP2 of meter and Network Security Constraints Unit Combination includes the mesh for increasing punishment variable
Scalar functions, generating are active with load power Constraints of Equilibrium, system spinning reserve capacity, the active restriction of exerting oneself of unit, unit
The Network Security Constraints of power adjustment rate constraint, minimum start-off time constraints and increase punishment variable.
6. it is according to claim 5 it is grid-connected under Unit Combination method based on Network Security Constraints, it is characterised in that：
The increase punishes that the object function of variable is：
Wherein, χlTo punish variable；ε is penalty coefficient；L be system branch set, l ∈ L；Ui,tFor unit i t operation
State, starts shooting as 1, shuts down as 0；s∈SgFor scene set；PsFor the probability density of scene s；T gathered for the time；NgFor unit
Set；Pi,tFor unit i t it is active go out force value, Ci(Pi,t) for corresponding coal consumption expense；Described increase punishes variable
Network Security Constraints are：
(14)；
Wherein, L be system branch set, l ∈ L；M is node set, Gl←jFor node j to the power of circuit l transfer distribution because
Son；Pj,tFor node j t net injecting power；χlTo punish variable；Pl maxFor the maximum that branch road l through-put powers are allowed.
7. it is according to claim 1 it is grid-connected under Unit Combination method based on Network Security Constraints, it is characterised in that：
In the step (7), the new constraints increased in SP1 is
WhereinFor the solution of SP1；For the solution of SP2；For current decision amount,For the generated output power of t circuit l
Transfer factor；χlTo punish variable；NgFor unit set.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510151613.XA CN104716670B (en) | 2015-04-01 | 2015-04-01 | Unit Combination method under grid-connected based on Network Security Constraints |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510151613.XA CN104716670B (en) | 2015-04-01 | 2015-04-01 | Unit Combination method under grid-connected based on Network Security Constraints |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104716670A CN104716670A (en) | 2015-06-17 |
| CN104716670B true CN104716670B (en) | 2017-03-29 |
Family
ID=53415742
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510151613.XA Expired - Fee Related CN104716670B (en) | 2015-04-01 | 2015-04-01 | Unit Combination method under grid-connected based on Network Security Constraints |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104716670B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105305485A (en) * | 2015-10-15 | 2016-02-03 | 南方电网科学研究院有限责任公司 | Large-scale intermittent energy consuming security constrained economic dispatch method |
| CN106953354B (en) * | 2017-03-10 | 2019-11-08 | 国网山东省电力公司经济技术研究院 | Consider the method for Unit Commitment containing wind-powered electricity generation of voltage support |
| CN107239863B (en) * | 2017-04-12 | 2020-07-14 | 广东电网有限责任公司电力调度控制中心 | Robust unit combination method for power grid safety constraint |
| CN108964012A (en) * | 2017-05-22 | 2018-12-07 | 武汉大学 | The security constraint Unit Combination dual blank-holder decomposed based on Benders |
| CN112186765B (en) * | 2017-11-30 | 2022-06-17 | 三峡大学 | Modeling method of day-ahead scheduling model of unit combination decision |
| CN109390932A (en) * | 2018-09-18 | 2019-02-26 | 中国南方电网有限责任公司 | A kind of security constraint Unit Combination calculation method considering DC link power optimization |
| CN111769602B (en) * | 2020-07-12 | 2022-06-21 | 国网山西省电力公司电力科学研究院 | Optimized scheduling method for multi-time-scale wind storage combined system |
| CN114862130B (en) * | 2022-04-14 | 2023-03-24 | 山东大学 | Multi-scene random unit combination method and system based on double-layer decomposition algorithm |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102684190B (en) * | 2012-05-25 | 2014-07-09 | 浙江大学 | Alternating-current power flow contained unit combination method efficient in solving |
| CN102684224B (en) * | 2012-05-25 | 2014-04-16 | 浙江大学 | Unit combination method for resolving and considering wind power volatility |
| CN104242356B (en) * | 2014-09-26 | 2016-07-06 | 国家电网公司 | Consider Robust Interval wind-powered electricity generation dispatching method and the device of wind energy turbine set collection cable malfunction |
-
2015
- 2015-04-01 CN CN201510151613.XA patent/CN104716670B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN104716670A (en) | 2015-06-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104716670B (en) | Unit Combination method under grid-connected based on Network Security Constraints | |
| Ding et al. | Multi-stage distributionally robust stochastic dual dynamic programming to multi-period economic dispatch with virtual energy storage | |
| CN110571789B (en) | Electric heating air network three-stage scheduling method based on wind power uncertainty under data driving | |
| Ma et al. | Optimal allocation of hybrid energy storage systems for smoothing photovoltaic power fluctuations considering the active power curtailment of photovoltaic | |
| CN105243516B (en) | Distributed photovoltaic power generation maximum digestion capability computing system based on active distribution network | |
| CN108173282A (en) | A kind of consideration electricity turns gas operating cost integrated energy system Optimization Scheduling | |
| CN102623989A (en) | Method for optimization and configuration of intermittent distributed generation (DG) | |
| CN105186500B (en) | A kind of power distribution network power dissipation coordination optimizing method based on weighting acceleration Lagrangian again | |
| CN102567651B (en) | Take into account mains supply capability assessment method and device that bottleneck finds | |
| CN114139780A (en) | Coordinated optimization method and system for virtual power plant and power distribution network containing distributed power supply | |
| CN108964113B (en) | New energy power generation dispatching method and system | |
| Zhang et al. | Feasibility identification and computational efficiency improvement for two-stage RUC with multiple wind farms | |
| CN108847667A (en) | A kind of method for expansion planning of power transmission network considering electric network composition optimization | |
| CN103473393A (en) | Method for modeling power transmission margin control model considering random probability | |
| CN106159998A (en) | Regenerative resource micro-capacitance sensor Optimal Scheduling | |
| CN110765591B (en) | Distributed state sensing and optimizing method for power distribution network based on block chain technology | |
| Zhao et al. | Distributed multi-objective day-ahead generation and HVDC transmission joint scheduling for two-area HVDC-linked power grids | |
| CN101478160B (en) | Electric system tide optimization method for high-efficient processing complex electric control appliance | |
| CN102684228A (en) | Method for optimizing configuration of intermittent distribution type power supply based on complementary | |
| CN107231004A (en) | The optimization method of the consumption of the power produced by renewable origin | |
| CN112713615B (en) | Quick coordination scheduling method and system for electricity-gas integrated energy system | |
| CN103761574A (en) | Distributed power supply and region load matched feature matching method | |
| Bilil et al. | Probabilistic economic emission dispatch optimization of multi-sources power system | |
| Lin et al. | Decentralized economic dispatch for transmission and distribution networks via modified generalized benders decomposition | |
| Phan-Van et al. | A comparison of different metaheuristic optimization algorithms on hydrogen storage-based microgrid sizing |
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 | ||
| 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: 20170329 Termination date: 20190401 |