[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN110137938A - Optimization Scheduling based on the wind fire storage association system for improving bat algorithm - Google Patents

Optimization Scheduling based on the wind fire storage association system for improving bat algorithm Download PDF

Info

Publication number
CN110137938A
CN110137938A CN201811533847.0A CN201811533847A CN110137938A CN 110137938 A CN110137938 A CN 110137938A CN 201811533847 A CN201811533847 A CN 201811533847A CN 110137938 A CN110137938 A CN 110137938A
Authority
CN
China
Prior art keywords
wind
cost
fire
optimal
energy
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
CN201811533847.0A
Other languages
Chinese (zh)
Other versions
CN110137938B (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.)
Xian University of Technology
Original Assignee
Xian University of Technology
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 Xian University of Technology filed Critical Xian University of Technology
Priority to CN201811533847.0A priority Critical patent/CN110137938B/en
Publication of CN110137938A publication Critical patent/CN110137938A/en
Application granted granted Critical
Publication of CN110137938B publication Critical patent/CN110137938B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00Circuit arrangements for ac mains or ac distribution networks
    • H02J3/008Circuit arrangements for ac mains or ac distribution networks involving trading of energy or energy transmission rights
    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00Circuit arrangements for ac mains or ac distribution networks
    • H02J3/38Arrangements for parallely feeding a single network by two or more generators, converters or transformers
    • H02J3/46Controlling of the sharing of output between the generators, converters, or transformers
    • H02J3/48Controlling the sharing of the in-phase component
    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2203/00Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
    • H02J2203/20Simulating, e g planning, reliability check, modelling or computer assisted design [CAD]
    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2310/00The network for supplying or distributing electric power characterised by its spatial reach or by the load
    • H02J2310/50The network for supplying or distributing electric power characterised by its spatial reach or by the load for selectively controlling the operation of the loads
    • H02J2310/56The network for supplying or distributing electric power characterised by its spatial reach or by the load for selectively controlling the operation of the loads characterised by the condition upon which the selective controlling is based
    • H02J2310/62The condition being non-electrical, e.g. temperature
    • H02J2310/64The condition being economic, e.g. tariff based load management
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02EREDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
    • Y02E10/00Energy generation through renewable energy sources
    • Y02E10/70Wind energy
    • Y02E10/76Power conversion electric or electronic aspects

Landscapes

  • Engineering & Computer Science (AREA)
  • Power Engineering (AREA)
  • Supply And Distribution Of Alternating Current (AREA)

Abstract

The invention discloses a kind of Optimization Schedulings based on the wind fire storage association system for improving bat algorithm, which is characterized in that specifically according to the objective function for establishing system total operating cost minimum operating cost a few days ago under the premise of wind energy consumption beam is maximum;The constraint condition of wind fire storage association system;Based on bat algorithm is improved, on the basis of meeting the constraint condition, the minimum value of calculating target function obtains the step of wind fire stores up minimum operating cost of association system under the premise of wind electricity digestion amount is maximum.The economic performance of analysis wind fire storage association system comprehensively, wind fire storage association system Optimized Operation can more accurately be carried out, the digestion capability of wind-powered electricity generation can be improved in the case where guaranteeing the normal operation of wind fire storage association system, reduce thermal power output, coal consumption cost is saved, wind fire is saved and stores up association system cost.

Description

Wind, fire and storage combined system optimized scheduling method based on improved bat algorithm
Technical Field
The invention belongs to the technical field of power dispatching, and relates to an optimized dispatching method of a wind-fire-storage combined system based on an improved bat algorithm.
Background
Energy shortage and environmental pollution are two important problems facing the world, the breakthrough for solving the two problems is to reasonably utilize renewable energy, and wind energy is the most widely applied renewable energy at present and has the greatest significance in the future energy development strategy. The energy storage device has great help to solve the problems of intermittence and volatility of renewable energy sources and improve the power supply reliability of the microgrid by participating in energy management of the microgrid. Therefore, the wind-fire-storage combined system can improve the running performance of the micro-grid from many aspects, not only can save the output of the thermal power generating unit, but also can reduce the adverse effect on the grid when the wind power is connected to the grid. In addition, the energy storage can not only enable the micro-grid belt to bring more profits through storing and consuming the wind power, but also can increase the absorption capacity of renewable energy.
Aiming at the research of a wind storage combined system, the optimal scheduling problem of the power distribution network is difficult to comprehensively analyze and solve from the aspect of economy or renewable energy utilization rate.
Disclosure of Invention
The invention aims to provide an optimized dispatching method of a wind, fire and storage combined system based on an improved bat algorithm, which can improve the wind power consumption capability, reduce the thermal power output and save the cost of the wind, fire and storage combined system under the condition of ensuring the normal operation of the wind, fire and storage combined system.
The technical scheme adopted by the invention is that the optimal scheduling method of the wind-fire-storage combined system based on the improved bat algorithm is specifically carried out according to the following steps:
step 1, establishing a daily running cost objective function with the lowest total running cost of a system on the premise of the maximum wind energy absorption beam;
constraint conditions of the wind-fire-storage combined system;
and 2, calculating the minimum value of the objective function on the basis of satisfying the constraint condition based on the improved bat algorithm to obtain the minimum running cost of the wind-fire storage combined system on the premise of the maximum wind power consumption.
The invention is also characterized in that:
the step 1 of establishing the objective function of the day-ahead operation cost is specifically carried out according to the following steps:
step 1.1, establishing a lowest total operation cost objective function of the wind, fire and storage combined system:
min F1=f1+f2+f3(1)
wherein f is1Cost of the fire-electric unit in the combined wind-fire-storage system, f2Interaction cost, f, for wind-fire-storage combined system3The energy storage cost in the wind-fire energy storage combined system is saved;
establishing a maximum wind energy absorption objective function of the wind-fire-storage combined system:
wherein, tPw,i,tActive scheduling processing of the ith fan in the wind, fire and storage combined system in the period t, NwThe total number of the fans is N, the total time period number is represented by N, and delta t is a unit time period;
step 1.2, obtaining an objective function of the day-ahead running cost according to the minimum total running cost objective function and the maximum wind energy consumption objective function:
1.1, calculating the cost of the thermoelectric generator set according to the following steps:
step 1.1.1, calculating the fuel cost of the thermal power generating unit:
wherein, ai、biAnd is ciCoefficient of operating costs, P, of thermal power generating unitsG,i,tThe active output of the ith conventional thermal power generating unit at the moment t is represented;
calculating the maintenance cost of the thermal power generating unit:
fmain,i,t=diPG,i,t·Δt (5)
wherein d isiIs the coefficient of the operating cost of the thermal power generating unit;
calculating the starting and stopping cost of the thermal power generating unit:
fstate,i,t=(Uon,G,i·Bon,G,i,t+Uoff,G,i·Boff,G,i,t)·Δt (6)
wherein, Uon,G,iRepresents the opening state of the ith conventional thermal power generating unit in a time period t, Bon,G,i,tTo represent the stop state of the ith conventional thermal power generating unit in the time period t, Uoff,G,iRepresents the starting cost of the ith conventional thermal power generating unit in the time period t, Boff,G,i,tRepresenting the stopping cost of the ith conventional thermal power generating unit in the time period t;
step 1.1.2, calculating the cost of the thermal power generating unit according to the fuel cost, the maintenance cost and the starting and stopping cost:
step 1.1 the interaction cost of the wind-fire-storage combined system is specifically carried out according to the following steps:
step a, calculating the cost of the wind-fire-storage combined system for purchasing electric energy from a large power grid:
fbuy,t=Ubuy·Bbuy,t·Pbuy,t·Δt (8)
wherein, UbuyPurchase of electricity prices for wind, fire and storage combined systems to large grids, Bbuy,tThe variable is 0-1 for power purchase, 0 represents no power purchase, and 1 represents power purchase Pbuy,tPurchasing power of electric energy from a large power grid for the wind-fire-storage combined system;
calculating the cost of the wind-fire-storage combined system for selling electric energy to a large power grid:
fsell,t=Usell·Bsell,t·Psell,t·Δt (9)
wherein, UsellSelling electricity prices for large grids for combined wind, fire and storage systems, Bsell,tWhether electricity is sold or not is a variable of 0-1, 0 represents that electricity is not sold, 1 represents that electricity is sold, and Psell,tSelling the power of electric energy to a large power grid for the wind-fire-storage combined system;
step b, calculating the interaction cost of the wind-fire-storage combined system according to the cost of the wind-fire-storage combined system for purchasing electric energy from the large power grid and the cost obtained by the wind-fire-storage combined system for selling the electric energy from the large power grid:
the energy storage cost in the wind-fire energy storage combined system is calculated according to the following method:
step A, calculating the maintenance cost of the wind-fire-storage combined system:
fomb,t=(Komb·|Bch,t·Pch,t+Bdis,tPdis,t|)·Δt (11)
in the formula, KombRepresenting a maintenance cost factor of the stored energy, Bch,tRepresents the charging state of the stored energy in the period t, and is a variable from 0 to 1, 0 represents no charging, 1 represents charging, and Pch,tCharging power for storing energy for a period of t, Bdis,tThe discharge state of energy storage in t period is represented as 0-1 variable, 0 represents no discharge, 1 represents discharge, and Pdis,tThe discharge power for storing energy in the t period;
calculating depreciation cost of the fire storage combined system:
in the formula, EessFor a rated energy storage capacity, Nlife,tIs a cycle life representing the stored energy over time t;
calculating the electric energy loss cost of the fire storage combined system:
in the formula of UmarketIndicating the price of electricity in the market unit, PesslossFor electric energy consuming power, NessIndicating the number of energy storage devices in the distribution network, Bess,iThe dimension of the change of state of the first energy storage device in a certain time period compared with the previous time period is 1 if the state is changed, otherwise, the change of state is 0, and delta Pesslo,iIndicating the loss generated by the ith energy storage device during state switching, ηin,ηoutRespectively representing the charge and discharge efficiency of stored energy;
and B, calculating the energy storage cost in the wind-fire-storage combined system according to the maintenance cost, depreciation cost and electric energy loss cost of the wind-fire-storage combined system:
the constraint conditions in step 1 include:
(1) and power balance constraint:
in the formulaRepresenting the output of all thermal power generating units in the period t,represents the output of all fans in the period of t, PlRepresenting the active load of the system in the period t;
(2) the operation constraint of the thermal power generating unit specifically comprises the following steps:
1) and (3) unit power constraint:
PG,i,min≤PG,i,t≤PG,i,max(16)
wherein, PG,i,minUpper limit of output power, P, of the ith thermal power generating unitG,i,maxRepresenting the lower limit of the output power of the ith thermal power generating unit;
2) minimum start-stop time constraint:
(Bon,G,i,t-1-Bon,G,i,t)·(Ton,i,t-Ton,i,min)≥0 (17)
(Bon,G,i,t-Bon,G,i,t-1)·(Toff,i,t-Toff,i,min)≥0 (18)
wherein, Ton,i,tIndicating the starting duration time T of the ith thermal power generating unit in the period Toff,i,tShutdown duration of i thermal power generating units in T period, Ton,i,minIndicating the minimum operating time, T, of the thermal power generating unitoff,i,minRepresenting a minimum shutdown time of the thermal power generating unit;
3) and (3) climbing restraint:
-rd,i·Δt≤PG,i,t-PG,i,t-1≤ru,i·Δt (19)
wherein r isu,iRepresents the maximum upward climbing speed r of the ith thermal power generating unit in unit timed,iThe maximum downward climbing speed of the ith thermal power generating unit in unit time is represented;
(3) and (3) interactive power flow limit constraint between the micro-grid and the large power grid:
0≤Pbuy,t≤Ptr,max(20)
0≤Psell,t≤Ptr,max(21)
wherein, Ptr,maxRepresenting an interaction limit power;
(4) the energy storage related constraints specifically include:
1) charge and discharge power constraint:
0≤Pch,i,t≤Pch,max(22)
0≤Pdis,i,t≤Pdis,max(23)
in order to ensure the working quality of the energy storage system, the instantaneous charge-discharge power of the stored energy in unit time is generally controlled to be 0.2EessThe following steps:
Pch,max=Pdis,max=0.2Eess(24)
2) and (3) state of charge constraint:
SOCmin≤SOCi,t≤SOCmax(25)
in the formula, SOCi,tRepresenting the ratio of the residual capacity of the stored energy at the current moment to the capacity of the stored energy in the full-charge state,SOCminrepresenting the upper limit of the state of charge, SOC, of the energy storage systemmaxRepresents a lower limit of the energy storage system state of charge;
3) restraint of charging and discharging modes:
0≤Bdis,t≤1 (27)
0≤Bch,t≤1 (28)
Bdis,t+Bch,t≤1 (29)
Bdis,t,Bch,t∈Z (30);
4) conservation of energy in the energy storage device:
wherein E isess,0Which represents the initial energy of the stored energy,representing the residual energy of the stored energy at the end of the scheduling period;
5) and (3) discharge depth constraint:
Dod,min≤Dod,t≤Dod,max(32)
wherein D isod,minLower limit of depth of discharge, Dod,maxAn upper bit discharge depth limit;
(5) operation constraints of the wind turbine:
0≤Pw,i,t≤Pwfore,i,t(34)
wherein, Pwfore,i,tAnd the active predicted output of the ith fan in the t period is shown.
The step 2 is specifically carried out according to the following method:
step 2.1, setting initial parameters:
setting the population scale by taking the output of each thermal power machine and the output of each wind power machine in the wind-fire-storage combined system as an individual in a population;
setting the strength, pulse rate and pulse frequency of the sound equipment;
setting the number of iterations tmax
Calculating a bat algorithm search dimension;
step 2.2, obtaining the position of the initial optimal individual through a Halton sequence, setting the moving boundary of the optimal individual according to a constraint condition, and enabling the position of the initial optimal individual to be the position of the optimal individual, wherein t is 1, and t is the current iteration number;
step 2.3, judging whether the current iteration times meet t ═ tmaxIf yes, outputting the position of the optimal individual and the cost corresponding to the optimal individual;
otherwise, updating the position of the optimal individual to obtain the position of the optimal individual for one-time updating, and calculating the cost F of the optimal individual after one-time updating according to the position of the optimal individual for one-time updating and the objective functiona
Step 2.4, randomly generating a rand if rand is more than riThen, the optimal individual position is updated again, and the cost F of the updated optimal individual is calculated according to the updated optimal individual position and the objective functionb
Otherwise, repeating the step 2.4 until rand > ri
Step 2.5, judging whether rand satisfies rand < AiAnd F isa>FbIf so, the updated optimal individuals are set as the optimal individuals, and the optimal cost of the optimal individuals and the optimal cost of the last iteration are sequenced; simultaneously, when t is t +1, repeating the steps 2.2-2.4 until t is tmax
Otherwise, repeating the step 2.4-2.5 until whether the rand satisfies that rand < AiAnd F is1>F2
In the step 2.1, the population scale is 10-25, the sound intensity is 0-1, the pulse rate is 0-1, the pulse frequency is 0-2, and the iteration frequency is 1000.
In step 2.3, the position of the updated optimal individual is obtained specifically according to the following steps:
step 2.3.1, updating the pulse frequency of the optimal individual once:
f1=fmin+(fmax-fmin)·β (35)
wherein f is1Updated pulse frequency of the optimal individual, [ f [ ]min,fmax]For the frequency range, β is a random perturbation at [0,1 ]]Uniformly distributing the upper layer;
step 2.3.2, updating the pulse speed of the optimal individual at one time:
wherein,is the pulse speed of the optimal individual after one update,is the pulse velocity of the optimal individual for the last iteration,for the position of the optimal individual at the last iteration, x*The position of the current optimal individual;
step 2.3.3, updating the position of the optimal individual once:
step 2.3.4, judging whether the position of the optimal individual after the primary updating meets the constraint condition, and if so, taking the position of the individual after the primary updating as the position of the optimal individual after the primary updating; otherwise, repeating the steps 2.3.1-2.3.3 until the updated position of the optimal individual meets the constraint condition.
In step 2.4, the position of the optimal individual is updated again, specifically according to the following steps:
step 2.4.1, update the pulse frequency of the optimal individual again:
f2=fmin+(fmax-fmin)·β (35)
wherein f is2The pulse frequency of the optimum individual after the re-update, [ f [ ]min,fmax]For the frequency range, β is a random perturbation at [0,1 ]]Uniformly distributing the upper layer;
step 2.4.2, the pulse speed of the optimal individual is updated again:
wherein,is the pulse speed of the optimum individual after being updated again,is the pulse velocity of the optimal individual for the last iteration,for the position of the optimal individual at the last iteration, x*The position of the current optimal individual;
step 2.4.3, update the position of the optimal individual again:
step 2.4.4, judging whether the position of the updated optimal individual meets the constraint condition, and if so, taking the position of the updated individual as the position of the updated optimal individual; otherwise, repeating the steps 2.4.1-2.4.3 until the updated position of the optimal individual meets the constraint condition.
In step 2.4 rand is randomly generated by means of a rand function.
The invention has the beneficial effects that:
the wind, fire and storage combined system optimizing and scheduling method based on the improved bat algorithm comprehensively analyzes the economic performance of the wind, fire and storage combined system, can more accurately perform wind, fire and storage combined system optimizing and scheduling, can improve the wind power consumption capacity under the condition of ensuring the normal operation of the wind, fire and storage combined system, reduces the thermal power output, saves the coal consumption cost and saves the wind, fire and storage combined system cost.
Drawings
FIG. 1 is a daily load graph in an embodiment of an optimized scheduling method of a combined wind, fire and storage system based on an improved bat algorithm;
FIG. 2 is a wind power prediction curve diagram in an embodiment of an optimized scheduling method of a wind, fire and storage combined system based on an improved bat algorithm;
fig. 3 is a flow chart of the minimum operation cost on the premise of calculating the maximum wind power consumption based on the improved bat algorithm in step 2 of the optimal scheduling method of the wind-fire-storage combined system based on the improved bat algorithm.
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings and specific embodiments.
The optimized dispatching method of the wind-fire-storage combined system based on the improved bat algorithm is specifically carried out according to the following steps:
step 1, establishing a day-ahead operation cost objective function with the lowest total system operation cost on the premise of the maximum wind energy consumption, wherein the scheduling cycle is 1 day, the scheduling cycle is divided into 24 time periods, and each hour is 1 time period, and the method specifically comprises the following steps:
the method specifically comprises the following steps of establishing an objective function of the day-ahead operation cost:
step 1.1, establishing a lowest total operation cost objective function of the wind, fire and storage combined system:
min F1=f1+f2+f3(1)
wherein f is1Cost of the fire-electric unit in the combined wind-fire-storage system, f2Interaction cost, f, for wind-fire-storage combined system3The energy storage cost in the wind-fire energy storage combined system is saved;
the cost of the thermal power generating unit is calculated according to the following steps:
step 1.1.1, calculating the fuel cost of the thermal power generating unit:
wherein, ai、biAnd is ciCoefficient of operating costs, P, of thermal power generating unitsG,i,tThe active output of the ith conventional thermal power generating unit at the moment t is represented;
calculating the maintenance cost of the thermal power generating unit:
fmain,i,t=diPG,i,t·Δt (5)
wherein d isiIs the coefficient of the operating cost of the thermal power generating unit;
calculating the starting and stopping cost of the thermal power generating unit:
fstate,i,t=(Uon,G,i·Bon,G,i,t+Uoff,G,i·Boff,G,i,t)·Δt (6)
wherein, Uon,G,iRepresents the opening state of the ith conventional thermal power generating unit in a time period t, Bon,G,i,tTo represent the stop state of the ith conventional thermal power generating unit in the time period t, Uoff,G,iRepresents the starting cost of the ith conventional thermal power generating unit in the time period t, Boff,G,i,tRepresenting the stopping cost of the ith conventional thermal power generating unit in the time period t;
step 1.1.2, calculating the cost of the thermal power generating unit according to the fuel cost, the maintenance cost and the starting and stopping cost:
the interaction cost of the wind-fire-storage combined system is specifically carried out according to the following steps:
step a, calculating the cost of the wind-fire-storage combined system for purchasing electric energy from a large power grid:
fbuy,t=Ubuy·Bbuy,t·Pbuy,t·Δt (8)
wherein, UbuyFor wind, fire and storage combined systemPrice of electricity purchased from the large grid, Bbuy,tThe variable is 0-1 for power purchase, 0 represents no power purchase, and 1 represents power purchase Pbuy,tPurchasing power of electric energy from a large power grid for the wind-fire-storage combined system;
calculating the cost of the wind-fire-storage combined system for selling electric energy to a large power grid:
fsell,t=Usell·Bsell,t·Psell,t·Δt (9)
wherein, UsellSelling electricity prices for large grids for combined wind, fire and storage systems, Bsell,tWhether electricity is sold or not is a variable of 0-1, 0 represents that electricity is not sold, 1 represents that electricity is sold, and Psell,tSelling the power of electric energy to a large power grid for the wind-fire-storage combined system;
step b, calculating the interaction cost of the wind-fire-storage combined system according to the cost of the wind-fire-storage combined system for purchasing electric energy from the large power grid and the cost obtained by the wind-fire-storage combined system for selling the electric energy from the large power grid:
the energy storage cost in the wind-fire energy storage combined system is calculated according to the following method:
step A, calculating the maintenance cost of the wind-fire-storage combined system:
fomb,t=(Komb·|Bch,t·Pch,t+Bdis,tPdis,t|)·Δt (11)
in the formula, KombRepresenting a maintenance cost factor of the stored energy, Bch,tRepresents the charging state of the stored energy in the period t, and is a variable from 0 to 1, 0 represents no charging, 1 represents charging, and Pch,tCharging power for storing energy for a period of t, Bdis,tThe discharge state of energy storage in t period is represented as 0-1 variable, 0 represents no discharge, 1 represents discharge, and Pdis,tThe discharge power for storing energy in the t period;
calculating depreciation cost of the fire storage combined system:
in the formula, EessFor a rated energy storage capacity, Nlife,tIs a cycle life representing the stored energy over time t;
calculating the electric energy loss cost of the fire storage combined system:
in the formula of UmarketIndicating the price of electricity in the market unit, PesslossFor electric energy consuming power, NessIndicating the number of energy storage devices in the distribution network, Bess,iThe dimension of the change of state of the first energy storage device in a certain time period compared with the previous time period is 1 if the state is changed, otherwise, the change of state is 0, and delta Pesslo,iIndicating the loss generated by the ith energy storage device during state switching, ηin,ηoutRespectively representing the charge and discharge efficiency of stored energy;
and B, calculating the energy storage cost in the wind-fire-storage combined system according to the maintenance cost, depreciation cost and electric energy loss cost of the wind-fire-storage combined system:
establishing a maximum wind energy absorption objective function of the wind-fire-storage combined system:
wherein, tPw,i,tFor wind and fire storageActive scheduling processing of the ith fan in the combined system in the period t, NwThe total number of the fans is N, the total time period number is 24h, and delta t is a unit time period;
step 1.2, obtaining an objective function of the day-ahead running cost according to the minimum total running cost objective function and the maximum wind energy consumption objective function:
establishing a constraint condition of a wind-fire-storage combined system:
(1) and power balance constraint:
in the formulaRepresenting the output of all thermal power generating units in the period t,represents the output of all fans in the period of t, PlRepresenting the active load of the system in the period t;
(2) the operation constraint of the thermal power generating unit specifically comprises the following steps:
1) and (3) unit power constraint:
PG,i,min≤PG,i,t≤PG,i,max(16)
wherein, PG,i,minUpper limit of output power, P, of the ith thermal power generating unitG,i,maxRepresenting the lower limit of the output power of the ith thermal power generating unit;
2) minimum start-stop time constraint:
(Bon,G,i,t-1-Bon,G,i,t)·(Ton,i,t-Ton,i,min)≥0 (17)
(Bon,G,i,t-Bon,G,i,t-1)·(Toff,i,t-Toff,i,min)≥0 (18)
wherein, Ton,i,tIndicating the starting duration time T of the ith thermal power generating unit in the period Toff,i,tShutdown duration of i thermal power generating units in T period, Ton,i,minIndicating the minimum operating time, T, of the thermal power generating unitoff,i,minRepresenting a minimum shutdown time of the thermal power generating unit;
3) and (3) climbing restraint:
-rd,i·Δt≤PG,i,t-PG,i,t-1≤ru,i·Δt (19)
wherein r isu,iRepresents the maximum upward climbing speed r of the ith thermal power generating unit in unit timed,iThe maximum downward climbing speed of the ith thermal power generating unit in unit time is represented;
(3) and (3) interactive power flow limit constraint between the micro-grid and the large power grid:
0≤Pbuy,t≤Ptr,max(20)
0≤Psell,t≤Ptr,max(21)
wherein, Ptr,maxRepresenting an interaction limit power;
(4) the energy storage related constraints specifically include:
1) charge and discharge power constraint:
0≤Pch,i,t≤Pch,max(22)
0≤Pdis,i,t≤Pdis,max(23)
in order to ensure the working quality of the energy storage system, the instantaneous charge-discharge power of the stored energy in unit time is generally controlled to be 0.2EessWithin, i.e.:
Pch,max=Pdis,max=0.2Eess(24)
2) And (3) state of charge constraint:
SOCmin≤SOCi,t≤SOCmax(25)
in the formula, SOCi,tRepresenting the ratio of the residual capacity of the stored energy at the current moment to the capacity of the stored energy in the full-charge state,SOCminrepresenting the upper limit of the state of charge, SOC, of the energy storage systemmaxRepresents a lower limit of the energy storage system state of charge;
3) restraint of charging and discharging modes:
0≤Bdis,t≤1 (27)
0≤Bch,t≤1 (28)
Bdis,t+Bch,t≤1 (29)
Bdis,t,Bch,t∈Z (30);
4) conservation of energy in the energy storage device:
wherein E isess,0Which represents the initial energy of the stored energy,representing the residual energy of the stored energy at the end of the scheduling period;
5) and (3) discharge depth constraint:
Dod,min≤Dod,t≤Dod,max(32)
wherein D isod,minLower limit of depth of discharge, Dod,maxAn upper bit discharge depth limit;
(5) operation constraints of the wind turbine:
0≤Pw,i,t≤Pwfore,i,t(34)
wherein, Pwfore,i,tAnd the active predicted output of the ith fan in the t period is shown.
Step 2, based on the improved bat algorithm, on the basis of satisfying the constraint condition, calculating the minimum value of the objective function to obtain the minimum operating cost of the wind-fire-storage combined system on the premise of the maximum wind power consumption, as shown in fig. 3, specifically according to the following steps:
step 2.1, setting initial parameters:
taking the output of each thermal power machine and the output of each wind power machine in the wind-fire-storage combined system as an individual in a population, and setting the population scale to be 10-25;
setting the sound intensity to be 0-1, the pulse rate to be 0-1 and the pulse frequency to be 0-2;
setting the iteration number to be 1000;
calculating a bat algorithm search dimension;
step 2.2, obtaining the position of the initial optimal individual through a Halton sequence, setting the moving boundary of the optimal individual according to a constraint condition, and enabling the position of the initial optimal individual to be the position of the optimal individual, wherein t is 1, and t is the current iteration number;
step 2.3, judging whether the current iteration times meet t ═ tmaxIf yes, outputting the position of the optimal individual and the cost corresponding to the optimal individual;
if not, then,updating the position of the optimal individual to obtain the position of the optimal individual with one updating, and calculating the cost F of the optimal individual with one updating according to the position of the optimal individual with one updating and the objective functionaWherein, updating the optimal individual position at one time is specifically obtained according to the following steps:
step 2.3.1, updating the pulse frequency of the optimal individual once:
f1=fmin+(fmax-fmin)·β (35)
wherein f is1Updated pulse frequency of the optimal individual, [ f [ ]min,fmax]For the frequency range, β is a random perturbation at [0,1 ]]Uniformly distributing the upper layer;
step 2.3.2, updating the pulse speed of the optimal individual at one time:
wherein,is the updated pulse velocity of the optimal individual,is the pulse velocity of the optimal individual for the last iteration,for the position of the optimal individual at the last iteration, x*The position of the current optimal individual;
step 2.3.3, updating the position of the optimal individual once:
step 2.3.4, judging whether the position of the optimal individual after the primary updating meets the constraint condition, and if so, taking the position of the updated individual as the position of the optimal individual after the primary updating; otherwise, repeating the steps 2.3.1-2.3.3 until the position of the optimal individual after one-time updating meets the constraint condition.
Step 2.4, the rand function randomly generates a rand, if the rand is more than riThen, the position of the optimum individual is updated again, and the cost F of the updated optimum individual is calculated based on the position of the updated optimum individual and the objective functionbWherein, updating the optimal individual position again is specifically obtained according to the following steps:
step 2.4.1, update the pulse frequency of the optimal individual again:
f2=fmin+(fmax-fmin)·β (35)
wherein f is2The pulse frequency of the optimum individual after the re-update, [ f [ ]min,fmax]For the frequency range, β is a random perturbation at [0,1 ]]Uniformly distributing the upper layer;
step 2.4.2, the pulse speed of the optimal individual is updated again:
wherein,is the pulse speed of the optimum individual after being updated again,is the pulse velocity of the optimal individual for the last iteration,for the position of the optimal individual at the last iteration, x is the current maximumThe location of the preferred individual;
step 2.4.3, update the position of the optimal individual again:
step 2.4.4, judging whether the position of the updated optimal individual meets the constraint condition, and if so, taking the position of the updated individual as the position of the updated optimal individual; otherwise, repeating the steps 2.4.1-2.4.3 until the updated position of the optimal individual meets the constraint condition.
Otherwise, repeating the step 2.4 until rand > ri
Step 2.5, judging whether rand satisfies rand < AiAnd F isa>FbIf so, the updated optimal individuals are set as the optimal individuals, and the optimal cost of the optimal individuals and the optimal cost of the last iteration are sequenced; simultaneously, when t is t +1, repeating the steps 2.2-2.4 until t is tmax
Otherwise, repeating the step 2.4-2.5 until whether the rand satisfies that rand < AiAnd F is1>F2
Example 1
An improved IEEE 30 node system is adopted for simulation analysis, nodes 1, 2, 5, 8, 11 and 13 are thermal power generating unit nodes, and the economic dispatching parameters of the conventional thermal power generating unit are shown in a table 1; 3 wind power plants are respectively added at the node 3, the node 7 and the node 21, and the installed capacity of a single fan is 70 MW. The energy storage system is configured according to 10% of installed capacity of wind power according to certain wind power storage demonstration project in China. The daily load curve is shown in fig. 1. The wind power prediction refers to an actual wind power plant of a power grid in a certain region of China, as shown in FIG. 2. Interaction with the large grid limits power to 60 MW. The 24h day is divided into three periods of peak, valley and average, and each period has different electricity purchasing prices as shown in table 2.
TABLE 1 conventional thermal power plant parameters
TABLE 2 Peak-valley flat time period electricity purchase and sale price
Analysis of scheduling results before and after algorithm improvement:
in order to verify the effectiveness of the improved algorithm, a simulation experiment is performed on a representative one-dimensional univariate model, the initial population number is 10, 60 sampling periods are total, and 50 times of simulation are performed, and the result is shown in table 3.
TABLE 3 Bat Algorithm front and rear Performance comparison
From the simulation result, the improved bat algorithm is better in precision than the original algorithm, because the improved algorithm is more uniform and random compared with the unmodified algorithm in the initial population, and the correlation generated under the high-dimensional condition is avoided.

