CN104734200A - Initiative power distribution network scheduling optimizing method based on virtual power generation - Google Patents

Initiative power distribution network scheduling optimizing method based on virtual power generation Download PDF

Info

Publication number
CN104734200A
CN104734200A CN201510137591.1A CN201510137591A CN104734200A CN 104734200 A CN104734200 A CN 104734200A CN 201510137591 A CN201510137591 A CN 201510137591A CN 104734200 A CN104734200 A CN 104734200A
Authority
CN
China
Prior art keywords
represent
conventional power
power unit
unit
demand
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
Application number
CN201510137591.1A
Other languages
Chinese (zh)
Other versions
CN104734200B (en
Inventor
赵明欣
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Corp of China SGCC
China Electric Power Research Institute Co Ltd CEPRI
Yantai Power Supply Co of State Grid Shandong Electric Power Co Ltd
Original Assignee
State Grid Corp of China SGCC
China Electric Power Research Institute Co Ltd CEPRI
Yantai Power Supply Co of State Grid Shandong Electric Power Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by State Grid Corp of China SGCC, China Electric Power Research Institute Co Ltd CEPRI, Yantai Power Supply Co of State Grid Shandong Electric Power Co Ltd filed Critical State Grid Corp of China SGCC
Priority to CN201510137591.1A priority Critical patent/CN104734200B/en
Publication of CN104734200A publication Critical patent/CN104734200A/en
Application granted granted Critical
Publication of CN104734200B publication Critical patent/CN104734200B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Supply And Distribution Of Alternating Current (AREA)

Abstract

The invention discloses an initiative power distribution network scheduling optimizing method based on virtual power generation. The initiative power distribution network scheduling optimizing method includes the following steps: 1, building a scheduling optimization objective function; 2, obtaining constraint conditions of the scheduling optimization objective function, wherein the constraint conditions include system load balance constraint, system spinning reserving constraint, conventional-unit and demand-side resource technology contributing constraint, conventional unit climbing constraint, conventional-unit minimum running time and minimum stopping time constraint, demand-side maximum continuous controlled time constraint and electricity use mode satisfaction constraint; 3, according to the scheduling optimization objective function and the constraint conditions, determining the starting-stopping states of all the units one period by one period with the disperse particle swarm optimization based on a heuristic rule; 4, after the starting-stopping states of all the units in all the periods are calculated, on the basis of the known starting-stopping states, economically distributing the units according to the constraint conditions. In this way, initiative power distribution network scheduling optimization is achieved.

Description

A kind of active distribution network Optimization Scheduling based on virtual generating
Technical field
The invention belongs to active distribution network Optimum Scheduling Technology field, more specifically, relate to a kind of active distribution network Optimization Scheduling based on virtual generating.
Background technology
The extensive access of distributed power source, flexible load and novel energy-storing system, and the extensive use of modern power electronic device in electrical network, make power distribution network all there occurs a series of change in system configuration and operational mode.Active distribution network is as the distribution network system of Comprehensive Control distributed energy (DG, flexible load and energy storage), in whole power distribution network aspect, distributed energy is managed, not only pay close attention to local from master control, the optimization simultaneously also paying close attention to the whole power distribution network overall situation is coordinated, and concentrates access to provide new approaches for solving the extensive of distributed energy.The cooperation of active distribution network source net lotus three, how effectively the schedulable resource of Generation Side, grid side and load side is coordinated in integration, thus obtain the optimum of safety, ecnomics and enviroment benefit, and realize safe and reliable, the high-quality and efficient operation of power distribution network, be the current problem needing solution badly.
Present stage active distribution network Optimized Operation research, be mostly that the scheduling for distributed power source, electric automobile and energy-storage system is studied, or separately for the research of Demand Side Response strategy.Have studied individually the wind electricity digestion model based on Demand Side Response and the mixed-integer programming model that establishes containing wind power system generation schedule a few days ago, and utilize ILOG/CPLEX business software to solve, lack the research of the synthesis optimizing and scheduling method to conventional power unit, distributed power source (mainly comprising wind-powered electricity generation, photovoltaic generation), Demand Side Response and user power utilization satisfaction.The present invention proposes the virtual generating of integrated use and active distribution network technology, and the demand response resource of load side is equivalent to virtual generation assets, and participates in power balance adjustment as virtual robot arm.Simultaneously according to the prediction curve of exerting oneself of wind-powered electricity generation and photovoltaic generation, in conjunction with conventional power unit, establish the Model for Multi-Objective Optimization of comprehensive distributed power source, Demand-side resource and conventional power unit, scheduling problem is converted into Optimization of Unit Commitment By Improved, and utilize the dual particle cluster algorithm after improving to solve.Example shows that this dispatching method can effectively reduce power distribution network generator operation cost and environmental pollution, and can effectively reduce load peak-valley difference on the basis meeting higher user power utilization mode satisfaction.
Summary of the invention
For above defect or the Improvement requirement of prior art, the invention provides a kind of active distribution network Optimization Scheduling based on virtual generating, its object is to use virtual generating thought that the demand response resource of load side is equivalent to virtual generation assets, participate in power balance as virtual robot arm to regulate, and utilize the dual particle swarm optimization of improvement to solve, realize distributing rationally of active distribution network resource, solve in active distribution network thus and consider conventional power unit simultaneously, distributed power source, when Demand Side Response and user power utilization satisfaction, optimize the technical problem that computational speed causes being difficult to carry out scheduling controlling fast more slowly.
The invention provides a kind of active distribution network Optimization Scheduling based on virtual generating, comprise the steps:
(1) Optimized Operation target function is set up; First object function F is set up for target so that systems generate electricity operating cost is minimum 1, set up the second objective function F so that pollutant emission total yield number is minimum for target 2;
(2) described Optimized Operation bound for objective function is obtained; Described constraints comprises: system loading Constraints of Equilibrium, system spinning reserve retrains, the technology of conventional power unit and Demand-side resource is exerted oneself and is limited, conventional power unit Climing constant, conventional power unit minimum running time and the constraint of minimum idle time, the maximum continuous controllable period of time constraint of Demand-side, power mode satisfaction retrains;
(3) Demand Side Response is equivalent to a virtual synchronous generator, according to described Optimized Operation target function and described constraints and by the start and stop state of all units of acquisition that carry out the period one by one based on the discrete particle cluster algorithm of heuristic rule;
(4) according to the start and stop state of all units, and by the continuous particle cluster algorithm based on heuristic rule, on the basis according to described constraints, economic allocation is carried out to each unit; And allocate exerting oneself of each unit according to the result of economic allocation and the final start and stop state of all each periods of unit and size of exerting oneself, realize active distribution network Optimized Operation.
Further, in step (1), described first object function is: min F 1 = Σ t = 1 T Σ i = 1 N G [ f i ( P Gi ( t ) ) × u i ( t ) + S i ( t ) × ( 1 - u i ( t - 1 ) ) × u i ( t ) ] + Σ t = 1 T f DR ( P DR ( t ) ) × u DR ( t ) ; Described second target function is: min F 2 = Σ t = 1 T Σ i = 1 N G g i ( P Gi ( t ) ) × u i ( t ) ;
Wherein, F 1represent systems generate electricity operating cost; T represents time dispatching cycle; N grepresent the total number of units of conventional power unit; f i(P gi(t))=A i× P gi(t) 2+ B i× P gi(t)+C i, f irepresent i-th conventional power unit operating cost; P girepresent the power output of i-th conventional power unit; S irepresent i-th conventional power unit start-up and shut-down costs; u i(t) and u i(t-1) the start and stop state of i-th unit current time and previous moment is represented respectively; f dRrepresent that Demand Side Response compensates total amount; f dR(P dR(t))=d dR× P dR(t), P dRrepresent Demand-side regulating power, i.e. virtual generated output; u dRt () represents the start and stop state of virtual generating current time; A i, B iand C irepresent the operational factor of i-th conventional power unit; S i ( t ) = Sh i T i , off , min ≤ T i , off ≤ T i , cs Sc i T i , off ≥ T i , cs , Sh irepresent i-th conventional power unit warm start cost; Sc irepresent i-th conventional power unit cold start-up cost; T i.off.minrepresent the minimum lasting idle time that i-th conventional power unit allows; T i.offrepresenting that i-th conventional power unit continued the time of shutting down before certain period, if be open state before this unit, is then 0; T i, csrepresent the cold start-up time of conventional power unit i; d dRfor Demand-side reduces the amount of money that every kilowatt hour electricity compensates; F 2represent pollutant emission total yield number; g i(P gi(t))=a i× P gi(t) 2+ b i× P gi(t)+c i, g irepresent the pollutant emission equivalent of i-th conventional power unit; a i, b iand c irepresent the disposal of pollutants coefficient of i-th conventional power unit.
Further, in step (2), described system loading Constraints of Equilibrium is wherein, N dGrepresent distributed power source species number; P dGjt () represents that jth kind distributed power source t is exerted oneself; P lt () represents the load power of t; Described system spinning reserve is constrained to Σ i = 1 N G u i ( t ) P Gi , max + P DR , max ≥ P L ( t ) + P RL ( t ) + Σ j = 1 N DG P DGj ( t ) , Wherein, P gi, maxrepresent that i-th maximum technology of conventional power unit is exerted oneself; P dR, maxrepresent that maximum available Demand-side regulates load; P rLexpression system spinning reserve demand; expression system is exert oneself uncertainty and the newly-increased reserve capacity of reply distributed power source, considers the uncertainty of distributed electrical source power 100% probability interval, P herein dGjbe jth kind distributed power source to exert oneself; The technology of described conventional power unit and Demand-side resource is exerted oneself and is restricted to P Gi , min ≤ P Gi ( t ) ≤ P Gi , max 0 ≤ P DR ( t ) ≤ P DR , max , P gi, min, P gi, maxrepresent that i-th minimum, maximum technology of conventional power unit is exerted oneself respectively; Described conventional power unit Climing constant is P i ( t ) - P i ( t - 1 ) ≤ r ui T P i ( t - 1 ) - P i ( t ) ≤ r di T , Wherein P i(t) and P i(t-1) power output of current time and previous moment i-th conventional power unit is represented respectively; r uiand r direpresent i-th conventional power unit power climbing speed and fall off rate respectively; Described conventional power unit minimum running time and minimum idle time are constrained to T i , on ≥ T i , on , min T i , off ≥ T i , off , min , Wherein, T i, onrepresent i-th conventional power unit continuous operating time; T i, offrepresent i-th conventional power unit continuous idle time; T i, on, minrepresent the minimum continuous working period that i-th conventional power unit allows; The maximum continuous controllable period of time of described Demand-side is constrained to T dR≤ T dR, max, wherein, T dRrepresent Demand-side controllable period of time; T dR, maxrepresent the maximum continuous controllable period of time that Demand-side allows; Described power mode satisfaction is constrained to m s ≥ m s , min m s = 1 - Σ t = 1 T | Δ q t | Σ t = 1 T q t ; Wherein m srepresent power mode satisfaction; m s, minrepresent the minimum power mode satisfaction allowed, represent in a dispatching cycle T, before and after optimizing each period electricity knots modification absolute value and; represent in a dispatching cycle T, power consumption total before optimizing.
Further, it is characterized in that, the discrete particle cluster algorithm based on heuristic rule described in step (3) is specially:
(3.1) each conventional power unit of initialization, Demand-side characterisitic parameter, system prediction payload and distributed power source predict size of exerting oneself;
(3.2) each Unit Commitment state of random initializtion, carry out particle rapidity and the location updating of given number of times (desirable 100 times) according to existing discrete particle group velocity renewal formula and location updating formula, complete the calculating of discrete particle cluster algorithm first period start and stop state;
In discrete particle cluster algorithm, required minimum continuous working period constraint to be processed, minimum lasting idle time constraint, the heuristic modification method of maximum continuous controllable period of time constraint employing are: after certain particle position upgrades, if certain unit operation or idle time do not meet given constraint, then the running status of this unit of forcibly changing makes it meet constraint.The heuristic modification method of system spinning reserve constraint is: first sort to bad order from good according to performance driving economy to each unit according to priority method, after certain particle position upgrades, if discontented pedal system spinning reserve constraint, then successively open off-duty unit from good to bad order by performance driving economy, until the constraint of system spinning reserve is satisfied;
Simultaneously, in order to avoid all units all operate near minimum load, adopt following heuristic correction: after certain particle position upgrades, if the minimum load limit value sum of the conventional power unit run all and equivalent virtual synchronous generator is greater than system loading and distributed power source and exerts oneself 0.9 times of difference of summation, then close to the sequence of good order the unit run from bad successively by performance driving economy, until above-mentioned inequality is satisfied, thus ensure the economic allocation of unit output further;
(3.3) when to determine in dispatching cycle total, hop count T (generally getting 24), repeats step (3.2) content, until complete the calculating of discrete particle cluster algorithm whole period start and stop state.Store the final start and stop state of each conventional power unit and equivalent each period of virtual synchronous generator group.
Further, the continuous particle cluster algorithm based on heuristic rule described in step (4) is specially:
(4.1) according to above-mentioned discrete particle cluster algorithm result, each conventional power unit of initialization and each period start and stop state information of equivalent virtual synchronous generator group.
(4.2) output distribution of random initializtion first period each conventional power unit and equivalent virtual synchronous generator group.Adopt existing continuous population speed more new formula and location updating formula carry out particle rapidity and the location updating of given number of times (desirable 100 times), complete continuous particle cluster algorithm first period each unit output economic allocation calculate.
In continuous particle cluster algorithm, the exert oneself heuristic modification method of exerting oneself of restriction and Climing constant of required technology to be processed is: after certain particle position upgrades, if certain unit output size is greater than this unit maximum output limit value and this unit output value of last period and this unit maximum unit time and climbs the smaller value of exerting oneself in sum, then this unit output is forced to be smaller value in above-mentioned two values; If certain unit output size is less than this unit minimum load limit value and this unit output value of last period and this unit maximum unit time and declines higher value in the difference of exerting oneself, then this unit output is forced to be higher value in above-mentioned two values.The heuristic modification method of user power utilization mode satisfaction constraint is: after certain particle position upgrades, if the constraint of user power utilization mode satisfaction does not meet, then forces exerting oneself until meet the constraint of user power utilization mode satisfaction of the equivalent virtual synchronous generator of reduction.
System loading Constraints of Equilibrium adopts Means of Penalty Function Methods process.Processing method is: constraints is converted into penalty function, by penalty factor, penalty function and target function is combined the calculating that the fitness function becoming new participates in algorithm.If constraints does not meet, then the functional value of penalty function is a positive number; If constraints meets, then the functional value of penalty function is 0.
(4.3) repeat step (4.2) content, to exert oneself the calculating of economic allocation until complete each conventional power unit of continuous particle cluster algorithm whole period and equivalent virtual synchronous generator group.Discrete particle cluster algorithm tries to achieve the size of exerting oneself that the final start and stop state of each conventional power unit and equivalent each period of virtual synchronous generator group and continuous particle cluster algorithm try to achieve each conventional power unit and equivalent each period of virtual synchronous generator group, being the final result of Unit Combination, is also Optimized Operation result of the present invention.
In general, the above technical scheme conceived by the present invention compared with prior art, has following beneficial effect:
(1) virtual generating thought is adopted, Demand-side resource is equivalent to virtual generation assets, system power balance adjustment is jointly participated in conventional power unit, distributed power source, traditional Optimal Scheduling is converted into Optimization of Unit Commitment problem, conveniently effectively can carries out unified allocation of resources to Demand-side resource.Example shows that this dispatching method can effectively reduce system cost and environmental pollution, can also meet higher user power utilization satisfaction simultaneously.
(2) the dual particle cluster algorithm of improvement is adopted, compensate for the shortcoming that single continuous particle cluster algorithm is difficult to determine 2 state of value of Unit Commitment, this algorithm is by discrete particle cluster and continuous population decoupling zero simultaneously, adopts the method calculated by the period, solving speed is accelerated greatly.The various heuristic correction added in algorithm can make the solution of gained meet all constraints completely, the introducing of critical operator ensure that particle upgrades towards more excellent direction not losing multifarious while, thus ensureing that algorithm is while meeting high accuracy, solving speed is able to effective raising.
Accompanying drawing explanation
Fig. 1 is the active distribution network Optimized Operation principle schematic of the embodiment of the present invention;
Fig. 2 is that the utilization of the embodiment of the present invention improves dual particle swarm optimization and is optimized scheduling schematic diagram;
Fig. 3 is the discrete particle cluster algorithm flow chart based on heuristic rule of the embodiment of the present invention;
Fig. 4 is the continuous particle cluster algorithm flow chart based on heuristic rule of the embodiment of the present invention;
Fig. 5 is the wind power generation prediction curve that the embodiment of the present invention provides;
Fig. 6 is that desirable photovoltaic that the embodiment of the present invention provides is exerted oneself prediction curve;
Fig. 7 is the system total load curve that the embodiment of the present invention provides;
Fig. 8 is system loading curve comparison figure before and after the optimization that provides of the embodiment of the present invention.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.In addition, if below in described each execution mode of the present invention involved technical characteristic do not form conflict each other and just can mutually combine.
The virtual generating that the embodiment of the present invention proposes refers to using regulatable Demand-side resource as system reserve power supply, when network load value is higher, suitably reduces the electricity consumption of this type of resource, and carries out corresponding valence compensation to user.Be equivalent to increase energy output owing to reducing load, and compensate electricity price and be equivalent to cost of electricity-generating, therefore this type of Demand-side resource can be equivalent to virtual generation assets, active participate power grid regulation.
The active distribution network Optimization Scheduling of the embodiment of the present invention comprises the steps:
(1) Optimized Operation objective function F is set up 1and F 2.
S1: set up systems generate electricity operating cost target function:
min F 1 = Σ t = 1 T Σ i = 1 N G [ f i ( P Gi ( t ) ) × u i ( t ) + S i ( t ) × ( 1 - u i ( t - 1 ) ) × u i ( t ) ] + Σ t = 1 T f DR ( P DR ( t ) ) × u DR ( t ) f i ( P Gi ( t ) ) = A i × P Gi ( t ) 2 + B i × P Gi ( t ) + C i S i ( t ) = Sh i T i , off , min ≤ T i , off ≤ T i , cs Sc i T i , off ≥ T i , cs f DR ( P DR ( t ) ) = d DR × P DR ( t ) - - - ( 1 )
In formula, F 1represent systems generate electricity operating cost; T represents time dispatching cycle; N grepresent the total number of units of conventional power unit; f irepresent i-th conventional power unit operating cost; P girepresent the power output of i-th conventional power unit; S irepresent i-th conventional power unit start-up and shut-down costs; u i(t) and u i(t-1) the start and stop state of i-th unit current time and previous moment is represented respectively; f dRrepresent that Demand Side Response compensates total amount; P dRrepresent Demand-side regulating power, i.e. virtual generated output; u dRt () represents the start and stop state of virtual generating current time; A i, B iand C irepresent the operational factor of i-th conventional power unit; Sh irepresent i-th conventional power unit warm start cost; Sc irepresent i-th conventional power unit cold start-up cost; T i.off.minrepresent the minimum lasting idle time that i-th conventional power unit allows; T i.offrepresenting that i-th conventional power unit continued the time of shutting down before certain period, if be open state before this unit, is then 0; T i, csrepresent the cold start-up time of conventional power unit i; d dRfor Demand-side reduces the amount of money that every kilowatt hour electricity compensates.
S2: set up pollutant emission target function:
min F 2 = Σ t = 1 T Σ i = 1 N G g i ( P Gi ( t ) ) × u i ( t ) g i ( P Gi ( t ) ) = a i × P Gi ( t ) 2 + b i × P Gi ( t ) + c i - - - ( 2 )
In formula, F 2represent pollutant emission total yield number; g irepresent the pollutant emission equivalent of i-th conventional power unit; a i, b iand c irepresent the disposal of pollutants coefficient of i-th conventional power unit.
(2) Optimized Operation constraints is set up, comprise: system loading Constraints of Equilibrium, system spinning reserve retrains, the technology of conventional power unit and Demand-side resource is exerted oneself and is limited, conventional power unit Climing constant, conventional power unit minimum running time and the constraint of minimum idle time, the maximum continuous controllable period of time constraint of Demand-side, power mode satisfaction retrains.
S3: set up system loading Constraints of Equilibrium:
Σ i = 1 N G P Gi ( t ) + Σ j = 1 N DG P DGj ( t ) + P DR ( t ) = P L ( t ) - - - ( 3 )
In formula, N dGrepresent distributed power source species number; P dGjt () represents that jth kind distributed power source t is exerted oneself; P lt () represents the load power of t.
S4: set up the constraint of system spinning reserve:
Σ i = 1 N G u i ( t ) P Gi , max + P DR , max ≥ P L ( t ) + P RL ( t ) + Σ j = 1 N DG P DGj ( t ) - - - ( 4 )
In formula, P gi, maxrepresent that i-th maximum technology of conventional power unit is exerted oneself; P dR, maxrepresent that maximum available Demand-side regulates load; P rLexpression system spinning reserve demand; expression system is exert oneself uncertainty and the newly-increased reserve capacity of reply distributed power source, considers the uncertainty of distributed electrical source power 100% probability interval, P herein dGjbe jth kind distributed power source to exert oneself.
S5: the technology setting up conventional power unit and Demand-side resource is exerted oneself and limited:
P Gi,min≤P Gi(t)≤P Gi,max(5)
0≤P DR(t)≤P DR,max
In formula, P gi, min, P gi, maxrepresent that i-th minimum, maximum technology of conventional power unit is exerted oneself respectively.
S6: set up conventional power unit Climing constant:
P i(t)-P i(t-1)≤r uiT (6)
P i(t-1)-P i(t)≤r diT
In formula, P i(t) and P i(t-1) power output of current time and previous moment i-th conventional power unit is represented respectively; r uiand r direpresent i-th conventional power unit power climbing speed and fall off rate respectively.
S7: set up the minimum continuous working period of conventional power unit permission and minimum lasting idle time constraint:
T i,on≥T i,on,min(7)
T i,off≥T i,off,min
In formula, T i, onrepresent i-th conventional power unit continuous operating time; T i, offrepresent i-th conventional power unit continuous idle time; T i, on, minrepresent the minimum continuous working period that i-th conventional power unit allows.
S8: set up the maximum continuous controllable period of time constraint (continuous working period that namely virtual power supply allows retrains) that Demand-side allows:
T DR≤T DR,max(8)
In formula, T dRrepresent Demand-side controllable period of time; T dR, maxrepresent the maximum continuous controllable period of time that Demand-side allows.
S9: set up the constraint of user power utilization mode satisfaction:
m s ≥ m s , min m s = 1 - Σ t = 1 T | Δ q t | Σ t = 1 T q t - - - ( 9 )
In formula, m srepresent power mode satisfaction; m s, minrepresent the minimum power mode satisfaction allowed, represent in a dispatching cycle T, before and after optimizing each period electricity knots modification absolute value and; represent in a dispatching cycle T, power consumption total before optimizing.
(3) Demand Side Response is equivalent to a virtual synchronous generator, by carrying out the start and stop state of all units of determination of period one by one based on the discrete particle cluster algorithm of heuristic rule.
S10: each conventional power unit characterisitic parameter of initialization, comprising: unit output limits, greenhouse gas, minimum start and stop time, cold start-up time, climbing restriction, start-up cost, emission performance coefficient, continuous service/idle time; Initial reguirements side characterisitic parameter, comprising: the maximum technology of Demand-side resource is exerted oneself, the maximum continuous controllable period of time that Demand-side allows; Initialization system prediction payload and distributed power source predict size of exerting oneself.
S11: the start and stop state of certain period conventional power unit of initialization and equivalent virtual synchronous generator group; Be provided with b popindividual (generally desirable [20,80] integer between) represent the particle of unit in certain period start and stop state, the dimension of each particle is consistent with conventional power unit in system and equivalent virtual synchronous generator group number sum, the start and stop state of corresponding unit in the value expression system of the every one dimension of particle.First the start and stop state of all units of random initializtion is 0 or 1, and wherein 0 represents closedown, and 1 represents unlatching.First judge whether the particle after initialization meets the minimum continuous working period constraint and minimum lasting idle time constraint allowed afterwards, and carry out the correction of particle position, correction formula is as follows:
In formula, represent the value of a kth particle the 0th iteration i-th dimension, i.e. the state of unit after i-th a certain period initialization of conventional power unit.If at initial runtime, be stopped status before i-th conventional power unit, then T i, on=0; If be open state before i-th conventional power unit, then T i.off=0.
Each particle also needs to judge whether to satisfy the demands the maximum continuous controllable period of time constraint in side, and carries out the correction of particle position, and correction formula is as follows:
In formula, represent a kth particle, the 0th iteration, the value of the n-th dimension, the i.e. state of virtual synchronous generator n unit after a certain period initialization.T n, DRrepresenting that n-th virtual synchronous generator continued the time of start before certain period, if be stopped status before this unit, is then 0.T n, DR, maxrepresent the maximum continuous working period that maximum continuous controllable period of time i.e. equivalence n-th virtual synchronous generator that Demand-side allows allows.
Whether constraint minimum running time is met to each particle, after the detection that minimum idle time constraint and the maximum continuous controllable period of time of Demand-side retrain, correction, judges whether each particle meets the constraint of system spinning reserve.Introduce priority ordering method to sort successively from the order of getting well to differing from according to performance driving economy to each conventional power unit.Performance driving economy is used for judging by average expense AFLC (Average Full-LoadCost) at full capacity, and expression formula is as follows:
AFLC = f i ( P Gi , max ) P Gi , max - - - ( 12 )
f i(P Gi,max)=A i×P Gi,max 2+B i×P Gi,max+C i
In formula, f i(P gi.max) represent operating cost under i-th conventional power unit full load situation.Average expense is less at full capacity, and the performance driving economy of unit is better.
If a certain particle is discontented with the constraint of pedal system spinning reserve, then according to performance driving economy from getting well to the unit do not opened before the order differed from is opened successively and judging whether particle meets the constraint of system spinning reserve, until all particles all meet the constraint of system spinning reserve.
Afterwards heuristic correction is carried out to each particle start and stop state, judges whether each particle start and stop state meets following constraints:
Σ i = 1 N x k i ( 0 ) × P Gi , min > 0.9 ( P L ( t ) - Σ j = 1 N DG P DGj ( t ) ) - - - ( 13 )
In formula, represent the exert oneself summation of distributed power source in the t period.N represents conventional power unit and equivalent virtual synchronous generator number sum.
When the minimum technology of certain moment all operating units exert oneself sum be all greater than 90% of total load and distributed power source gross capability difference time, in order to meet system loading Constraints of Equilibrium, all units almost have to operate at about minimum load, economic optimum so scarcely, therefore, heuristic correction is added with convergence speedup speed.Equally each conventional power unit is sorted by the good order to difference successively according to performance driving economy, judge that the index of conventional power unit performance driving economy quality is shown in formula (12).If a certain particle does not meet constraint equation (13), then judge whether to meet constraint equation (13), until all particles all meet constraint equation (13) from bad unit to not closing before good order is closed successively according to performance driving economy.
S12: the single step completing discrete particle cluster upgrades.First carry out speed renewal according to the discrete particle cluster algorithm based on heuristic rule, speed more new formula is as follows:
v k(t+1)=wv k(t)+c 1r 1(P k,best(t)-x k(t))+c 2r 2(P g(t)-x k(t)) (14)
In formula, v kt () represents the speed after a kth particle the t time iteration, x kt () represents the position after a kth particle the t time iteration, P k, bestt () represents the history optimal value of a kth particle, P gt () represents global optimum.W represents inertia weight (generally between [0.4,0.9]), c 1, c 2represent Studying factors (generally desirable 2), r 1, r 2for the random number between [0,1].
After the speed that completes upgrades, carry out location updating, location updating step is as follows:
First judge whether the start and stop state of unit meets constraint minimum running time, minimum idle time constraint and maximum sustainable operation time-constrain, if meet, then according to the location updating formula of normal scatter population, use critical operator to carry out location updating; If do not meet, use (10), (11) formula upgrades.Wherein, the introducing of critical operator wishes to make the better to dominance of iterative process.Ordinary particle group algorithm adopts a random number λ, and after several s that speed is converted between 0 ~ 1, it is excessive or too small that λ gets, set state be transformed into 0 or 1 probability excessive, then have a strong impact on iteration to dominance.Critical operator 0.1< λ 1<0.4,0.6< λ 2<0.9, by the range shorter of random number λ to [λ 1, λ 2], like this do not lose particle multifarious simultaneously ensure particle upgrade towards more excellent direction.
The location updating formula of discrete particle cluster is as follows:
Sigmoid ( v ) = 1 1 + e - v
In formula, x kt () represents the position after a kth particle the t time iteration; Rand is the random number between [0,1]; Sigmoid is SQL.
Next, judge whether particle meets spinning reserve constraint, and upgrade, renewal process is with the renewal process of spinning reserve constraint in S11.
Finally, carry out heuristic correction to each particle start and stop state, makeover process is with makeover process heuristic in S11.
After completing particle position renewal, each particle is brought in fitness function and solves adaptive value, carry out optimal value renewal.In this problem, fitness function is unit starting cost, and formula is as follows:
F=S i(t)×(1-u i(t-1))
S i ( t ) = Sh i T i , off , min &le; T i , off &le; T i , cs Sc i T i , off &GreaterEqual; T i , cs - - - ( 16 )
In formula, F represents unit starting cost.
The step that optimal value upgrades is: if a kth particle brings the adaptive value P that fitness function calculates into kt () is less than the history optimal value P of a kth particle k, bestt (), then make P k, best(t)=P k(t), otherwise P k, bestt () remains unchanged.The global optimum P of population after if current renewal completes g, now(t) be less than before global optimum P gt (), then make P g, now(t)=P g(t).
S13: the calculating completing discrete particle cluster algorithm list period start and stop state; Determine the iterations C that each period needs iteration b(generally desirable 100 times), first carry out being S11 step, repeat S12 step afterwards until cycle-index reaches C bsecondary, obtain the start and stop state of certain period final, and store this data.
S14: the calculating completing discrete particle cluster algorithm whole period start and stop state.When to determine in what a total dispatching cycle after hop count T (generally getting 24), just can carry out the calculating of each period start and stop state successively according to the method for S13 step.The final start and stop state outcome result of all each periods of unit is stored.
(4) after the calculating completing each period start and stop state of all units, on the basis of known start and stop state, carrying out economic allocation to each unit according on the basis of constraints by the continuous particle cluster algorithm based on heuristic rule, concrete implementation step is as follows:
S15: the output distribution of a certain each unit of period of initialization.Be provided with c popindividual (generally desirable [20,80] random integers between) represent the particle that all units were exerted oneself in certain period, the dimension of each particle is consistent with conventional power unit in system and equivalent virtual synchronous generator number sum, the size of exerting oneself of corresponding unit in the value expression system of the every one dimension of particle.In the scope that each unit minimax is exerted oneself, the size of exerting oneself of all units of random initializtion.
S16: complete standard particle group single step and upgrade.First carry out speed renewal according to standard particle group algorithm, speed more new formula, with the speed more new formula of discrete particle cluster, is shown in formula (14), then carries out location updating.Continuous particle cluster algorithm location updating formula is:
x k(t+1)=x k(t)+v k(t) (17)
After location updating, each particle needs to judge whether the Climing constant meeting conventional power unit, and carries out the correction of particle position, and correction formula is as follows:
In formula, with represent the kth particle value in t period and t-1 period i-th dimension respectively, namely in the size of exerting oneself of t period and t-1 period i-th conventional power unit.UP iand DN irepresent the maximum output size of the maximum output size that the conventional power unit i unit interval can climb and decline respectively.
The also demand fulfillment user power utilization mode satisfaction constraint of each particle, and carry out the correction of particle position, correction formula is as follows:
In formula, represent the value that a kth particle was tieed up in the t period n-th, namely in the size of exerting oneself of t period n-th virtual synchronous generator.P lt () represents the system total load of period t.
After completing location updating, each particle is brought in fitness function and solves adaptive value, carry out the renewal of optimal value.The fitness function of this problem by the operating cost of unit, the equivalent price of system blowdown and the penalty composition of system loading Constraints of Equilibrium.Fitness function formula is:
min F = &Sigma; t = 1 T &Sigma; i = 1 N G [ f i ( P Gi ( t ) ) &times; u i ( t ) ] + &Sigma; t = 1 T f DR ( P DR ( t ) ) &times; u DR ( t ) + c &times; &Sigma; t = 1 T &Sigma; i = 1 N G g i ( P Gi ( t ) ) &times; u i ( t ) + &lambda; &times; &Sigma; t = 1 T max ( ( | &Sigma; i = 1 N G P Gi ( t ) + &Sigma; j = 1 N DG P DGj ( t ) + P DR ( t ) - P L ( t ) | - &epsiv; ) , 0 ) - - - ( 20 )
In formula, c represents blowdown Price factor.λ represents penalty factor.The penalty of last expression system loading Constraints of Equilibrium of multinomial.
The step that optimal value upgrades is identical with the step that optimal value in S12 upgrades.
S17: the economic allocation completing single each unit output of period calculates; Determine the iterations C that each period needs iteration c(generally desirable 100 times), first carry out S15 step, repeat S16 step afterwards until cycle-index reaches C csecondary, obtain the situation of final each unit output economic allocation of certain period, and store this data.
S18: the calculating completing standard particle group algorithm each unit output economic allocation of whole period; When determining after hop count T, just can carry out the calculating of each period Unit Economic distribution successively according to the method for S17 step.The size of finally exerting oneself of all each periods of unit is stored.
S19: try to achieve the final start and stop state of all each periods of unit and size of exerting oneself, be the final result of Unit Combination.According to Unit Combination result, control centre in a planned way allocates exerting oneself of each unit, realizes active distribution network Optimized Operation.
In embodiments of the present invention, by checking the validity of proposition Optimization Scheduling, the method for proposition is applied to the calculating of active distribution network Optimized Operation.The technical parameter choosing conventional fired power generating unit is as shown in table 1, and respectively as shown in Figure 5 and Figure 6, system total load as shown in Figure 7 for the prediction curve that wind-powered electricity generation, photovoltaic generation are exerted oneself.In actual electric network, Demand-side resource type has diversity, and user side Demand Side Response need compensate electricity price, and the Demand-side resources such as energy storage only need to consider maintenance cost, without the need to carrying out price benefication.For simplified model calculates, setting the total size of all Demand-side schedulable resources is 80MW, and average every kilowatt hour amount of compensation of equivalence is 0.016 $, and user power utilization mode satisfaction is not less than 90%.
The technical parameter of the conventional fired power generating unit of table 1
The technical parameter of the conventional fired power generating unit of continued 1
Simulation result is as follows:
A () is not optimized scheduling before, only adopt conventional power unit supply workload demand, in now 24 hours, system cloud gray model total cost is 426300 $, and pollutant emission equivalents is 82985kg.
B () adds distributed power source, after being optimized scheduling, can obtain system cloud gray model total cost in system 24 hours is 390660 $, and comparatively situation (a) have dropped 35640 $; Pollutant emission equivalents is 74433kg, and comparatively situation (a) have dropped 8552kg.
If c () considers distributed power source and Demand Side Response simultaneously, after being optimized scheduling, can obtain system cloud gray model total cost in system 24 hours is 370698 $, and comparatively situation (b) have dropped 19962 $; Pollutant emission equivalents is 72487kg, and comparatively situation (b) have dropped 1946kg.Before and after Optimized Operation, load curve contrast as shown in Figure 8, can be found out, after considering Demand Side Response, load peak obviously declines, and effectively reduces the peak-valley difference of load.
As can be seen from example, adopt the Optimization Scheduling that the embodiment of the present invention proposes, distributed power source and Demand-side resource participate in electrical network simultaneously and regulate, systems generate electricity operating cost can be effectively reduced, reduce load peak-valley difference, reduce environmental pollution simultaneously, to the optimizing operation of electrical network, there is positive effect.
Those skilled in the art will readily understand; the foregoing is only preferred embodiment of the present invention; not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.

Claims (3)

1., based on an active distribution network Optimization Scheduling for virtual generating, it is characterized in that, comprise the steps:
(1) Optimized Operation target function is set up; First object function F is set up for target so that systems generate electricity operating cost is minimum 1, set up the second objective function F so that pollutant emission total yield number is minimum for target 2;
(2) described Optimized Operation bound for objective function is obtained; Described constraints comprises: system loading Constraints of Equilibrium, system spinning reserve retrains, the technology of conventional power unit and Demand-side resource is exerted oneself and is limited, conventional power unit Climing constant, conventional power unit minimum running time and the constraint of minimum idle time, the maximum continuous controllable period of time constraint of Demand-side, power mode satisfaction retrains;
(3) Demand Side Response is equivalent to a virtual synchronous generator, according to described Optimized Operation target function and described constraints and by the start and stop state of all units of acquisition that carry out the period one by one based on the discrete particle cluster algorithm of heuristic rule;
(4) according to the start and stop state of all units, and by the continuous particle cluster algorithm based on heuristic rule, on the basis according to described constraints, economic allocation is carried out to each unit; And allocate exerting oneself of each unit according to the result of economic allocation and the final start and stop state of all each periods of unit and size of exerting oneself, realize active distribution network Optimized Operation.
2. active distribution network Optimization Scheduling as claimed in claim 1, it is characterized in that, in step (1), described first object function is: min F 1 = &Sigma; t = 1 T &Sigma; i = 1 N G [ f i ( P Gi ( t ) ) &times; u i ( t ) + S i ( t ) &times; ( 1 - u i ( t - 1 ) ) &times; u i ( t ) ] + &Sigma; t = 1 T f DR ( P DR ( t ) ) &times; u DR ( t ) ; Described second target function is: min F 2 = &Sigma; t = 1 T &Sigma; i = 1 N G g i ( P Gi ( t ) ) &times; u i ( t ) ;
Wherein, F 1represent systems generate electricity operating cost; T represents time dispatching cycle; N grepresent the total number of units of conventional power unit; f i(P gi(t))=A i× P gi(t) 2+ B i× P gi(t)+C i, f irepresent i-th conventional power unit operating cost; P girepresent the power output of i-th conventional power unit; S irepresent i-th conventional power unit start-up and shut-down costs; u i(t) and u i(t-1) the start and stop state of i-th unit current time and previous moment is represented respectively; f dRrepresent that Demand Side Response compensates total amount; f dR(P dR(t))=d dR× P dR(t), P dRrepresent Demand-side regulating power, i.e. virtual generated output; u dRt () represents the start and stop state of virtual generating current time; A i, B iand C irepresent the operational factor of i-th conventional power unit; S i ( t ) = Sh i T i , off , min &le; T i , off &le; T i , cs Sc i T i , off &GreaterEqual; T i , cs , Sh irepresent i-th conventional power unit warm start cost; Sc irepresent i-th conventional power unit cold start-up cost; T i.off.minrepresent the minimum lasting idle time that i-th conventional power unit allows; T i.offrepresenting that i-th conventional power unit continued the time of shutting down before certain period, if be open state before this unit, is then 0; T i, csrepresent the cold start-up time of conventional power unit i; d dRfor Demand-side reduces the amount of money that every kilowatt hour electricity compensates; F 2represent pollutant emission total yield number; g i(P gi(t))=a i× P gi(t) 2+ b i× P gi(t)+c i, g irepresent the pollutant emission equivalent of i-th conventional power unit; a i, b iand c irepresent the disposal of pollutants coefficient of i-th conventional power unit.
3. active distribution network Optimization Scheduling as claimed in claim 1 or 2, it is characterized in that, in step (2), described system loading Constraints of Equilibrium is wherein, N dGrepresent distributed power source species number; P dGjt () represents that jth kind distributed power source t is exerted oneself; P lt () represents the load power of t;
Described system spinning reserve is constrained to &Sigma; i = 1 N G u i ( t ) P Gi , max + P DR , max &GreaterEqual; P L ( t ) + P RL ( t ) + &Sigma; j = 1 N DG P DGj ( t ) , Wherein, P gi, maxrepresent that i-th maximum technology of conventional power unit is exerted oneself; P dR, maxrepresent that maximum available Demand-side regulates load; P rLexpression system spinning reserve demand; expression system is exert oneself uncertainty and the newly-increased reserve capacity of reply distributed power source, considers the uncertainty of distributed electrical source power 100% probability interval, P herein dGjbe jth kind distributed power source to exert oneself;
The technology of described conventional power unit and Demand-side resource is exerted oneself and is restricted to P Gi , min &le; P Gi ( t ) &le; P Gi , max 0 &le; P DR ( t ) &le; P DR , max , P gi, min, P gi, maxrepresent that i-th minimum, maximum technology of conventional power unit is exerted oneself respectively;
Described conventional power unit Climing constant is P i ( t ) - P i ( t - 1 ) &le; r ui T P i ( t - 1 ) - P i ( t ) &le; r di T , Wherein P i(t) and P i(t-1) power output of current time and previous moment i-th conventional power unit is represented respectively; r uiand r direpresent i-th conventional power unit power climbing speed and fall off rate respectively;
Described conventional power unit minimum running time and minimum idle time are constrained to T i , on &GreaterEqual; T i , on , min T i , off &GreaterEqual; T i , off , min , Wherein, T i, onrepresent i-th conventional power unit continuous operating time; T i, offrepresent i-th conventional power unit continuous idle time; T i, on, minrepresent the minimum continuous working period that i-th conventional power unit allows;
The maximum continuous controllable period of time of described Demand-side is constrained to T dR≤ T dR, max, wherein, T dRrepresent Demand-side controllable period of time; T dR, maxrepresent the maximum continuous controllable period of time that Demand-side allows;
Described power mode satisfaction is constrained to m s &GreaterEqual; m s , min m s = 1 - &Sigma; t = 1 T | &Delta; q t | &Sigma; t = 1 T q t ; Wherein m srepresent power mode satisfaction; m s, minrepresent the minimum power mode satisfaction allowed, represent in a dispatching cycle T, before and after optimizing each period electricity knots modification absolute value and; represent in a dispatching cycle T, power consumption total before optimizing.
CN201510137591.1A 2015-03-26 2015-03-26 A kind of active distribution network Optimization Scheduling based on virtual generating Active CN104734200B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510137591.1A CN104734200B (en) 2015-03-26 2015-03-26 A kind of active distribution network Optimization Scheduling based on virtual generating

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510137591.1A CN104734200B (en) 2015-03-26 2015-03-26 A kind of active distribution network Optimization Scheduling based on virtual generating

Publications (2)

Publication Number Publication Date
CN104734200A true CN104734200A (en) 2015-06-24
CN104734200B CN104734200B (en) 2017-03-01

Family

ID=53457793

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510137591.1A Active CN104734200B (en) 2015-03-26 2015-03-26 A kind of active distribution network Optimization Scheduling based on virtual generating

Country Status (1)

Country Link
CN (1) CN104734200B (en)

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104979850A (en) * 2015-07-01 2015-10-14 国网山东省电力公司经济技术研究院 Wind-power-contained power system scheduling method with involvement of energy storage for standby
CN105870976A (en) * 2016-04-15 2016-08-17 国家电网公司 Energy environment efficiency-based low-carbon dispatching method and device
CN105956247A (en) * 2016-04-26 2016-09-21 大连理工大学 Open, fair and impartial scheduling model building method based on Gini coefficient
CN106655232A (en) * 2017-01-13 2017-05-10 东北电力大学 Electric car distributed charge-discharge scheduling policy based on three-phase load balance
CN106779237A (en) * 2016-12-29 2017-05-31 天津大学 A kind of active distribution network load curve Forecasting Methodology from bottom to top
CN106816879A (en) * 2017-01-16 2017-06-09 华南理工大学 Active power distribution network voltage coordination control method based on emergency demand response
CN107967567A (en) * 2017-12-14 2018-04-27 西南石油大学 Wind power plant dispatching method and system based on virtual power supply
CN108288854A (en) * 2018-01-04 2018-07-17 国网江苏省电力有限公司电力科学研究院 One introduces a collection net lotus control method for coordinating and system
CN108493992A (en) * 2018-03-27 2018-09-04 国网江苏省电力有限公司电力科学研究院 A kind of wind power plant Optimization Scheduling of the controller containing Distributed Power Flow
CN108964021A (en) * 2018-06-25 2018-12-07 国网陕西省电力公司经济技术研究院 A kind of control method for the frequency modulation electric car capacity spatial and temporal distributions characteristic that networks
CN109617133A (en) * 2018-12-18 2019-04-12 深圳供电局有限公司 Power system scheduling method considering flexible load
CN109858774A (en) * 2019-01-09 2019-06-07 燕山大学 Improve the source net lotus planing method of security of system and harmony
CN109934450A (en) * 2018-12-29 2019-06-25 国网天津市电力公司电力科学研究院 More scene active distribution network planning appraisal methods based on Demand Side Response
CN112165086A (en) * 2020-08-12 2021-01-01 华南理工大学 Online optimization system of active power distribution network
CN112396232A (en) * 2020-11-19 2021-02-23 燕山大学 Economic dispatching method and system for electric power system with valve point effect
CN112751369A (en) * 2020-12-30 2021-05-04 国网河北省电力有限公司沧州供电分公司 Optimized scheduling method for offshore power distribution network and terminal equipment
CN113240547A (en) * 2021-05-21 2021-08-10 河北工业大学 Scheduling method of hydrogen production unit array under wind power consumption

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040039490A1 (en) * 2002-08-23 2004-02-26 Mitsubishi Denki Kabushiki Kaisha Power generator controller
CN102361330A (en) * 2011-10-19 2012-02-22 北京四方继保自动化股份有限公司 Active power optimizing and distributing method for wind generator unit of wind power station
CN103824134A (en) * 2014-03-06 2014-05-28 河海大学 Two-stage optimized dispatching method for virtual power plant

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040039490A1 (en) * 2002-08-23 2004-02-26 Mitsubishi Denki Kabushiki Kaisha Power generator controller
CN102361330A (en) * 2011-10-19 2012-02-22 北京四方继保自动化股份有限公司 Active power optimizing and distributing method for wind generator unit of wind power station
CN103824134A (en) * 2014-03-06 2014-05-28 河海大学 Two-stage optimized dispatching method for virtual power plant

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
郑斌: "电力系统多目标优化发电调度的改进决策方法", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 *

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104979850A (en) * 2015-07-01 2015-10-14 国网山东省电力公司经济技术研究院 Wind-power-contained power system scheduling method with involvement of energy storage for standby
CN105870976A (en) * 2016-04-15 2016-08-17 国家电网公司 Energy environment efficiency-based low-carbon dispatching method and device
CN105870976B (en) * 2016-04-15 2018-05-29 国家电网公司 A kind of low-carbon dispatching method and device based on energy environment efficiency
CN105956247B (en) * 2016-04-26 2019-04-16 大连理工大学 The three public scheduling model construction methods based on Gini coefficient
CN105956247A (en) * 2016-04-26 2016-09-21 大连理工大学 Open, fair and impartial scheduling model building method based on Gini coefficient
CN106779237A (en) * 2016-12-29 2017-05-31 天津大学 A kind of active distribution network load curve Forecasting Methodology from bottom to top
CN106655232A (en) * 2017-01-13 2017-05-10 东北电力大学 Electric car distributed charge-discharge scheduling policy based on three-phase load balance
CN106816879A (en) * 2017-01-16 2017-06-09 华南理工大学 Active power distribution network voltage coordination control method based on emergency demand response
CN106816879B (en) * 2017-01-16 2019-08-20 华南理工大学 Active power distribution network voltage coordination control method based on emergency demand response
CN107967567A (en) * 2017-12-14 2018-04-27 西南石油大学 Wind power plant dispatching method and system based on virtual power supply
CN107967567B (en) * 2017-12-14 2022-02-11 西南石油大学 Wind power plant scheduling method and system based on virtual power supply
CN108288854A (en) * 2018-01-04 2018-07-17 国网江苏省电力有限公司电力科学研究院 One introduces a collection net lotus control method for coordinating and system
CN108493992A (en) * 2018-03-27 2018-09-04 国网江苏省电力有限公司电力科学研究院 A kind of wind power plant Optimization Scheduling of the controller containing Distributed Power Flow
CN108964021A (en) * 2018-06-25 2018-12-07 国网陕西省电力公司经济技术研究院 A kind of control method for the frequency modulation electric car capacity spatial and temporal distributions characteristic that networks
CN108964021B (en) * 2018-06-25 2022-07-01 国网陕西省电力公司经济技术研究院 Method for controlling capacity space-time distribution characteristic of frequency-modulated electric vehicle capable of accessing network
CN109617133A (en) * 2018-12-18 2019-04-12 深圳供电局有限公司 Power system scheduling method considering flexible load
CN109934450A (en) * 2018-12-29 2019-06-25 国网天津市电力公司电力科学研究院 More scene active distribution network planning appraisal methods based on Demand Side Response
CN109858774A (en) * 2019-01-09 2019-06-07 燕山大学 Improve the source net lotus planing method of security of system and harmony
CN112165086A (en) * 2020-08-12 2021-01-01 华南理工大学 Online optimization system of active power distribution network
CN112396232B (en) * 2020-11-19 2022-03-08 燕山大学 Economic dispatching method and system for electric power system with valve point effect
CN112396232A (en) * 2020-11-19 2021-02-23 燕山大学 Economic dispatching method and system for electric power system with valve point effect
CN112751369A (en) * 2020-12-30 2021-05-04 国网河北省电力有限公司沧州供电分公司 Optimized scheduling method for offshore power distribution network and terminal equipment
CN113240547A (en) * 2021-05-21 2021-08-10 河北工业大学 Scheduling method of hydrogen production unit array under wind power consumption
CN113240547B (en) * 2021-05-21 2022-04-12 河北工业大学 Scheduling method of hydrogen production unit array under wind power consumption

Also Published As

Publication number Publication date
CN104734200B (en) 2017-03-01

Similar Documents

Publication Publication Date Title
CN104734200A (en) Initiative power distribution network scheduling optimizing method based on virtual power generation
CN109687532B (en) Combined heat and power scheduling method for improving wind power consumption based on cooperative game
Rahim et al. A convex optimization based decentralized real-time energy management model with the optimal integration of microgrid in smart grid
CN110086187B (en) Energy storage peak regulation day-ahead optimization scheduling method considering load characteristics
CN112713618B (en) Active power distribution network source network load storage cooperative optimization operation method based on multi-scene technology
CN108875992B (en) Virtual power plant day-ahead optimization scheduling method considering demand response
Li et al. Hybrid time-scale energy optimal scheduling strategy for integrated energy system with bilateral interaction with supply and demand
CN108429288A (en) A kind of off-network type micro-capacitance sensor energy storage Optimal Configuration Method considering demand response
Mahesh et al. Optimal sizing of a grid-connected PV/wind/battery system using particle swarm optimization
CN109002931A (en) Power generation dispatching and Peak-valley TOU power price combined optimization method a few days ago a few days ago
CN105226688A (en) Based on the polymorphic type energy storage system capacity configuration optimizing method of Chance-constrained Model
CN106712075A (en) Peaking strategy optimization method considering safety constraints of wind power integration system
CN110365032A (en) A kind of lotus source optimization control method for considering electric car and participating in wind electricity digestion
CN113799640B (en) Energy management method suitable for micro-grid containing electric vehicle charging piles
Yang et al. Multi-Objective optimal scheduling of island microgrids considering the uncertainty of renewable energy output
CN107017625A (en) The method and apparatus that energy dynamics for independent micro-capacitance sensor are dispatched
CN112100743A (en) Electric vehicle virtual unit regulation and control method suitable for stabilizing new energy output fluctuation
CN114285093B (en) Source network charge storage interactive scheduling method and system
CN116316567A (en) Comprehensive energy demand response optimization method under ladder carbon transaction mechanism
CN117559526A (en) Router-simulated energy regulation and control method based on optical storage and charging integrated charging station
CN112510690B (en) Optimal scheduling method and system considering wind-fire-storage combination and demand response reward and punishment
CN112003279B (en) Evaluation method for new energy consumption capability of hierarchical micro-grid
CN104484757A (en) Heterogeneous load scheduling and energy management method applied to intelligent micro grid
CN117543581A (en) Virtual power plant optimal scheduling method considering electric automobile demand response and application thereof
CN109995027A (en) A kind of two stages zone user energy management method and system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CB03 Change of inventor or designer information
CB03 Change of inventor or designer information

Inventor after: Zhao Mingxin

Inventor after: Zhang Wei

Inventor after: Hui Hui

Inventor after: Liu Wei

Inventor after: Wei Tao

Inventor after: Ye Chang

Inventor after: Miao Shihong

Inventor after: Liu Bin

Inventor after: Ji Xiaoqing

Inventor before: Zhao Mingxin