CN110504701A - A kind of battery energy storage system dispatching method considering dynamic efficiency for charge-discharge - Google Patents
A kind of battery energy storage system dispatching method considering dynamic efficiency for charge-discharge Download PDFInfo
- Publication number
- CN110504701A CN110504701A CN201910778785.8A CN201910778785A CN110504701A CN 110504701 A CN110504701 A CN 110504701A CN 201910778785 A CN201910778785 A CN 201910778785A CN 110504701 A CN110504701 A CN 110504701A
- Authority
- CN
- China
- Prior art keywords
- energy storage
- storage system
- battery energy
- electricity
- formula
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for ac mains or ac distribution networks
- H02J3/28—Arrangements for balancing of the load in a network by storage of energy
- H02J3/32—Arrangements for balancing of the load in a network by storage of energy using batteries with converting means
-
- 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
-
- 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
- Y02E40/00—Technologies for an efficient electrical power generation, transmission or distribution
- Y02E40/10—Flexible AC transmission systems [FACTS]
Landscapes
- Engineering & Computer Science (AREA)
- Power Engineering (AREA)
- Charge And Discharge Circuits For Batteries Or The Like (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
A kind of battery energy storage system dispatching method considering dynamic efficiency for charge-discharge, comprising the following steps: A, obtain battery energy storage system essential information, piece-wise linearization is carried out to efficiency for charge-discharge characteristic curve；B, battery energy storage system run-limiting, just last electricity, the prediction scheduling informations such as tou power price or price multiplier are obtained；C, scheduling model is established；D, the dynamic bound of battery energy storage system day part storing electricity is calculated；E, Dynamic Programming reverse recursion obtains the Optimized model for the core subproblem that day part needs to solve repeatedly；F, using the geometrical characteristic of core subproblem Optimized model, optimal path in each horizontal subregion is successively solved from top to bottom；G, the optimal path in horizontal subregion is solved；H, processing optimal path jump；I, Dynamic Programming forward recursive calculates the optimal charge/discharge electricity amount and power decision of day part；J, development enters subsequent period at any time, updates the scheduling information in step B, executes step C.This method provides a kind of effective way for the optimization operation of battery energy storage system, has engineering practical value.
Description
Technical field
The present invention relates to battery energy storage technical field more particularly to a kind of battery energy storage systems for considering dynamic efficiency for charge-discharge
System dispatching method.
Background technique
Renewable energy constantly quickly accesses power grid, and uncertainty proposes newly the control and management of electric system
Challenge.In recent years, energy storage has become new industrial hot spot.By the extensive use of energy-storage system, power can not only be stabilized
Fluctuation improves power quality, enhances network system reliability of operation.
Under normal circumstances, the efficiency for charge-discharge of energy storage is with charge-discharge electric power dynamic change.Such as lead-acid battery and lithium electricity
Energy-storage system state-of-charge (SOC) in electric discharge in pond is in 20% to 95%, and voltage is not substantially within this range, when electric discharge
Become, efficiency can decrease to some degree with the increase of discharge current.Charging process is considered as the inverse process of electric discharge, efficiency change
Similar with electric discharge, when deviateing declared working condition, loss increases, and efficiency reduces.
Existing battery energy storage system dispatching method is usually the prediction data according to following one day at present, formulates the fortune of energy storage
Row plan, is modified according to set amount when actual motion deviates operational plan, optimizes the on-road efficiency of battery energy storage system.
But be generally used general business optimization software when solving the scheduling model of battery energy storage system at present and solved, it lacks
Rare specific aim, adaptable dedicated derivation algorithm.
Therefore, there is an urgent need to have a kind of tailor-made algorithm that can be directed to scheduling model self structure characteristic can be realized at present
The Efficient Solution of scheduling problem.
Summary of the invention
The object of the present invention is to provide a kind of battery energy storage system dispatching method for considering dynamic efficiency for charge-discharge, the present invention
Method provides a kind of effective way for the optimization operation of battery energy storage system, has engineering practical value.
To achieve the above object, the technical solution adopted by the present invention the following steps are included:
A kind of battery energy storage system dispatching method considering dynamic efficiency for charge-discharge can formulate battery storage with this method
The optimization operational decisions of energy system, improve the performance driving economy of battery energy storage system, method includes the following steps:
A, capacity, dynamic charge-discharge electric power and relationship between efficiency, charge-discharge electric power limitation and the electricity of battery energy storage system are determined
Pond energy storage system capacity bound selects suitable segments to the charge and discharge electric work of battery energy storage system according to the required precision of scheduling
Rate-relationship between efficiency carries out piece-wise linearization；
B, target storing electricity, day part when obtaining initial storage electricity, the finishing scheduling of battery energy storage system are surfed the Internet
Constraint and timesharing forecasted electricity market price or equivalent value multiplier；
C, the scheduling model of battery energy storage system is established, when the optimization aim of scheduling model is that formulation battery energy storage system is each
Section charge-discharge electric power decision, maximizes total gene-ration revenue of battery energy storage system, the objective function of scheduling model are as follows:
In formula, T is scheduling slot sum, and t is scheduling slot number, λtFor the t period forecasted electricity market price or wait potency
It is worth multiplier, qtFor the charge/discharge electricity amount of the battery energy storage system of t period, discharges for positive value, be charged as negative value, p (qt) t when
The charge-discharge electric power of the battery energy storage system of section is qtUnitary piecewise linear function, δ be scheduling slot length；
The constraint condition of scheduling model includes:
1) the electric quantity balancing constraint of battery energy storage system
In formula, etFor the storing electricity of t period end battery energy storage system, LtFor known t period battery energy storage system
Dead loss electricity, be negative value；
2) electricity volume constrains
In formula,WithThe respectively electricity volume bound of t period battery energy storage system；
3) the charge-discharge electric power constraint of battery energy storage system
In formula, PmaxAnd PminThe respectively upper physical limit of battery energy storage system discharge power and charge power, function p are single
The piecewise linear function of tune, charge-discharge electric power constraint (4) can be converted to the constraint of discharge and recharge:
In formula, function p' is the inverse function of function p, p'(Pmax) and p'(Pmin) it is respectively battery energy storage system discharge electricity amount
With the upper physical limit of charge capacity；
4) electricity SOC is constrained
In formula, EmaxAnd EminThe respectively bound of the storing electricity of battery energy storage system；
5) the first last Constraint of battery energy storage system
e0=E0,eT=ET (7)
In formula, E0And ETTarget electricity when being battery energy storage system initial time electricity and finishing scheduling respectively, e0And eT
Respectively dispatch the storing electricity of the battery energy storage system of start time and T period Mo；
By (1), (2), (3), (5), (6), (7) formula constitutes the scheduling model of battery energy storage system；
D, the dynamic bound constraint for calculating battery energy storage system day part storing electricity, according to scheduling last battery energy storage system
Target storing electricity E when finishing scheduling of unitingT(2) and (5) are constrained with battery energy storage system day part storing electricity bound, are passed through
The reverse recursion since the T period calculates the dynamic bound of battery energy storage system day part storing electricity are as follows:
In formula, j is time variable,WithWhen the t period end battery energy storage system of respectively reverse-direction derivation acquisition is each
The dynamic bound of section storing electricity, ETThe target storing electricity of battery energy storage system, L when for finishing schedulingjFor known jth
The dead loss electricity of period battery energy storage system is negative value, p'(Pmax) and p'(Pmin) it is respectively battery energy storage system electric discharge
The upper physical limit of electricity and charge capacity,WithThe respectively bound of jth period battery energy storage system electricity volume；
According to the initial quantity of electricity E of battery energy storage system0(2) are constrained with battery energy storage system day part storing electricity bound
(5), the period carries out forward recursive since scheduling, calculates the dynamic bound of battery energy storage system day part storing electricity
Are as follows:
In formula, j is time variable,WithThe respectively positive battery energy storage system for deriving the t period Mo obtained is each
The dynamic bound of period storing electricity, E0The storing electricity of battery energy storage system, L when starting for schedulingjWhen for known jth
The dead loss electricity of section battery energy storage system, p'(Pmax) and p'(Pmin) it is respectively battery energy storage system discharge electricity amount and charging
The upper physical limit of electricity,WithThe respectively bound of jth period battery energy storage system electricity volume；
Forward direction is derived and reverse-direction derivation result combines, calculates the dynamic bound of the storing electricity of battery energy storage system
Are as follows:
In formula,And etIt respectively calculates in the dynamic of battery energy storage system day part storing electricity of the t period of acquisition
Lower limit obtains the bound of new battery energy storage system day part storing electricity in conjunction with (6) formula are as follows:
In formula, etFor the storing electricity of t period end battery energy storage system, EmaxAnd EminRespectively battery energy storage system
The physics bound of storing electricity；
By equivalent transformation, by (1), (2), (3), (5), (7), (13) formula constitutes the scheduling mould of battery energy storage system
Type；
E, the Dynamic Programming reverse recursion stage obtains according to dynamic programming principle
In formula, ft(et) be from t-th of scheduling slot end to finishing scheduling when maximum return, set fT(ET)=0, will be electric
(14) are brought in the electric quantity balancing constraint (2) of pond energy-storage system into, obtain the Dynamic Programming cost- for needing to solve repeatedly in each period
To-go function:
(15) formula is by (2) in solution procedure, and (3), (5), (15) formula is defined as moving by the constraint of (7) and (13) formula
State plans reverse recursion stage center center problem, and the Optimized model of the core subproblem is by (2), (3), (5), (7), (13) and
(15) formula is constituted；
F, substitution of variable is carried out to (15) formula, by decision content qt+1It is expressed as x, etIt is expressed as y, maximum return ft(et) indicate
For h (x), while by ft+1(et-Lt+1-qt+1) translation Lt+1It obtains function g (y-x), core in the Dynamic Programming reverse recursion stage
The Optimized model equivalent transformation of subproblem is；
In formula, a and b respectively indicate the t+1 period discharge and recharge q determined jointly by (3) and (5) formulat+1Bound, c
The t period end battery energy storage system day part storing electricity e determined jointly by (7) and (13) formula is respectively indicated with dtUp and down
Limit, according to (2) formula, α and β actually respectively indicate battery energy storage system in the bound of t+1 period end storing electricity；
According to the geometric meaning of (16) formula, domain is split into several sons by the segmentation bend line of function h (x) and g (y-x)
Region is able to demonstrate that optimal value must be in boundary in each parallelogram or similar to the subregion of parallelogram
It obtains, functional value is all linear change relative to parameter x, i.e. segmentation turning point of the straight line where boundary about functional value
It can obtain in the endpoint of parallelogram subregion, be arranged the endpoint of each parallelogram subregion according to each endpoint y value
The feasible zone of problem is divided into N number of horizontal subregion by sequence, the horizontal line where adjacent endpoint, successively from lower n=1 to upper n=N
Find optimal path in each horizontal subregion；
G, horizontal subregion optimal path solves, and since n=1, has 90 ° of vertical lines of L item and 45 ° in horizontal subregion tiltedly
Line, corresponding is the segmentation bend line of function h (x) He g (y-x), solves this these segmentation bend line and horizontal subregion
Up-and-down boundary intersection point functional value is respectively zl(yu) and zl(yd), find lower boundary functional value maximum point zl'(yd) and corresponding road
Diameter l' judges the functional value z of these paths and coboundary intersection pointl'(yu) whether be all coboundary intersection point functional values maximum
Point executes step H if it is not, then the jump of optimal path occurs in the area in explanation；If it is, the paths
It is the maximum path in this horizontal subregion, judges whether n > N, if it is, t period core subproblem solves process knot
Beam executes step I if it is not, then setting n=n+1 and continues to solve the optimal road for closing on subregion above the horizontal subregion
Diameter；
H, optimal path jump refers to that the maximum point of the functional value of lower boundary is risen by initial optimal path, and at certain
Jumped at turning point an other optimal path continue rise then reach the maximum point of upper boundary function value, using l' as
Reference path initializes l'=l's, s=1, calculate earliest with the intersection point and slope of l' intersecting paths, obtain its intersecting paths
l's+1Turning point coordinate (ys+1, zl's+1(ys+1)) and l's+1With the functional value z of coboundary intersection pointl's+1(yu), judge zl's+1
(yu) it whether is coboundary maximum value, if it is not, s=s+1 is enabled, it will be by l's+1As new reference path, H is re-executed；
If it is, exporting each turning point coordinate (ys+1, zl's+1(ys+1)) and zl'(yd),zl's(yu) value, obtain optimal path l's, s
=1,2 ..., S, the horizontal subregion optimal path solution terminate, and judge whether n > N, if it is, t period core is asked
Topic, which solves process, to be terminated, and is executed step I and is continued to solve above the horizontal subregion and close on son if it is not, then setting n=n+1
The optimal path in region；
I, t=t-1 is set, if judgement t > 0, returns to step E, continues the core subproblem for solving the t period, if t
=0, execute step J；
J, the Dynamic Programming forward recursive stage enablesTo t=1,2 ..., T is successively calculated:
In formula, qt *For the optimal charge/discharge electricity amount of battery energy storage system t period,For the battery energy storage system of t period
The optimal storage electricity of system, LtFor the dead loss electricity of known t period battery energy storage system；Solve (17) formula when by
(3)-(6) formula constraint, according to dynamic programming principle, solve (3)-(6) and maximization problem acquisition that (17) formula defines from the 1st
The discharge and recharge decision of the battery energy storage system of period to T periodAnd corresponding charge-discharge electric powerIt is exactly
The optimal solution of battery energy storage system scheduling problem；
J, development enters subsequent period at any time, updates the initial storage electricity of battery energy storage system in step B, scheduling knot
Target storing electricity, the constraint of day part electricity volume and timesharing forecasted electricity market price or equivalent value multiplier when beam, continue to hold
Row step C.
Compared to the prior art compared with the present invention has following advantage:
The present invention has carried out point the nonlinear efficiency for charge-discharge characteristic curve of battery energy storage system when establishing model
Section linearisation, establishes mixed integer linear programming model, more more accurate than traditional model；In addition, solving MIXED INTEGER
Generally all it can only just can be carried out Efficient Solution using commercial packages such as CPLEX when linear programming model, first choice of the present invention passes through
Step D calculates the dynamic bound constraint of battery energy storage system day part storing electricity, reduces the feasible zone range of understanding, reduces
Solve the time；Secondly, the geometry characteristic for the core subproblem for needing to solve repeatedly for Dynamic Programming in step F, In
Proposed in step G and step H can Efficient Solution, while can fully ensure that the fining of the numerical stability of calculating process
Algorithm, so that business software can be substituted when solving this kind of battery energy storage system scheduling problem.
Detailed description of the invention
Fig. 1 is entire dispatching algorithm flow chart.
Fig. 2 is cell discharge efficiency-power curve.
Fig. 3 is the geometry feature of dynamic programming algorithm center center problem.
Fig. 4 is processing " optimal path jump " submethod schematic diagram.
Fig. 5 is processing " optimal path jump " submethod algorithm flow chart.
Specific embodiment
The present invention is intended to provide a kind of battery energy storage system dispatching method for considering dynamic efficiency for charge-discharge characteristic, it can basis
The market guidance of battery energy storage self-characteristic, operation constraint and prediction formulates battery energy storage system operation in following a period of time
Optimizing decision improves running efficiency of system and operation income so that battery energy storage system be instructed to run.
The embodiment and whole flow process of the dispatching method in 1 pair of invention are described further with reference to the accompanying drawing.
A kind of battery energy storage system dispatching method considering dynamic efficiency for charge-discharge can formulate energy storage electricity with this method
The optimization operational decisions of cell system, improve the performance driving economy of battery energy storage system, method includes the following steps:
A, the limitation of capacity, dynamic efficiency for charge-discharge, charge-discharge electric power and the battery energy storage system of battery energy storage system are determined
Capacity bound carries out piece-wise linearization, root to charge-discharge electric power-relationship between efficiency figure of battery energy storage system referring to attached drawing 2
Suitable segments is selected according to required precision.
B, target storing electricity, day part when obtaining initial storage electricity, the finishing scheduling of battery energy storage system are surfed the Internet
Constraint and timesharing forecasted electricity market price or equivalent value multiplier.
C, the scheduling model of battery energy storage system is established, when the optimization aim of scheduling model is that formulation battery energy storage system is each
Section charge-discharge electric power decision, maximizes total gene-ration revenue of battery energy storage system, the objective function of model are as follows:
In formula, T is scheduling slot sum, and t is scheduling slot number, λtFor the forecasted electricity market price or equivalent value of t period
Multiplier, qtFor the charge/discharge electricity amount of the battery energy storage system of t period, discharges for positive value, be charged as negative value, p (qt) the t period
Battery charging and discharging power, be qtUnitary piecewise linear function, δ be scheduling slot length.
Scheduling model constraint condition includes:
1) the electric quantity balancing constraint of battery energy storage system
E in formulatFor the storing electricity of t period end battery energy storage system, LtFor known t period battery energy storage system
Storage dead loss electricity, be negative value.
2) electricity volume constrains
In formulaWithThe respectively electricity volume bound of t period battery energy storage system.
3) the charge-discharge electric power constraint of battery energy storage system
P in formulamaxAnd PminThe respectively upper physical limit of battery energy storage system discharge power and charge power, function p are single
The piecewise linear function of tune, charge-discharge electric power constraint (4) can be converted to the constraint of discharge and recharge:
Function p' is the inverse function of function p, p'(P in formulamax) and p'(Pmin) it is respectively battery energy storage system discharge electricity amount
With the upper physical limit of charge capacity.
4) electricity (SOC) constrains
E in formulamaxAnd EminThe respectively bound of the storing electricity of battery energy storage system.
5) the first last Constraint of battery energy storage system
e0=E0,eT=ET (7)
E in formula0And ETTarget electricity when being battery energy storage system initial time electricity and finishing scheduling respectively, e0And eT
Respectively dispatch the storing electricity of the battery energy storage system of start time and T period Mo.
By (1), (2), (3), (5), (6), (7) formula constitutes the scheduling model of battery energy storage system.
D, the dynamic bound constraint for calculating battery energy storage system day part storing electricity, according to scheduling last battery energy storage system
Target storing electricity E when finishing scheduling of unitingT(2) and (5) are constrained with battery energy storage system day part storing electricity bound, are passed through
The reverse recursion since the T period calculates the dynamic bound of battery energy storage system day part storing electricity are as follows:
J is time variable in formula,WithThe respectively t period end battery energy storage system day part of reverse-direction derivation acquisition
The dynamic bound of storing electricity, ETThe target storing electricity of battery energy storage system, L when for finishing schedulingjWhen for known jth
The dead loss electricity of section battery energy storage system, p'(Pmax) and p'(Pmin) it is respectively battery energy storage system discharge electricity amount and charging
The upper physical limit of electricity,WithThe respectively bound of jth period battery energy storage system electricity volume.
According to the initial quantity of electricity E of battery energy storage system0(2) are constrained with battery energy storage system day part storing electricity bound
(5), the period carries out forward recursive since scheduling, calculates the dynamic bound of battery energy storage system day part storing electricity
Are as follows:
J is time variable in formula,WithWhen the battery energy storage system of the respectively positive t period Mo for deriving acquisition is each
The dynamic bound of section storing electricity, E0The storing electricity of battery energy storage system, L when starting for schedulingjFor the known jth period
The dead loss electricity of battery energy storage system is negative value, p'(Pmax) and p'(Pmin) it is respectively battery energy storage system discharge electricity amount
With the upper physical limit of charge capacity,WithThe respectively bound of jth period battery energy storage system electricity volume.
Forward direction is derived and reverse-direction derivation result combines, calculates the dynamic bound of the storing electricity of battery energy storage system
Are as follows:
In formulaWithe tIt respectively calculates in the dynamic of battery energy storage system day part storing electricity of the t period of acquisition
Lower limit obtains the bound of new battery energy storage system day part storing electricity in conjunction with (6) formula are as follows:
In formula, etFor the storing electricity of t period end battery energy storage system, EmaxAnd EminRespectively battery energy storage system
The physics bound of storing electricity；
By equivalent transformation, by (1), (2), (3), (5), (7), (13) formula constitutes the scheduling mould of battery energy storage system
Type.
E, the Dynamic Programming reverse recursion stage obtains according to dynamic programming principle
F in formulat(et) be from t-th of scheduling slot end to finishing scheduling when maximum return.Set fT(ET)=0, by battery
(14) are brought in the electric quantity balancing constraint (2) of energy-storage system into, obtain the Dynamic Programming cost- for needing to solve repeatedly in each period
To-go function:
(15) formula is by (2) in solution procedure, and (3), (5), (15) formula is defined as moving by the constraint of (7) and (13) formula
State plans reverse recursion stage center center problem, and the Optimized model of the core subproblem is by (2), (3), (5), (7), (13) and
(15) formula is constituted.
F, substitution of variable is carried out to (15) formula, by decision content qt+1It is expressed as x, etIt is expressed as y, maximum return ft(et) indicate
For h (x), while by ft+1(et-Lt+1-qt+1) translation Lt+1It obtains function g (y-x), core in the Dynamic Programming reverse recursion stage
The Optimized model equivalent transformation of subproblem are as follows:
In formula, a and b respectively indicate the t+1 period discharge and recharge q determined jointly by (3) and (5) formulat+1Bound, c
The t period end battery energy storage system day part storing electricity e determined jointly by (7) and (13) formula is respectively indicated with dtUp and down
Limit, according to (2) formula, α and β actually respectively indicate battery energy storage system in the bound of t+1 period end storing electricity.
Referring to attached drawing 3, according to the geometric meaning of core subproblem Optimized model, the segmentation bend line of function h (x) is x=
xθ, θ=1,2,3... Φ, Φ are that function h (x) is segments, 90 ° of numerical value chain-dotted lines in corresponding diagram；The segmentation of g (y-x) turns
Broken line is y-x=ρν, v=1,2,3.....V, V are the segments of function g (y-x), the empty oblique line of 45 ° in corresponding diagram.Function h
(x) and domain is split into several subregions by the segmentation bend line of g (y-x), in each parallelogram or is similar to parallel
The subregion of quadrangle is able to demonstrate that optimal value must be obtained in boundary, and functional value is all linearly to become relative to parameter x
Change, i.e., straight line where boundary can only be obtained about the segmentation turning point of functional value in the endpoint of parallelogram subregion, root
The endpoint of each parallelogram subregion is ranked up according to each endpoint y value, the horizontal line where adjacent endpoint can by problem
Row domain is divided into N number of horizontal subregion, and optimal path in each horizontal subregion is successively found from lower n=1 to upper n=N.
G, horizontal subregion optimal path solves, and referring to attached drawing 4, since n=1,90 ° of L item is shared in horizontal subregion
Vertical line and 45 ° of oblique lines, corresponding is the segmentation bend line of function h (x) He g (y-x), solves this these segmentation bend line
Z is distinguished with horizontal subregion up-and-down boundary intersection point functional valuel(yu) and zl(yd), find lower boundary functional value maximum point zl'(yd)
And corresponding path l', judge the functional value z of these paths and coboundary intersection pointl'(yu) it whether is all coboundary intersection point functions
The maximum point of value executes step H if it is not, then the jump of optimal path occurs in the area in explanation；If it is,
The paths are the maximum paths in this horizontal subregion, judge whether n > N, if it is, t period core subproblem is asked
Solution process terminates, and executes step I and continues to solve above the horizontal subregion and close on subregion if it is not, then setting n=n+1
Optimal path.
H, optimal path jump refers to that the maximum point of the functional value of lower boundary is risen by initial optimal path, and at certain
Jumped at turning point an other optimal path continue rise then reach the maximum point of upper boundary function value；Referring to attached drawing
5, the thought for handling optimal path " jump " method is illustrated by a simple case: upper following in recording level subregion respectively
The functional value of boundary and all l paths intersection points is respectively zl(yu) and zl(yd), it can obtain corresponding in zoy plane upper pathway l
Linear function zl(y), from the maximum a point of lower boundary functional value, the l before intersecting with other paths1For optimal path, and
When itself and path l3Intersection is after b point, due to l3Climbing speed be greater than former optimal path l1, therefore the optimal road since b point
Diameter becomes l3, similarly become l again in c point optimal path4Until reaching the maximum d point of upper boundary function value；Detailed calculation process ginseng
See attached drawing 4, using l' as reference path, initializes l'=l's, s=1, calculate earliest with the intersection point and slope of l' intersecting paths,
Obtain its intersecting paths l's+1Turning point coordinate (ys+1, zl's+1(ys+1)) and l's+1With the functional value of coboundary intersection point
zl's+1(yu), judge zl's+1(yu) it whether is coboundary maximum value, if it is not, s=s+1 is enabled, it will be by l's+1As new base
Quasi- path, re-executes H；If it is, exporting each turning point coordinate (ys+1, zl's+1(ys+1)) and zl'(yd),zl's(yu) value,
Obtain optimal path l's, s=1,2 ..., S, which, which solves, terminates, judge whether n > N, if so,
Then t period core subproblem solves process and terminates, and executes step I and continues to solve the level if it is not, then setting n=n+1
The optimal path for closing on subregion above subregion.
I, t=t-1 is set, if judgement t > 0, returns to step E, continues the core subproblem for solving the t stage, if t
=0, execute step J；
J, the Dynamic Programming forward recursive stage enablesTo t=1,2 ..., T is successively calculated:
In formula, qt *For the optimal charge/discharge electricity amount of battery energy storage system t period,For the battery energy storage system of t period
The optimal storage electricity of system, LtFor the dead loss electricity of known t period battery energy storage system；Solve (17) formula when by
(3)-(6) formula constraint, according to dynamic programming principle, solve (3)-(6) and maximization problem acquisition that (17) formula defines from the 1st
The discharge and recharge decision of the battery energy storage system of period to T periodAnd corresponding charge-discharge electric powerIt is exactly
The optimal solution of battery energy storage system scheduling problem.
J, development enters subsequent period at any time, updates the initial storage electricity of battery energy storage system in step B, scheduling knot
Target storing electricity, the constraint of day part electricity volume and timesharing forecasted electricity market price or equivalent value multiplier when beam, continue to hold
Row step C.
Claims (1)
1. a kind of battery energy storage system dispatching method for considering dynamic efficiency for charge-discharge, it is characterised in that: can with this method
The optimization operational decisions for formulating battery energy storage system, improve the performance driving economy of battery energy storage system, this method includes following step
It is rapid:
A, the limitation of capacity, dynamic efficiency for charge-discharge, charge-discharge electric power and the battery energy storage system capacity of battery energy storage system are determined
Bound, according to the required precision of scheduling select suitable segments to charge-discharge electric power-relationship between efficiency of battery energy storage system into
Row piece-wise linearization；
B, the target storing electricity when initial storage electricity of acquisition battery energy storage system, finishing scheduling, day part electricity volume
Constraint and timesharing forecasted electricity market price or equivalent value multiplier；
C, the scheduling model of battery energy storage system is established, the optimization aim of scheduling model is to formulate battery energy storage system day part to fill
Discharge power decision maximizes total gene-ration revenue of battery energy storage system, the objective function of scheduling model are as follows:
In formula, T is scheduling slot sum, and t is scheduling slot number, λtMultiply for the forecasted electricity market price or equivalent value of t period
Son, qtFor the charge/discharge electricity amount of the battery energy storage system of t period, discharges for positive value, be charged as negative value, p (qt) the t period
The charge-discharge electric power of battery energy storage system is qtUnitary piecewise linear function, δ be scheduling slot length；
The constraint condition of scheduling model includes:
1) the electric quantity balancing constraint of battery energy storage system
In formula, etFor the storing electricity of t period end battery energy storage system, LtFor consolidating for known t period battery energy storage system
Setting loss power loss amount is negative value；
2) electricity volume constrains
In formula,WithThe respectively electricity volume bound of t period battery energy storage system；
3) the charge-discharge electric power constraint of battery energy storage system
In formula, PmaxAnd PminThe respectively upper physical limit of battery energy storage system discharge power and charge power, function p are dull
Piecewise linear function, charge-discharge electric power constraint (4) can be converted to the constraint of discharge and recharge:
In formula, function p' is the inverse function of function p, p'(Pmax) and p'(Pmin) it is respectively battery energy storage system discharge electricity amount and to fill
The upper physical limit of power consumption；
4) electricity SOC is constrained
In formula, EmaxAnd EminThe respectively bound of the storing electricity of battery energy storage system；
5) the first last Constraint of battery energy storage system
e0=E0,eT=ET (7)
In formula, E0And ETTarget electricity when being battery energy storage system initial time electricity and finishing scheduling respectively, e0And eTRespectively
For the storing electricity of the battery energy storage system of scheduling start time and T period Mo；
By (1), (2), (3), (5), (6), (7) formula constitutes the scheduling model of battery energy storage system；
D, the dynamic bound constraint for calculating battery energy storage system day part storing electricity, according to the last battery energy storage system tune of scheduling
Target storing electricity E at the end of degreeT(2) and (5) are constrained with battery energy storage system day part storing electricity bound, by from T
Period starts reverse recursion, calculates the dynamic bound of battery energy storage system day part storing electricity are as follows:
In formula, j is time variable,WithThe t period end battery energy storage system day part that respectively reverse-direction derivation obtains is deposited
The dynamic bound of reserve of electricity, ETThe target storing electricity of battery energy storage system, L when for finishing schedulingjFor the known jth period
The dead loss electricity of battery energy storage system is negative value, p'(Pmax) and p'(Pmin) it is respectively battery energy storage system discharge electricity amount
With the upper physical limit of charge capacity,WithThe respectively bound of jth period battery energy storage system electricity volume；
According to the initial quantity of electricity E of battery energy storage system0With battery energy storage system day part storing electricity bound constraint (2) and
(5), the period carries out forward recursive since scheduling, calculates the dynamic bound of battery energy storage system day part storing electricity
Are as follows:
In formula, j is time variable,WithThe respectively positive battery energy storage system day part for deriving the t period Mo obtained
The dynamic bound of storing electricity, E0The storing electricity of battery energy storage system, L when starting for schedulingjFor known jth period electricity
The dead loss electricity of pond energy-storage system, p'(Pmax) and p'(Pmin) it is respectively battery energy storage system discharge electricity amount and charge capacity
Upper physical limit,WithThe respectively bound of jth period battery energy storage system electricity volume；
Forward direction is derived and reverse-direction derivation result combines, calculates the dynamic bound of the storing electricity of battery energy storage system are as follows:
In formula,Withe tRespectively calculate the dynamic of battery energy storage system day part storing electricity of the t period of acquisition or more
Limit, in conjunction with (6) formula, obtains the bound of new battery energy storage system day part storing electricity are as follows:
In formula, etFor the storing electricity of t period end battery energy storage system, EmaxAnd EminThe respectively storage of battery energy storage system
The physics bound of electricity；
By equivalent transformation, by (1), (2), (3), (5), (7), (13) formula constitutes the scheduling model of battery energy storage system；
E, the Dynamic Programming reverse recursion stage obtains according to dynamic programming principle
In formula, ft(et) be from t-th of scheduling slot end to finishing scheduling when maximum return, set fT(ET)=0, by battery energy storage
(14) are brought in the electric quantity balancing constraint (2) of system into, obtain the Dynamic Programming cost-to-go for needing to solve repeatedly in each period
Function:
(15) formula is by (2) in solution procedure, and (3), (5), (15) formula is defined as dynamic and advised by the constraint of (7) and (13) formula
Reverse recursion stage center center problem is drawn, the Optimized model of the core subproblem is by (2), (3), (5), (7), (13) and (15)
Formula is constituted；
F, substitution of variable is carried out to (15) formula, by decision content qt+1It is expressed as x, etIt is expressed as y, maximum return ft(et) it is expressed as h
(x), while by ft+1(et-Lt+1-qt+1) translation Lt+1It obtains function g (y-x), Dynamic Programming reverse recursion stage center center is asked
The Optimized model equivalent transformation of topic is；
In formula, a and b respectively indicate the t+1 period discharge and recharge q determined jointly by (3) and (5) formulat+1Bound, c and d
Respectively indicate the t period end battery energy storage system day part storing electricity e determined jointly by (7) and (13) formulatBound,
According to (2) formula, α and β actually respectively indicate battery energy storage system in the bound of t+1 period end storing electricity；
According to the geometric meaning of (16) formula, domain is split into several sub-districts by the segmentation bend line of function h (x) and g (y-x)
Domain is able to demonstrate that optimal value must be taken in boundary in each parallelogram or similar to the subregion of parallelogram
, functional value is all linear change relative to parameter x, i.e., straight line where boundary can only about the segmentation turning point of functional value
It obtains in the endpoint of parallelogram subregion, is ranked up the endpoint of each parallelogram subregion according to each endpoint y value,
The feasible zone of problem is divided into N number of horizontal subregion by the horizontal line where adjacent endpoint, is successively sought from lower n=1 to upper n=N
Look for optimal path in each horizontal subregion；
G, horizontal subregion optimal path solves, and since n=1, there is 90 ° of vertical lines of L item and 45 ° of oblique lines in horizontal subregion,
Corresponding is the segmentation bend line of function h (x) He g (y-x), solves this these segmentation bend line and horizontal subregion or more
Boundary intersection functional value is respectively zl(yu) and zl(yd), find lower boundary functional value maximum point zl'(yd) and corresponding path l',
Judge the functional value z of these paths and coboundary intersection pointl'(yu) whether be all coboundary intersection point functional values maximum point, if
It is not then to illustrate the jump for occurring optimal path in the area, executes step H；If it is, the paths are this water
Maximum path in flat subregion, judges whether n > N, if it is, t period core subproblem, which solves process, to terminate, executes
Step I continues to solve the optimal path for closing on subregion above the horizontal subregion if it is not, then setting n=n+1；
H, optimal path jump refers to that the maximum point of the functional value of lower boundary is risen by initial optimal path, and in certain turnover
Point at jump to an other optimal path continue rise then reach the maximum point of upper boundary function value, using l' as benchmark
Path initializes l'=l's, s=1, calculate earliest with the intersection point and slope of l' intersecting paths, obtain its intersecting paths l's+1's
Turning point coordinate (ys+1, zl's+1(ys+1)) and l's+1With the functional value z of coboundary intersection pointl's+1(yu), judge zl's+1(yu) be
No is coboundary maximum value, if it is not, s=s+1 is enabled, it will be by l's+1As new reference path, H is re-executed；If so,
Then export each turning point coordinate (ys+1, zl's+1(ys+1)) and zl'(yd),zl's(yu) value, obtain optimal path l's, s=1,
2 ..., S, S are optimal path sum, which terminates, and judge whether n > N, if it is, t
Period core subproblem, which solves process, to terminate, and executes step I and continues to solve the horizontal subregion if it is not, then setting n=n+1
The optimal path for closing on subregion of top；
I, t=t-1 is set, if judgement t > 0, returns to step E, continues the core subproblem for solving the t period, if t=0,
Execute step J；
J, the Dynamic Programming forward recursive stage enablesTo t=1,2 ..., T is successively calculated:
In formula, qt *For the optimal charge/discharge electricity amount of battery energy storage system t period,For the battery energy storage system of t period
Optimal storage electricity, LtFor the dead loss electricity of known t period battery energy storage system；By (3)-when (17) formula of solution
(6) formula constrains, according to dynamic programming principle, solve (3)-(6) and maximization problem acquisition that (17) formula defines from the 1st period
To the discharge and recharge of the battery energy storage system of T periodAnd corresponding charge-discharge electric powerIt is exactly battery energy storage
The optimal solution of system call problem；
J, development enters subsequent period at any time, when updating the initial storage electricity of battery energy storage system, finishing scheduling in step B
Target storing electricity, the constraint of day part electricity volume and timesharing forecasted electricity market price or equivalent value multiplier, continue to execute step
Rapid C.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910778785.8A CN110504701B (en) | 2019-08-22 | 2019-08-22 | Battery energy storage system scheduling method considering dynamic charge-discharge efficiency |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910778785.8A CN110504701B (en) | 2019-08-22 | 2019-08-22 | Battery energy storage system scheduling method considering dynamic charge-discharge efficiency |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110504701A true CN110504701A (en) | 2019-11-26 |
| CN110504701B CN110504701B (en) | 2023-01-20 |
Family
ID=68588764
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910778785.8A Active CN110504701B (en) | 2019-08-22 | 2019-08-22 | Battery energy storage system scheduling method considering dynamic charge-discharge efficiency |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110504701B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110880777A (en) * | 2019-12-20 | 2020-03-13 | 国电南瑞科技股份有限公司 | Method and device for evaluating emergency peak regulation standby capacity of energy storage at power grid side |
| CN114565164A (en) * | 2022-03-03 | 2022-05-31 | 国网江苏综合能源服务有限公司 | Three-stage optimization method and system for scheduling mixed integer programming in energy storage day ahead |
| CN116388334A (en) * | 2023-04-14 | 2023-07-04 | 云储新能源科技有限公司 | Reconfigurable battery energy storage system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102968098B (en) * | 2012-11-05 | 2014-12-10 | 清华大学 | Distributed optimization method of charging power of electric automobiles in aggregator |
| CN106684898A (en) * | 2016-10-31 | 2017-05-17 | 国电南瑞科技股份有限公司 | Value network-based scheduling optimization method of energy storage system |
| CN106684916A (en) * | 2017-02-16 | 2017-05-17 | 上海电力学院 | Operation optimization method of grid-connected photovoltaic system with storage battery |
| CN107482679A (en) * | 2017-08-25 | 2017-12-15 | 河海大学 | Consider the active distribution network Optimization Scheduling a few days ago of energy-storage system discharge and recharge number |
| US20180358812A1 (en) * | 2017-05-05 | 2018-12-13 | The Board Of Trustees Of The Leland Stanford Junior University | Systems and Methods for Coordinating Distributed Energy Storage |
-
2019
- 2019-08-22 CN CN201910778785.8A patent/CN110504701B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102968098B (en) * | 2012-11-05 | 2014-12-10 | 清华大学 | Distributed optimization method of charging power of electric automobiles in aggregator |
| CN106684898A (en) * | 2016-10-31 | 2017-05-17 | 国电南瑞科技股份有限公司 | Value network-based scheduling optimization method of energy storage system |
| CN106684916A (en) * | 2017-02-16 | 2017-05-17 | 上海电力学院 | Operation optimization method of grid-connected photovoltaic system with storage battery |
| US20180358812A1 (en) * | 2017-05-05 | 2018-12-13 | The Board Of Trustees Of The Leland Stanford Junior University | Systems and Methods for Coordinating Distributed Energy Storage |
| CN107482679A (en) * | 2017-08-25 | 2017-12-15 | 河海大学 | Consider the active distribution network Optimization Scheduling a few days ago of energy-storage system discharge and recharge number |
Non-Patent Citations (2)
| Title |
|---|
| JIE YANG: "Optimal Dispatching Strategy for Shared Battery Station of Electric Vehicle by Divisional Battery Contro", 《IEEE ACCESS》 * |
| 文乐: "并网型多能互补系统优化规划方法", 《热力发电》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110880777A (en) * | 2019-12-20 | 2020-03-13 | 国电南瑞科技股份有限公司 | Method and device for evaluating emergency peak regulation standby capacity of energy storage at power grid side |
| CN114565164A (en) * | 2022-03-03 | 2022-05-31 | 国网江苏综合能源服务有限公司 | Three-stage optimization method and system for scheduling mixed integer programming in energy storage day ahead |
| CN114565164B (en) * | 2022-03-03 | 2024-02-06 | 国网江苏综合能源服务有限公司 | Three-stage optimization method and system for scheduling mixed integer programming before energy storage day |
| CN116388334A (en) * | 2023-04-14 | 2023-07-04 | 云储新能源科技有限公司 | Reconfigurable battery energy storage system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110504701B (en) | 2023-01-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105846423B (en) | It is a kind of meter and demand response photovoltaic micro energy storage multiple target capacity collocation method | |
| CN110504701A (en) | A kind of battery energy storage system dispatching method considering dynamic efficiency for charge-discharge | |
| CN107565607B (en) | Micro-grid multi-time scale energy scheduling method based on real-time electricity price mechanism | |
| CN107394802A (en) | Distributed energy storage participates in the control method for coordinating of Automatic Generation Control | |
| CN108710992A (en) | A kind of demand response participates in the appraisal procedure of power grid peak load shifting effect | |
| CN108596667B (en) | Electric automobile real-time charging electricity price calculation method based on Internet of vehicles | |
| CN109217290A (en) | Meter and the microgrid energy optimum management method of electric car charge and discharge | |
| CN110176765A (en) | A kind of energy storage peak shaving of time-of-use tariffs driving Optimization Scheduling a few days ago | |
| CN110086187A (en) | The energy storage peak shaving Optimization Scheduling a few days ago of meter and part throttle characteristics | |
| CN111064214A (en) | Power distribution network optimal scheduling method based on electric vehicle two-stage rolling strategy | |
| CN104103020B (en) | Consider the method for the determination power system peak regulation battery energy storage capacity of variable life characteristic | |
| CN103336998A (en) | Optimization calculation method of wind power plant power fluctuation stabilization target value | |
| CN116388245A (en) | Method for configuring energy storage capacity of optical storage and charging integrated power station and related equipment | |
| CN116470543A (en) | Operation control method, device, equipment and medium of virtual power plant | |
| CN110649638B (en) | Optimization method of energy storage system for compensating wind power prediction error | |
| CN113690875A (en) | Micro-grid real-time interaction equivalent model establishing method | |
| CN107016504A (en) | It is a kind of to count and the optimizing scheduling modeling of electric automobile Random-fuzzy demand response and algorithm | |
| CN117254464A (en) | Control method and system of energy storage system | |
| CN105659464B (en) | Accumulator control device | |
| CN110110929A (en) | A kind of resource distribution of electric charging station and electric charging combined dispatch optimization method | |
| CN115983442A (en) | Decision optimization method for pumped storage power station participating in spot-frequency modulation auxiliary service market | |
| CN107332262B (en) | Energy optimization management method for multi-type mixed energy storage | |
| CN114330999A (en) | Virtual power grid resource matching method based on cloud energy storage system | |
| CN113437757A (en) | Electric quantity decomposition method of wind-storage combined system based on prospect theory | |
| CN108599248B (en) | Startup plan iteration optimization method based on cost performance ratio index of regulation and control measure |
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 |