Claims (9)

1. The wind-fire-storage combined system optimal scheduling method based on the improved bat algorithm is characterized by comprising the following steps:
step 1, establishing a daily running cost objective function with the lowest total running cost of a system on the premise of the maximum wind energy absorption beam;
constraint conditions of the wind-fire-storage combined system;
and 2, based on an improved bat algorithm, calculating the minimum value of the objective function on the basis of meeting the constraint condition to obtain the minimum running cost of the wind-fire storage combined system on the premise of the maximum wind power consumption.
2. The optimal scheduling method of the wind, fire and storage combined system based on the improved bat algorithm as claimed in claim 1, wherein the step 1 of establishing the objective function of the day-ahead operation cost is specifically performed according to the following steps:
step 1.1, establishing a lowest total operation cost objective function of the wind, fire and storage combined system:
minF1=f1+f2+f3(1)
wherein f is1Cost of the fire-electric unit in the combined wind-fire-storage system, f2Interaction cost, f, for wind-fire-storage combined system3The energy storage cost in the wind-fire energy storage combined system is saved;
establishing a maximum wind energy absorption objective function of the wind-fire-storage combined system:
wherein, tPw,i,tActive scheduling processing of the ith fan in the wind, fire and storage combined system in the period t, NwThe total number of the fans is N, the total time period number is represented by N, and delta t is a unit time period;
step 1.2, obtaining an objective function of the day-ahead running cost according to the minimum total running cost objective function and the maximum wind energy consumption objective function:
3. the optimal scheduling method of the wind, fire and storage combined system based on the improved bat algorithm as claimed in claim 2, wherein the cost of the fire-electric generating set in the step 1.1 is calculated according to the following steps:
step 1.1.1, calculating the fuel cost of the thermal power generating unit:
wherein, ai、biAnd is ciCoefficient of operating costs, P, of thermal power generating unitsG,i,tThe active output of the ith conventional thermal power generating unit at the moment t is represented;
calculating the maintenance cost of the thermal power generating unit:
fmain,i,t=diPG,i,t·Δt (5)
wherein d isiIs the coefficient of the operating cost of the thermal power generating unit;
calculating the starting and stopping cost of the thermal power generating unit:
fstate,i,t=(Uon,G,i·Bon,G,i,t+Uoff,G,i·Boff,G,i,t)·Δt (6)
wherein, Uon,G,iRepresents the opening state of the ith conventional thermal power generating unit in a time period t, Bon,G,i,tTo represent the stop state of the ith conventional thermal power generating unit in the time period t, Uoff,G,iRepresents the starting cost of the ith conventional thermal power generating unit in the time period t, Boff,G,i,tRepresenting the stopping cost of the ith conventional thermal power generating unit in the time period t;
step 1.1.2, calculating the cost of the thermal power generating unit according to the fuel cost, the maintenance cost and the starting and stopping cost:
step 1.1 the interaction cost of the wind-fire-storage combined system is specifically carried out according to the following steps:
step a, calculating the cost of the wind-fire-storage combined system for purchasing electric energy from a large power grid:
fbuy,t=Ubuy·Bbuy,t·Pbuy,t·Δt (8)
wherein, UbuyPurchase of electricity prices for wind, fire and storage combined systems to large grids, Bbuy,tThe variable is 0-1 for power purchase, 0 represents no power purchase, and 1 represents power purchase Pbuy,tPurchasing from large power grid for wind-fire-storage combined systemThe power of the electrical energy;
calculating the cost of the wind-fire-storage combined system for selling electric energy to a large power grid:
fsell,t=Usell·Bsell,t·Psell,t·Δt (9)
wherein, UsellSelling electricity prices for large grids for combined wind, fire and storage systems, Bsell,tWhether electricity is sold or not is a variable of 0-1, 0 represents that electricity is not sold, 1 represents that electricity is sold, and Psell,tSelling the power of electric energy to a large power grid for the wind-fire-storage combined system;
step b, calculating the interaction cost of the wind-fire-storage combined system according to the cost of the wind-fire-storage combined system for purchasing electric energy from the large power grid and the cost obtained by the wind-fire-storage combined system for selling the electric energy from the large power grid:
the energy storage cost in the wind-fire-storage combined system is calculated according to the following method:
step A, calculating the maintenance cost of the wind-fire-storage combined system:
fomb,t=(Komb·|Bch,t·Pch,t+Bdis,tPdis,t|)·Δt (11)
in the formula, KombRepresenting a maintenance cost factor of the stored energy, Bch,tRepresents the charging state of the stored energy in the period t, and is a variable from 0 to 1, 0 represents no charging, 1 represents charging, and Pch,tCharging power for storing energy for a period of t, Bdis,tThe discharge state of energy storage in t period is represented as 0-1 variable, 0 represents no discharge, 1 represents discharge, and Pdis,tThe discharge power for storing energy in the t period;
calculating depreciation cost of the fire storage combined system:
in the formula, EessFor a rated energy storage capacity, Nlife,tIs shown asCycle life of energy storage at time t;
calculating the electric energy loss cost of the fire storage combined system:
in the formula of UmarketIndicating the price of electricity in the market unit, PesslossFor electric energy consuming power, NessIndicating the number of energy storage devices in the distribution network, Bess,iThe dimension of the change of state of the first energy storage device in a certain time period compared with the previous time period is 1 if the state is changed, otherwise, the change of state is 0, and delta Pesslo,iIndicating the loss generated by the ith energy storage device during state switching, ηin,ηoutRespectively representing the charge and discharge efficiency of stored energy;
and B, calculating the energy storage cost in the wind-fire-storage combined system according to the maintenance cost, depreciation cost and electric energy loss cost of the wind-fire-storage combined system:
4. the optimal scheduling method of a combined wind, fire and storage system based on an improved bat algorithm as claimed in claim 1, wherein the constraint conditions in step 1 comprise:
(1) and power balance constraint:
in the formulaRepresenting the output of all thermal power generating units in the period t,represents the output of all fans in the period of t, PlRepresenting the active load of the system in the period t;
(2) the operation constraint of the thermal power generating unit specifically comprises the following steps:
1) and (3) unit power constraint:
PG,i,min≤PG,i,t≤PG,i,max(16)
wherein, PG,i,minUpper limit of output power, P, of the ith thermal power generating unitG,i,maxRepresenting the lower limit of the output power of the ith thermal power generating unit;
2) minimum start-stop time constraint:
(Bon,G,i,t-1-Bon,G,i,t)·(Ton,i,t-Ton,i,min)≥0 (17)
(Bon,G,i,t-Bon,G,i,t-1)·(Toff,i,t-Toff,i,min)≥0 (18)
wherein, Ton,i,tIndicating the starting duration time T of the ith thermal power generating unit in the period Toff,i,tShutdown duration of i thermal power generating units in T period, Ton,i,minIndicating the minimum operating time, T, of the thermal power generating unitoff,i,minRepresenting a minimum shutdown time of the thermal power generating unit;
3) and (3) climbing restraint:
-rd,i·Δt≤PG,i,t-PG,i,t-1≤ru,i·Δt (19)
wherein r isu,iRepresents the maximum upward climbing speed r of the ith thermal power generating unit in unit timed,iThe maximum downward climbing speed of the ith thermal power generating unit in unit time is represented;
(3) and (3) interactive power flow limit constraint between the micro-grid and the large power grid:
0≤Pbuy,t≤Ptr,max(20)
0≤Psell,t≤Ptr,max(21)
wherein, Ptr,maxRepresenting an interaction limit power;
(4) the energy storage related constraints specifically include:
1) charge and discharge power constraint:
0≤Pch,i,t≤Pch,max(22)
0≤Pdis,i,t≤Pdis,max(23)
in order to ensure the working quality of the energy storage system, the instantaneous charge-discharge power of the stored energy in unit time is generally controlled to be 0.2EessThe following steps:
Pch,max=Pdis,max=0.2Eess(24)
2) and (3) state of charge constraint:
SOCmin≤SOCi,t≤SOCmax(25)
in the formula, SOCi,tRepresenting the ratio of the residual capacity of the stored energy at the current moment to the capacity of the stored energy in the full-charge state,SOCminrepresenting the upper limit of the state of charge, SOC, of the energy storage systemmaxRepresents a lower limit of the energy storage system state of charge;
3) restraint of charging and discharging modes:
0≤Bdis,t≤1 (27)
0≤Bch,t≤1 (28)
Bdis,t+Bch,t≤1 (29)
Bdis,t,Bch,t∈Z (30);
4) conservation of energy in the energy storage device:
wherein E isess,0Which represents the initial energy of the stored energy,representing the residual energy of the stored energy at the end of the scheduling period;
5) and (3) discharge depth constraint:
Dod,min≤Dod,t≤Dod,max(32)
wherein D isod,minLower limit of depth of discharge, Dod,maxAn upper bit discharge depth limit;
(5) operation constraints of the wind turbine:
0≤Pw,i,t≤Pwfore,i,t(34)
wherein, Pwfore,i,tAnd the active predicted output of the ith fan in the t period is shown.
5. The optimal scheduling method of the combined wind, fire and storage system based on the improved bat algorithm as claimed in claim 1, wherein the step 2 is specifically performed according to the following method:
step 2.1, setting initial parameters:
setting the population scale by taking the output of each thermal power machine and the output of each wind power machine in the wind-fire-storage combined system as an individual in a population;
setting the strength, pulse rate and pulse frequency of the sound equipment;
setting the number of iterations tmax
Calculating a bat algorithm search dimension;
step 2.2, obtaining the position of the initial optimal individual through a Halton sequence, setting the moving boundary of the optimal individual according to a constraint condition, and enabling the position of the initial optimal individual to be the position of the optimal individual, wherein t is 1, and t is the current iteration number;
step 2.3, judging whether the current iteration times meet t ═ tmaxIf yes, outputting the position of the optimal individual and the cost corresponding to the optimal individual;
otherwise, updating the position of the optimal individual to obtain the position of the optimal individual for one-time updating, and calculating the cost F of the optimal individual after one-time updating according to the position of the optimal individual for one-time updating and the objective functiona
Step 2.4, randomly generating a rand if rand is more than riThen, the optimal individual position is updated again, and the cost F of the updated optimal individual is calculated according to the updated optimal individual position and the objective functionb
Otherwise, repeating the step 2.4 until rand > ri
Step 2.5, judging whether rand satisfies rand < AiAnd F isa>FbIf so, the updated optimal individuals are set as the optimal individuals, and the optimal cost of the optimal individuals and the optimal cost of the last iteration are sequenced; simultaneously, when t is t +1, repeating the steps 2.2-2.4 until t is tmax
Otherwise, repeating the step 2.4-2.5 until whether the rand satisfies that rand < AiAnd F is1>F2
6. The optimal scheduling method of wind, fire and storage combined system based on the improved bat algorithm as claimed in claim 5, wherein the population size in step 2.1 is 10-25, the sound intensity is 0-1, the pulse rate is 0-1, the pulse frequency is 0-2, and the number of iterations is 1000.
7. The optimal scheduling method of a wind, fire and storage combined system based on the improved bat algorithm as claimed in claim 5, wherein the position of the optimal individual is updated in the step 2.3 specifically according to the following steps:
step 2.3.1, updating the pulse frequency of the optimal individual once:
f1=fmin+(fmax-fmin)·β (35)
wherein f is1Updated pulse frequency of the optimal individual, [ f [ ]min,fmax]For the frequency range, β is a random perturbation at [0,1 ]]Uniformly distributing the upper layer;
step 2.3.2, updating the pulse speed of the optimal individual at one time:
wherein,is the pulse speed of the optimal individual after one update,is the pulse velocity of the optimal individual for the last iteration,for the position of the optimal individual at the last iteration, x*The position of the current optimal individual;
step 2.3.3, updating the position of the optimal individual once:
step 2.3.4, judging whether the position of the optimal individual after the primary updating meets the constraint condition, and if so, taking the position of the individual after the primary updating as the position of the optimal individual after the primary updating; otherwise, repeating the steps 2.3.1-2.3.3 until the updated position of the optimal individual meets the constraint condition.
8. The optimal scheduling method of the combined wind, fire and storage system based on the improved bat algorithm as claimed in claim 5, wherein the location of the optimal individual is updated again in the step 2.4, specifically according to the following steps:
step 2.4.1, update the pulse frequency of the optimal individual again:
f2=fmin+(fmax-fmin)·β (35)
wherein f is2The pulse frequency of the optimum individual after the re-update, [ f [ ]min,fmax]For the frequency range, β is a random perturbation at [0,1 ]]Uniformly distributing the upper layer;
step 2.4.2, the pulse speed of the optimal individual is updated again:
wherein,is the pulse speed of the optimum individual after being updated again,is the pulse velocity of the optimal individual for the last iteration,for the position of the optimal individual at the last iteration, x*The position of the current optimal individual;
step 2.4.3, update the position of the optimal individual again:
step 2.4.4, judging whether the position of the updated optimal individual meets the constraint condition, and if so, taking the position of the updated individual as the position of the updated optimal individual; otherwise, repeating the steps 2.4.1-2.4.3 until the updated position of the optimal individual meets the constraint condition.
9. The optimal scheduling method of wind, fire and storage combined system based on improved bat algorithm as claimed in claim 5, wherein said rand in step 2.4 is randomly generated by rand function.
CN201811533847.0A 2018-12-14 2018-12-14 Wind, fire and storage combined system optimized scheduling method based on improved bat algorithm Active CN110137938B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811533847.0A CN110137938B (en) 2018-12-14 2018-12-14 Wind, fire and storage combined system optimized scheduling method based on improved bat algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811533847.0A CN110137938B (en) 2018-12-14 2018-12-14 Wind, fire and storage combined system optimized scheduling method based on improved bat algorithm

Publications (2)

Publication Number Publication Date
CN110137938A true CN110137938A (en) 2019-08-16
CN110137938B CN110137938B (en) 2023-03-21

Family

ID=67568362

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811533847.0A Active CN110137938B (en) 2018-12-14 2018-12-14 Wind, fire and storage combined system optimized scheduling method based on improved bat algorithm

Country Status (1)

Country Link
CN (1) CN110137938B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113488990A (en) * 2021-06-15 2021-10-08 国网山东省电力公司济宁市任城区供电公司 Micro-grid optimization scheduling method based on improved bat algorithm

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104124708A (en) * 2014-07-25 2014-10-29 国家电网公司 Coordinative optimization unit combination method of energy
CN104795846A (en) * 2015-04-24 2015-07-22 清华大学 Optimized operation method of pumped-storage power station and wind power combined system
CN107508328A (en) * 2017-04-08 2017-12-22 东北电力大学 Consider the association system energy optimizing method of wind electricity digestion
CN107844910A (en) * 2017-11-20 2018-03-27 华北电力大学(保定) The more power supply joint optimal operation operation methods coordinated based on wind core
WO2018059096A1 (en) * 2016-09-30 2018-04-05 国电南瑞科技股份有限公司 Combined decision method for power generation plans of multiple power sources, and storage medium
CN108322139A (en) * 2018-03-01 2018-07-24 东北电力大学 It is a kind of meter and overall cost wind-powered electricity generation-photovoltaic-photo-thermal power generation combined scheduling method

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104124708A (en) * 2014-07-25 2014-10-29 国家电网公司 Coordinative optimization unit combination method of energy
CN104795846A (en) * 2015-04-24 2015-07-22 清华大学 Optimized operation method of pumped-storage power station and wind power combined system
WO2018059096A1 (en) * 2016-09-30 2018-04-05 国电南瑞科技股份有限公司 Combined decision method for power generation plans of multiple power sources, and storage medium
CN107508328A (en) * 2017-04-08 2017-12-22 东北电力大学 Consider the association system energy optimizing method of wind electricity digestion
CN107844910A (en) * 2017-11-20 2018-03-27 华北电力大学(保定) The more power supply joint optimal operation operation methods coordinated based on wind core
CN108322139A (en) * 2018-03-01 2018-07-24 东北电力大学 It is a kind of meter and overall cost wind-powered electricity generation-photovoltaic-photo-thermal power generation combined scheduling method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
李守东 等: "考虑风电消纳的电热联合系统多源协调优化运行", 《太阳能学报》 *
王振浩 等: "考虑风电消纳的风电-电储能-蓄热式电锅炉联合系统能量优化", 《中国电机工程学报》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113488990A (en) * 2021-06-15 2021-10-08 国网山东省电力公司济宁市任城区供电公司 Micro-grid optimization scheduling method based on improved bat algorithm
CN113488990B (en) * 2021-06-15 2023-09-08 国网山东省电力公司济宁市任城区供电公司 Micro-grid optimal scheduling method based on improved bat algorithm

Also Published As

Publication number Publication date
CN110137938B (en) 2023-03-21

Similar Documents

Publication Publication Date Title
Hou et al. Multi-objective economic dispatch of a microgrid considering electric vehicle and transferable load
Yousif et al. An optimal dispatch strategy for distributed microgrids using PSO
CN110350523B (en) Multi-energy complementary optimization scheduling method based on demand response
CN102694391B (en) Day-ahead optimal scheduling method for wind-solar storage integrated power generation system
CN111404206B (en) Wind-solar energy storage power generation system capacity double-layer planning method considering investment return constraint
CN112583017B (en) Hybrid micro-grid energy distribution method and system considering energy storage operation constraint
CN111753431B (en) Computing method and computing equipment for optimal configuration in comprehensive energy system
CN111210079B (en) Operation optimization method and system for distributed energy virtual power plant
CN111009895B (en) Microgrid optimal scheduling method, system and equipment
Kumar et al. A New Approach to Design and Optimize Sizing of Hybrid Microgrids in Deregulated Electricity Environment
CN112836849A (en) Virtual power plant scheduling method considering wind power uncertainty
CN116914821A (en) Micro-grid low-carbon optimal scheduling method based on improved particle swarm optimization
CN111049179A (en) New energy power generation system multi-objective optimization scheduling method considering uncertainty
CN110889581A (en) Electric vehicle-participated transformer area optimal scheduling method and system
CN112883630A (en) Day-ahead optimized economic dispatching method for multi-microgrid system for wind power consumption
CN114781740B (en) Comprehensive energy system operation optimizing device considering user demand response characteristic under carbon emission cost
CN114844124B (en) Operation control method of comprehensive energy system based on target optimization
CN114493143A (en) Virtual power plant multi-objective optimization scheduling system and method for grid-connected micro-grid
CN110137938B (en) Wind, fire and storage combined system optimized scheduling method based on improved bat algorithm
CN110119850B (en) Heat storage amount two-stage optimization scheduling method based on photo-thermal power generation adjustment
CN115483718A (en) Electric-qi deficiency simulated power plant double-layer optimal scheduling method considering energy storage and demand response
Hu et al. Research on intelligent peak-cutting and valley-filling charging and swapping mode based on potential game theory
Zhang et al. Convex optimization of battery energy storage station in a micro-grid
Tianqi et al. Analysis of Optimal Scheduling Model for Virtual Power Plants Considering the Cost of Battery Loss
Lu et al. Efficient Energy Management of a Time-of-Use Rate Industrial User for Smart Cities

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