CN112186766A - Multistage decomposition method based on Benders decomposition - Google Patents

Multistage decomposition method based on Benders decomposition Download PDF

Info

Publication number
CN112186766A
CN112186766A CN202011112195.0A CN202011112195A CN112186766A CN 112186766 A CN112186766 A CN 112186766A CN 202011112195 A CN202011112195 A CN 202011112195A CN 112186766 A CN112186766 A CN 112186766A
Authority
CN
China
Prior art keywords
constraint
decomposition
safety
scene
benders
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
CN202011112195.0A
Other languages
Chinese (zh)
Other versions
CN112186766B (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.)
China Three Gorges University CTGU
Original Assignee
China Three Gorges University CTGU
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 China Three Gorges University CTGU filed Critical China Three Gorges University CTGU
Priority to CN202011112195.0A priority Critical patent/CN112186766B/en
Publication of CN112186766A publication Critical patent/CN112186766A/en
Application granted granted Critical
Publication of CN112186766B publication Critical patent/CN112186766B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00—Circuit arrangements for ac mains or ac distribution networks
    • H02J3/003—Load forecast, e.g. methods or systems for forecasting future load demand
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/15—Correlation function computation including computation of convolution operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/067—Enterprise or organisation modelling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/06—Energy or water supply
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00—Circuit arrangements for ac mains or ac distribution networks
    • H02J3/04—Circuit arrangements for ac mains or ac distribution networks for connecting networks of the same frequency but supplied from different sources
    • H02J3/06—Controlling transfer of power between connected networks; Controlling sharing of load between connected networks
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00—Circuit arrangements for ac mains or ac distribution networks
    • H02J3/38—Arrangements for parallely feeding a single network by two or more generators, converters or transformers
    • H02J3/381—Dispersed generators
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00—Circuit arrangements for ac mains or ac distribution networks
    • H02J3/38—Arrangements for parallely feeding a single network by two or more generators, converters or transformers
    • H02J3/46—Controlling of the sharing of output between the generators, converters, or transformers
    • H02J3/48—Controlling the sharing of the in-phase component
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
    • H02J2203/10—Power transmission or distribution systems management focussing at grid-level, e.g. load flow analysis, node profile computation, meshed network optimisation, active network management or spinning reserve management
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
    • H02J2203/20—Simulating, e g planning, reliability check, modelling or computer assisted design [CAD]
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2300/00—Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation
    • H02J2300/20—The dispersed energy generation being of renewable origin
    • H02J2300/22—The renewable source being solar energy
    • H02J2300/24—The renewable source being solar energy of photovoltaic origin
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2300/00—Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation
    • H02J2300/20—The dispersed energy generation being of renewable origin
    • H02J2300/28—The renewable source being wind energy
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2300/00—Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation
    • H02J2300/40—Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation wherein a plurality of decentralised, dispersed or local energy generation technologies are operated simultaneously
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02E—REDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
    • Y02E10/00—Energy generation through renewable energy sources
    • Y02E10/70—Wind energy
    • Y02E10/76—Power conversion electric or electronic aspects

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Mathematical Physics (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Computational Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Power Engineering (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Algebra (AREA)
  • Software Systems (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Educational Administration (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Databases & Information Systems (AREA)
  • Health & Medical Sciences (AREA)
  • Development Economics (AREA)
  • Public Health (AREA)
  • Water Supply & Treatment (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Supply And Distribution Of Alternating Current (AREA)
  • Pharmaceuticals Containing Other Organic And Inorganic Compounds (AREA)

Abstract

A multistage decomposition method based on Benders decomposition is used for decomposing problems of a day-ahead scheduling model of unit combination decision, and comprises a UC decision main problem in a basic scene, a network safety checking sub-problem in the basic scene and a robustness checking sub-problem in a worst scene after decomposition. The method comprises the following steps when the problem decomposition is carried out: step 1, modeling and solving a UC main problem; step 2, modeling and solving a safety subproblem in a basic scene; and 3, modeling and solving the safety subproblem under the uncertain scene.

Description

Multistage decomposition method based on Benders decomposition
Technical Field
The invention discloses a multistage decomposition method based on Benders decomposition, and relates to the field of power system scheduling.
Background
Wind power and photovoltaic are pollution-free and green renewable energy sources, are widely distributed, have high energy density and are suitable for large-scale development, so that wind power and photovoltaic power generation technologies are highly valued by countries in the world. However, because the output of the power grid has the characteristics of randomness and volatility, the large-scale access to the power grid brings great challenges to the traditional scheduling method, and therefore, the research on the day-ahead scheduling method of the power system under the large-scale access of various new energy resources has important theoretical value and practical significance.
At present, a plurality of experts and scholars research the day-ahead scheduling problem of an electric power system under new energy access from different angles, but generally only a single uncertainty variable is considered, however, an actual electric power system comprises multiple uncertainty factors such as wind power output, photovoltaic output and load prediction error, and the existing day-ahead scheduling only considering single uncertainty is obviously difficult to guarantee the decision effectiveness and influence the economical efficiency of system operation. Therefore, considering the influence of multiple uncertainty factors in the scheduling problem has become a hot point for the research of experts in recent years.
Disclosure of Invention
Aiming at the defects of the existing method, the invention provides an improved robust scheduling method which comprehensively considers uncertainty and correlation of load, wind power and photovoltaic.
The technical scheme adopted by the invention is as follows:
a power system day-ahead robust scheduling method considering multiple uncertainties and correlations comprises the following steps:
1) the method comprises the following steps of (1) taking multiple random factors into consideration for day-ahead robust scheduling modeling;
2) solving a worst scene;
3) solving the model by a Benders decomposition method;
in the step 1), firstly, the day-ahead robust scheduling modeling of multiple random factors is considered; then carrying out day-ahead scheduling modeling in a basic scene; then carrying out day-ahead scheduling modeling in an uncertain scene;
in the step 2), firstly, probability density function modeling of random factors is carried out, then samples are sampled, and then orthogonal transformation matrix derivation is carried out; then, solving a worst scene;
in the step 3), firstly modeling a UC main problem, and then modeling a safety sub-problem in a basic scene; and then modeling a safety sub-problem considering uncertainty.
In the step 1), multiple random factors comprise wind power, photovoltaic and load prediction error factors.
In the step 1), the unit combination decision is divided into a basic scene and a worst scene for modeling respectively.
The basic scenario is based on the uncertainty factor power predicted value, the minimum total operation cost of the system is taken as a target, and various conventional constraint conditions of the system in a deterministic environment are considered.
The worst scenario is based on the maximum fluctuation output of the uncertain power output, and the uncertain constraint condition is considered.
In step 2), the worst scene is sought, and then robustness check is performed by directly using the worst scene.
Firstly, probability density functions of wind power, photovoltaic and load are respectively constructed by utilizing nonparametric kernel density estimation, then, a Latin hypercube sampling is utilized to generate samples, finally, a Cholesky decomposition method is adopted to convert the random samples with correlation into mutually independent random samples, and the worst scene is determined on the basis of the mutually independent random samples.
If the number of load samples based on the historical data is n, constructing a probability density model of the load based on a non-parametric kernel density estimation method as follows:
Figure RE-GDA0002804791830000021
in the formula, phi (P)d) Is a probability density function of the load; k (P)dL) is a kernel function; pdmIs the m-th sample value in the load sample, and l is the bandwidth.
Selecting a Gaussian function as a kernel function of the load probability density model, and solving the bandwidth l to obtain a probability density function phi (P) of the system loadd)。
Calculating the probability density function phi (P) of the wind power outputw) And a photovoltaic output probability density function phi (P)v). As shown in formula (2) and formula (3).
Figure RE-GDA0002804791830000022
In the formula, phi (P)w) Is a probability density function of the load; k (P)wL) is a kernel function; pwmAnd l is the bandwidth, wherein the m is the sample value in the wind power output sample.
Figure RE-GDA0002804791830000023
In the formula, phi (P)v) Is a probability density function of the load; k (P)vL) is a kernel function; pvmAnd l is the bandwidth, wherein the value is the mth sample value in the photovoltaic output sample.
Latin hypercube sampling is adopted for hierarchical sampling.
Let the sampling scale be N, Ym＝Fm(Xm) Denotes the m-th random variable XmThe specific sampling process of the probability density function of (1) is as follows: will be interval [0,1]Equally dividing the sampling value into N equal parts, selecting the middle value of each subinterval, and obtaining the sampling value through the inverse function of the middle value
Figure RE-GDA0002804791830000036
And obtaining a sample matrix of all the random variables after sampling of all the random variables is completed.
The method comprises the steps of describing the correlation among loads, wind power and photovoltaic power generation by utilizing a correlation coefficient matrix, and setting a sample matrix obtained by Latin hypercube sampling as W ═ W1,w2,…wl]TThe matrix of correlation coefficients is Cw：
Figure RE-GDA0002804791830000031
The elements of the matrix can be obtained by equation (5):
Figure RE-GDA0002804791830000032
in the formula:
Figure RE-GDA0002804791830000033
and
Figure RE-GDA0002804791830000034
are respectively an input variable wiAnd wjStandard deviation of (d); cov(wi,wj) As an input variable wiAnd wjThe covariance of (a). Matrix of correlation coefficients CwIf it is a positive definite matrix, Cholesky decomposition may be performed on the coefficient matrix:
Cw＝GGT (6)
in the formula: g is a lower triangular matrix, in which the elements can be found by equation (7):
Figure RE-GDA0002804791830000035
assuming an orthogonal matrix B, the input random variable W with correlation can be converted into an uncorrelated random variable Y:
Y＝BW (8)
matrix C of correlation coefficients due to uncorrelated random variables YYIs an identity matrix I, and thus:
CY＝ρ(Y,YT)＝ρ(BW,WTBT)＝Bρ(W,WT)BT＝BCWBT＝I (9)
further, it can be obtained from the formula (6):
CY＝BCWBT＝BGGTBT＝(BG)(BG)T＝I (10)
derived from the above equation:
B＝G-1 (11)
on the premise that the input uncertainty W having correlation is known, it can be changed to an uncorrelated random variable Y by orthogonal transformation matrix.
And converting the load, wind power and photovoltaic output matrixes with correlation into independent matrixes through the obtained orthogonal transformation matrix, eliminating the correlation among the independent matrixes, and further solving the worst scene through a method of linear superposition of the worst scene.
Solving the model by adopting a Benders decomposition method; decomposing an original problem into a main problem and two sub-problems, wherein the main problem is a UC decision main problem under a basic scene, and the two sub-problems are respectively a network safety check sub-problem under the basic scene and a robust check sub-problem under a worst scene;
the method comprises the following steps: firstly, modeling a UC main problem; then, modeling a safety subproblem in a basic scene; then, modeling a safety subproblem considering uncertainty;
the method comprises the following specific steps:
1): UC Main problem modeling
The UC major problem includes the target function (1) and the constraint equations (3) through (9), as well as all the Benders cuts generated.
2): safety sub-problem modeling under basic scene
The network security syndrome problem under the basic scene is shown as formula (27), and the network security of the scheduling scheme is ensured by checking the load flow out-of-limit condition of the UC main problem.
Figure RE-GDA0002804791830000041
Figure RE-GDA0002804791830000042
In the formula: lambda [ alpha ]1,l,t,λ2,l,tIs a dual variable of the network security constraint; v. ofl,tIs the relaxation variable.
Introducing a relaxation variable v into a subprobleml,tThe role of the method is to temporarily relieve the network security constraint by using a relaxation variable when the constraint condition cannot be met so as to ensure that the subproblem is always solved. V obtained if final optimizationl,tIf the maximum value is greater than the given safety threshold value, the optimal unit combination scheme obtained by the main problem cannot meet the network safety constraint, and therefore the Benders cut as follows needs to be returned:
Figure RE-GDA0002804791830000043
3): uncertainty-aware safety sub-problem modeling
The safety check model under the uncertain scene is shown as a formula (29), and the safety check model is checked in the worst scene
Figure RE-GDA0002804791830000044
And
Figure RE-GDA0002804791830000045
whether the safety constraint can be met.
Figure RE-GDA0002804791830000046
S.t.
Figure RE-GDA0002804791830000051
Figure RE-GDA0002804791830000052
Figure RE-GDA0002804791830000053
Figure RE-GDA0002804791830000054
Figure RE-GDA0002804791830000055
Figure RE-GDA0002804791830000056
Figure RE-GDA0002804791830000057
0≤v1,lt,v2t,v3t (29)
In the formula:
Figure RE-GDA0002804791830000058
and
Figure RE-GDA0002804791830000059
the actual values of the unit output, the wind power output, the photovoltaic output and the load under the worst scene are obtained. Lambda [ alpha ]1,it,λ2,it,μ1,it,μ2,it,η1,it,η2,itIs a dual variable of a rotation standby constraint, a unit capacity constraint and a climbing constraint.
And if the safety constraint cannot be met, returning to the Benders cut formula (30) to the main problem, wherein the main problem serves as a constraint condition, so that the unit combination and output scheme can be adaptively adjusted on the worst scene to meet the network safety constraint and the power balance.
Figure RE-GDA00028047918300000510
Through the steps, the power system day-ahead robust scheduling considering multiple uncertainties and correlations is completed.
The invention has the following technical effects:
1) compared with the traditional method, on one hand, the method can effectively account for multiple uncertain factors and the correlation thereof, thereby improving the economical efficiency of system operation while ensuring the robustness of a scheduling decision scheme; on the other hand, the improved robust scheduling model effectively avoids solving the unit combination problem in a massive scene, and has higher solving efficiency.
2) The robust optimization method is improved by introducing a Cholesky decomposition method, so that the worst scene is directly determined without multi-scene load flow calculation, and the applicability and the solving efficiency of the robust optimization model are effectively improved.
Drawings
FIG. 1 is a block diagram of the overall modeling of the present invention;
FIG. 2 is a flow chart of a worst case scenario extraction of the present invention;
FIG. 3 is a block diagram of the general concept of the algorithm of the present invention;
FIG. 4 illustrates wind and photovoltaic active power output curves according to an embodiment of the present invention;
FIG. 5 is a table of worst scenario contrast at time 1;
FIG. 6 is a table of comparison results of scheduling costs from day-ahead;
fig. 7 is a table comparing the calculated efficiencies.
Detailed Description
A power system day-ahead robust scheduling method considering multiple uncertainties and correlations comprises the following steps:
step 1: day-ahead scheduling modeling in basic scenarios
The method is based on a robust optimization thought, and a day-ahead scheduling model considering wind power, photovoltaic and load prediction error uncertainty is constructed. The method divides the unit combination decision into a basic scene and a worst scene for respectively modeling, wherein the basic scene takes uncertainty factor power prediction value as a basis, takes the minimum total operation cost of the system as a target, and simultaneously considers various conventional constraint conditions of the system in a deterministic environment, thereby ensuring the economy of the scheduling decision; in the worst scene, the maximum fluctuation output of the uncertain power output is taken as the basis, and the uncertain constraint condition is considered, so that the robustness of the decision scheme in the basic scene in the uncertain environment is ensured. The model block diagram is shown in fig. 1.
Step 1.1: day-ahead scheduling modeling in a basic scenario: including objective functions and constraints
1) Determining an objective function containing fuel cost and unit start-stop cost of a conventional unit:
Figure RE-GDA0002804791830000061
wherein:
Figure RE-GDA0002804791830000062
in the formula:
Figure RE-GDA0002804791830000063
representing the active output of the unit i at the moment t；
Figure RE-GDA0002804791830000064
Representing the state of the unit i at the time t;
Figure RE-GDA0002804791830000065
for the cost of starting up and stopping the machine, ai、bi、ciIs a parameter of the generating cost function of the unit.
2) Constraints contained in the model are established, such as:
(1) system power balance constraint, under the condition of not counting network loss:
Figure RE-GDA0002804791830000066
in the formula:
Figure RE-GDA0002804791830000067
and the predicted values of the wind power output and the load power at the moment t and the photovoltaic power generation output are obtained.
(2) And (3) output constraint of a conventional unit:
Figure RE-GDA0002804791830000068
in the formula: pi minAnd Pi maxAnd respectively representing the maximum and minimum active output of the thermal power generating unit i.
(3) Unit ramp rate constraint
Ascending and climbing rate constraint
Figure RE-GDA0002804791830000071
Descending and climbing rate constraint
Figure RE-GDA0002804791830000072
In the formula: URi,DRiAnd the climbing power of the conventional unit is limited.
(4) Conventional unit start-stop time constraints
Figure RE-GDA0002804791830000073
Figure RE-GDA0002804791830000074
In the formula:
Figure RE-GDA0002804791830000075
for the on-off time, T, of unit i at time Ton,iToff,iAre minimum boot and downtime constraints.
(5) Network security constraints
Figure RE-GDA0002804791830000076
In the formula:
Figure RE-GDA0002804791830000077
for maximum current constraints of the line, SFl,mIs the node power transfer factor. U (m), D (m), W (m) and V (m) are respectively the bus bar sets where the conventional unit, the load, the wind power and the photovoltaic are located.
Step 1.2: day-ahead scheduling modeling in uncertain scenes
The day-ahead unit combination and the unit output plan obtained in the basic scene should ensure the robustness of the system in the uncertain environment, so the day-ahead plan needs to be checked by using the system constraint conditions in the uncertain environment. It should be noted that in the actual calculation, the worst scenario may be first sought, and then the worst scenario may be directly utilized for robustness check.
Establishing constraints in the model:
(1) system power balance constraint, under the condition of not counting network loss:
Figure RE-GDA0002804791830000078
in the formula:
Figure RE-GDA0002804791830000079
and
Figure RE-GDA00028047918300000710
the actual values of wind power output, photovoltaic output and load under uncertain conditions.
(2) And (3) output constraint of a conventional unit:
Figure RE-GDA00028047918300000711
in the formula:
Figure RE-GDA00028047918300000712
the actual output of the conventional unit under the uncertain condition is realized.
(3) Unit ramp rate constraint
Ascending and climbing rate constraint
Figure RE-GDA00028047918300000713
Descending and climbing rate constraint
Figure RE-GDA00028047918300000714
(4) Rotational reserve capacity constraint
Figure RE-GDA0002804791830000081
In the formula:
Figure RE-GDA0002804791830000082
the device is used for the positive and negative rotation of the conventional unit for standby.
(5) Network security constraints
Figure RE-GDA0002804791830000083
In the formula:
Figure RE-GDA0002804791830000084
for maximum current constraints of the line, SFl,mIs the node power transfer factor. U (m), D (m), W (m) and V (m) are respectively the bus bar sets where the conventional unit, the load, the wind power and the photovoltaic are located.
Step 2: worst scenario solution
As can be seen from step 1, in the actual calculation, the worst scenario may be first sought, and then the worst scenario may be directly used for robustness check. Therefore, the invention provides a method for rapidly calculating the worst scene suitable for multiple correlation randomness factors based on the Cholesky decomposition theory. Firstly, probability density functions of wind power, photovoltaic and load are respectively constructed by utilizing nonparametric kernel density estimation, then, a Latin hypercube sampling is utilized to generate samples, finally, a Cholesky decomposition method is adopted to convert the random samples with correlation into mutually independent random samples, and the worst scene is determined on the basis of the mutually independent random samples.
Step 2.1: probability density function modeling of random factors
If the number of load samples based on the historical data is n, constructing a probability density model of the load based on a non-parametric kernel density estimation method as follows:
Figure RE-GDA0002804791830000085
in the formula, phi (P)d) Is a probability density function of the load; k (P)dL) is a kernel function; pdmIs the m-th sample value in the load sample, and l is the bandwidth.
The invention selects a Gaussian function as a load probability densityThe kernel function of the degree model is solved for the bandwidth l, and the probability density function phi (P) of the system load is obtainedd)。
The probability density function phi (P) of the wind power output can be obtained by the same methodw) And a photovoltaic output probability density function phi (P)v). As shown in formula (17) and formula (18).
Figure RE-GDA0002804791830000086
In the formula, phi (P)w) Is a probability density function of the load; k (P)wL) is a kernel function; pwmAnd l is the bandwidth, wherein the m is the sample value in the wind power output sample.
Figure RE-GDA0002804791830000087
In the formula, phi (P)v) Is a probability density function of the load; k (P)vL) is a kernel function; pvmAnd l is the bandwidth, wherein the value is the mth sample value in the photovoltaic output sample.
Step 2.2: sample sampling
Latin hypercube sampling is a hierarchical sampling method which has a sample memory function and can avoid the sampling of already appeared samples. Let the sampling scale be N, Ym＝Fm(Xm) Denotes the m-th random variable XmIs determined. The specific sampling process is as follows: will be interval [0,1]Equally dividing the sampling value into N equal parts, selecting the middle value of each subinterval, and obtaining the sampling value through the inverse function of the middle value
Figure RE-GDA0002804791830000091
And obtaining a sample matrix of all the random variables after sampling of all the random variables is completed.
Step 2.3: orthogonal transformation matrix derivation
The method comprises the steps of describing the correlation among loads, wind power and photovoltaic power generation by utilizing a correlation coefficient matrix, and setting a sample matrix obtained by Latin hypercube sampling as W ═ W1,w2,…wl]TThe matrix of correlation coefficients is Cw：
Figure RE-GDA0002804791830000092
The elements of the matrix can be obtained by equation (20):
Figure RE-GDA0002804791830000093
in the formula:
Figure RE-GDA0002804791830000094
and
Figure RE-GDA0002804791830000095
are respectively an input variable wiAnd wjStandard deviation of (d); cov(wi,wj) As an input variable wiAnd wjThe covariance of (a).
As can be seen by definition, the correlation coefficient matrix C of the present inventionwIf it is a positive definite matrix, Cholesky decomposition may be performed on the coefficient matrix:
Cw＝GGT (6)
in the formula: g is a lower triangular matrix in which the elements can be found by equation (22).
Figure RE-GDA0002804791830000096
Assuming an orthogonal matrix B, the input random variable W with correlation can be converted into an uncorrelated random variable Y:
Y＝BW (8)
matrix C of correlation coefficients due to uncorrelated random variables YYIs an identity matrix I, and thus:
CY＝ρ(Y,YT)＝ρ(BW,WTBT)＝Bρ(W,WT)BT＝BCWBT＝I (9)
further, it can be obtained from the formula (21):
CY＝BCWBT＝BGGTBT＝(BG)(BG)T＝I (10)
derived from the above equation:
B＝G-1 (11)
on the premise that the input uncertainty W having correlation is known, it can be changed to an uncorrelated random variable Y by orthogonal transformation matrix.
Step 2.4: solving a worst scene;
and (3) converting the load, wind power and photovoltaic output matrixes with correlation into independent matrixes through the orthogonal transformation matrix obtained in the step (2.3), eliminating the correlation among the independent matrixes, and further obtaining the worst scene through a method of linear superposition of the worst scene. A worst case scenario retrieval flow diagram is shown in fig. 2.
And step 3: model solution
The invention provides a multistage decomposition algorithm based on Benders decomposition to solve a model.
The traditional Benders decomposition method generally decomposes an original problem into two primary and secondary problems, and decomposes the original problem into a main problem and two sub-problems in consideration of the particularity of the model of the invention, wherein the main problem is a main UC decision problem under a basic scene, and the two sub-problems are respectively as follows: the network safety checking sub-problem under the basic scene and the robust checking sub-problem under the worst scene. The whole frame is shown in figure 1.
Step 3.1: UC Main problem modeling
The main UC problem includes the objective function (1) and constraint equations (3-9) and all the generated Benders cuts.
Step 3.2: safety sub-problem modeling under basic scene
The network security syndrome problem under the basic scene is shown as formula (27), and the network security of the scheduling scheme is ensured by checking the load flow out-of-limit condition of the UC main problem.
Figure RE-GDA0002804791830000101
Figure RE-GDA0002804791830000102
In the formula: lambda [ alpha ]1,l,t,λ2,l,tIs a dual variable of the network security constraint; v. ofl,tIs the relaxation variable.
Introducing a relaxation variable v into a subprobleml,tThe role of the method is to temporarily relieve the network security constraint by using a relaxation variable when the constraint condition cannot be met so as to ensure that the subproblem is always solved. V obtained if final optimizationl,tIf the maximum value is greater than the given safety threshold value, the optimal unit combination scheme obtained by the main problem cannot meet the network safety constraint, and therefore the Benders cut as follows needs to be returned:
Figure RE-GDA0002804791830000111
step 3.3: uncertainty-aware safety sub-problem modeling
The safety check model under the uncertain scene is shown as a formula (29), and the safety check model is checked in the worst scene
Figure RE-GDA0002804791830000112
And
Figure RE-GDA0002804791830000113
whether the safety constraint can be met.
Figure RE-GDA0002804791830000114
S.t.
Figure RE-GDA0002804791830000115
Figure RE-GDA0002804791830000116
Figure RE-GDA0002804791830000117
Figure RE-GDA0002804791830000118
Figure RE-GDA0002804791830000119
Figure RE-GDA00028047918300001110
Figure RE-GDA00028047918300001111
0≤v1,lt,v2t,v3t (29)
In the formula:
Figure RE-GDA00028047918300001112
and
Figure RE-GDA00028047918300001113
the actual values of the unit output, the wind power output, the photovoltaic output and the load under the worst scene are obtained. Lambda [ alpha ]1,it,λ2,it,μ1,it,μ2,it,η1,it,η2,itIs a dual variable of a rotation standby constraint, a unit capacity constraint and a climbing constraint.
And if the safety constraint cannot be met, returning to the Benders cut formula (30) to the main problem, wherein the main problem serves as a constraint condition, so that the unit combination and output scheme can be adaptively adjusted on the worst scene to meet the network safety constraint and the power balance.
Figure RE-GDA0002804791830000121
And 4, step 4: establishing an operation mode;
in order to comparatively analyze the effectiveness and the correctness of the scheduling model established by the invention, the following two operation modes are established:
mode 1: robust day-ahead scheduling that accounts for multiple uncertainties but does not take correlation into account.
Mode 2: a robust day-ahead scheduling model that takes into account multiple uncertainties and their correlations.
In particular, the invention verifies the correctness of the proposed model with a modified IEEE-118 node system. The system comprises 54 conventional thermal power generating units, 3 wind power plants and 1 photovoltaic power station. The rated power of the wind power plant is respectively 100MW, 200MW and 250MW, and the wind power plant is positioned at nodes No. 5, 9 and 48; the capacity of the photovoltaic power station is 300MW and is positioned at the No. 20 node. The active power output curve of wind power and photovoltaic is shown in fig. 5. The positive rotation standby requirement of a conventional unit in the system is 8% of the maximum load of the system, and the negative rotation standby requirement is 2% of the minimum load of the system. The threshold values of the problem check values of the safety check sub-problems are all 10-3MWh. And adopting Latin hypercube sampling to sample the load, the wind power and the photovoltaic output 100 times per hour, and totaling 2400 groups of samples. The related calculations are all completed on an Intel core i5-4460 processor 3.20GHz, 8G memory computer, and Matlab and Cplex 12.5 are adopted to program and solve the example.
According to the worst scenario solution method provided by the present invention, the worst scenario comparison result of the uncertainty factors of the mode 1 and the mode 2 is shown in fig. 5.
As can be seen from fig. 5, if the probabilistic correlation between uncertainty factors is not considered, the worst scenario obtained by simple linear superposition is conservative, which will affect the economy of the future scheduling decision, and it can be seen from the precise calculation of the method herein that the worst scenario is actually impossible to occur due to the existence of the correlation between uncertainty factors.
The day-ahead scheduling schemes in mode 1 and mode 2 are calculated separately, and the results are shown in fig. 6.
As can be seen from fig. 6, compared to the conventional day-ahead scheduling method without considering the probability correlation of multiple uncertainty factors, the method proposed in the present invention reduces the day-ahead scheduling cost of the present example by about 38650 $. The method has the advantages that the method fully considers the probability correlation among wind power, photovoltaic and loads, and effectively avoids extreme scenes which are not possible to occur in the robustness checking process, so that the operation cost of the system is reduced while the robustness of the system is ensured by the day-ahead scheduling decision.
In order to compare the advantages of the method of the invention compared with the traditional method, the standard Benders decomposition method and the method of the invention are respectively adopted to simulate the same example, and the calculation efficiency is compared. The comparative results are shown in FIG. 7.
As can be seen from fig. 7: compared with the calculation efficiency, the method provided by the invention is remarkably improved, and the worst scene solving method based on Cholesky decomposition effectively avoids solving problems of unit combination and load flow calculation under a large number of scenes, so that the calculation efficiency is improved by 411.5%.
The present invention has been described in terms of the preferred embodiments, but the above embodiments are not intended to limit the present invention in any way, and all technical solutions obtained by substituting equivalents or equivalent variations fall within the scope of the technical solutions of the present invention.

Claims (6)

1. A multistage decomposition method based on Benders decomposition is characterized in that the multistage decomposition method is used for decomposing problems of a day-ahead scheduling model of unit combination decision, and the decomposed problems comprise a UC decision main problem in a basic scene, a network safety checking sub-problem in the basic scene and a robust checking sub-problem in a worst scene.
2. A multistage decomposition method based on Benders decomposition according to claim 1, characterized by comprising the following steps when performing the decomposition of the problem:
step 1, modeling and solving a UC main problem;
step 2, modeling and solving a safety subproblem in a basic scene;
and 3, modeling and solving the safety subproblem under the uncertain scene.
3. The multistage decomposition method based on Benders decomposition as claimed in claim 2, wherein in step 2, the safety subproblem under the basic scenario is as formula (27), which ensures the network safety of the scheduling scheme by checking the out-of-limit situation of the UC main problem;
Figure RE-FDA0002804791820000011
Figure RE-FDA0002804791820000012
in the formula: lambda [ alpha ]1,l,t,λ2,l,tIs a dual variable of the network security constraint; v. ofl,tIs the relaxation variable.
4. A multi-stage decomposition method based on Benders decomposition according to claim 3,
when the constraint condition can not be met, temporarily relieving the network security constraint by using a relaxation variable so as to ensure that the subproblems are always solved; v obtained if final optimizationl,tIf the maximum value is greater than the given safety threshold value, the optimal unit combination scheme obtained by the main problem cannot meet the network safety constraint, and therefore the Benders cut as follows needs to be returned:
Figure RE-FDA0002804791820000013
5. the multistage decomposition method based on Benders' decomposition as claimed in claim 2, wherein in step 3, the safety subproblem model under uncertain scene is shown as formula (29), whichChecking in worst case
Figure RE-FDA0002804791820000021
And
Figure RE-FDA0002804791820000022
whether the safety constraint can be met or not,
Figure RE-FDA0002804791820000023
S.t.
Figure RE-FDA0002804791820000024
Figure RE-FDA0002804791820000025
Figure RE-FDA0002804791820000026
Figure RE-FDA0002804791820000027
Figure RE-FDA0002804791820000028
Figure RE-FDA0002804791820000029
Figure RE-FDA00028047918200000210
0≤v1,lt,v2t,v3t (29)
in the formula:
Figure RE-FDA00028047918200000211
and
Figure RE-FDA00028047918200000212
actual values of the output, wind power output, photovoltaic output and load of the unit under the worst scene; lambda [ alpha ]1,it,λ2,it,μ1,it,μ2,it,η1,it,η2,itIs a dual variable of a rotation standby constraint, a unit capacity constraint and a climbing constraint.
6. The Benders decomposition-based multi-stage decomposition method according to claim 5, wherein if the safety constraint cannot be satisfied, returning Benders' cut formula (30) to the main problem, which is used as a constraint condition, so that the unit combination and output scheme adaptively adjusts to satisfy the network safety constraint and the power balance on the worst scenario;
Figure RE-FDA00028047918200000213
CN202011112195.0A 2017-11-30 2017-11-30 Multistage decomposition method based on Benders decomposition Active CN112186766B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011112195.0A CN112186766B (en) 2017-11-30 2017-11-30 Multistage decomposition method based on Benders decomposition

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201711238480.5A CN107947164B (en) 2017-11-30 2017-11-30 Electric power system day-ahead robust scheduling method considering multiple uncertainties and correlations
CN202011112195.0A CN112186766B (en) 2017-11-30 2017-11-30 Multistage decomposition method based on Benders decomposition

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
CN201711238480.5A Division CN107947164B (en) 2017-11-30 2017-11-30 Electric power system day-ahead robust scheduling method considering multiple uncertainties and correlations

Publications (2)

Publication Number Publication Date
CN112186766A true CN112186766A (en) 2021-01-05
CN112186766B CN112186766B (en) 2022-07-01

Family

ID=61947028

Family Applications (3)

Application Number Title Priority Date Filing Date
CN202011112195.0A Active CN112186766B (en) 2017-11-30 2017-11-30 Multistage decomposition method based on Benders decomposition
CN201711238480.5A Active CN107947164B (en) 2017-11-30 2017-11-30 Electric power system day-ahead robust scheduling method considering multiple uncertainties and correlations
CN202011110581.6A Active CN112186765B (en) 2017-11-30 2017-11-30 Modeling method of day-ahead scheduling model of unit combination decision

Family Applications After (2)

Application Number Title Priority Date Filing Date
CN201711238480.5A Active CN107947164B (en) 2017-11-30 2017-11-30 Electric power system day-ahead robust scheduling method considering multiple uncertainties and correlations
CN202011110581.6A Active CN112186765B (en) 2017-11-30 2017-11-30 Modeling method of day-ahead scheduling model of unit combination decision

Country Status (1)

Country Link
CN (3) CN112186766B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114862130A (en) * 2022-04-14 2022-08-05 山东大学 Multi-scene random unit combination method and system based on double-layer decomposition algorithm

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108667010B (en) * 2018-05-04 2019-08-16 清华大学 A kind of power distribution network economic load dispatching method based on distribution robust optimization
CN109831381B (en) * 2018-12-15 2020-07-10 清华大学 Robust routing optimization method for power communication network considering information physical coupling
CN109785183A (en) * 2018-12-26 2019-05-21 国网山西省电力公司电力科学研究院 A kind of consideration wind-powered electricity generation and the probabilistic Robust Scheduling method of load prediction
CN109657385A (en) * 2018-12-26 2019-04-19 国网江苏省电力有限公司 A kind of emulated computation method generated suitable for transmission line of electricity stochastic regime
CN110535120A (en) * 2019-08-16 2019-12-03 华南理工大学 Consider the interconnection system distributed Optimization Scheduling of electric-gas of air pollution diffusion
CN110826644B (en) * 2019-11-21 2020-09-29 国网江苏省电力有限公司南通供电分公司 Distributed power supply time sequence joint output typical scene generation method based on Copula function
CN111932048B (en) * 2020-04-16 2022-08-30 贵州电网有限责任公司 Two-stage monthly transaction security check method based on extreme scene
CN111711184B (en) * 2020-05-25 2022-02-11 国网青海省电力公司 Power system robust economic dispatching method based on worst scenario identification
CN112310959A (en) * 2020-10-13 2021-02-02 国网湖北省电力有限公司宜昌供电公司 Power distribution network low voltage comprehensive treatment method considering uncertainty factors and correlation thereof
CN112668751B (en) * 2020-11-26 2022-06-17 广西大学 Method and device for establishing unit optimization scheduling model
CN112989536A (en) * 2021-03-11 2021-06-18 南方电网科学研究院有限责任公司 Scene decomposition-based optimal scheduling method for electric multi-energy flow system
CN113642792A (en) * 2021-08-12 2021-11-12 中国南方电网有限责任公司 Medium-and-long-term unit combination accurate modeling technical method comprehensively considering complex large power grid operation constraint conditions
CN114759602B (en) * 2022-04-24 2024-04-05 国网山东省电力公司潍坊供电公司 Power distribution network acceptance assessment method considering photovoltaic extreme scenes

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102684224A (en) * 2012-05-25 2012-09-19 浙江大学 Unit combination method for resolving and considering wind power volatility
US20130018517A1 (en) * 2011-07-15 2013-01-17 International Business Machines Corporation Solving large-scale security-constrained economic dispatch problem in real-time
CN104716670A (en) * 2015-04-01 2015-06-17 国家电网公司 Method for combining units based on network security constraint under photovoltaic grid connection
CN107239863A (en) * 2017-04-12 2017-10-10 广东电网有限责任公司电力调度控制中心 The robust Unit Combination method of power system security constraints
CN107330568A (en) * 2017-08-16 2017-11-07 东南大学 Energy storage, distributed power source and the power distribution network coordinated planning method decoupled based on Benders

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102832614B (en) * 2012-08-03 2014-12-10 国电南瑞科技股份有限公司 Robust optimizing method for power generation plan under uncertain environment
CN102983573B (en) * 2012-11-09 2014-10-15 天津大学 Security constraint economic dispatch method based on security domains
KR20150037357A (en) * 2013-09-30 2015-04-08 한국전력공사 System for controlling flexible ac transmission system
CN104809327B (en) * 2014-09-02 2018-08-03 长沙理工大学 Containing the uncertain distribution robust Optimal methods of new energy electric power scheduling square
CN104485665B (en) * 2014-12-17 2016-08-31 河海大学 Meter and the dynamic probability trend computational methods of forecasting wind speed error temporal correlation
CN106655190A (en) * 2016-10-19 2017-05-10 云南电网有限责任公司电力科学研究院 Method for solving P-OPF (Probabilistic-Optimal Power Flow) of wind power stations
CN106953354B (en) * 2017-03-10 2019-11-08 国网山东省电力公司经济技术研究院 Consider the method for Unit Commitment containing wind-powered electricity generation of voltage support
CN107038292B (en) * 2017-04-01 2020-05-26 三峡大学 Multi-wind-field output correlation modeling method based on self-adaptive multivariate nonparametric kernel density estimation
CN107039977B (en) * 2017-06-03 2020-03-31 广东博慎智库能源科技发展有限公司 Robust scheduling uncertainty set construction method for power system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130018517A1 (en) * 2011-07-15 2013-01-17 International Business Machines Corporation Solving large-scale security-constrained economic dispatch problem in real-time
CN102684224A (en) * 2012-05-25 2012-09-19 浙江大学 Unit combination method for resolving and considering wind power volatility
CN104716670A (en) * 2015-04-01 2015-06-17 国家电网公司 Method for combining units based on network security constraint under photovoltaic grid connection
CN107239863A (en) * 2017-04-12 2017-10-10 广东电网有限责任公司电力调度控制中心 The robust Unit Combination method of power system security constraints
CN107330568A (en) * 2017-08-16 2017-11-07 东南大学 Energy storage, distributed power source and the power distribution network coordinated planning method decoupled based on Benders

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114862130A (en) * 2022-04-14 2022-08-05 山东大学 Multi-scene random unit combination method and system based on double-layer decomposition algorithm
CN114862130B (en) * 2022-04-14 2023-03-24 山东大学 Multi-scene random unit combination method and system based on double-layer decomposition algorithm

Also Published As

Publication number Publication date
CN107947164A (en) 2018-04-20
CN107947164B (en) 2020-11-17
CN112186765B (en) 2022-06-17
CN112186765A (en) 2021-01-05
CN112186766B (en) 2022-07-01

Similar Documents

Publication Publication Date Title
CN112186765B (en) Modeling method of day-ahead scheduling model of unit combination decision
CN107977744B (en) Day-ahead robust scheduling method of power system based on traditional Benders decomposition method
CN107239863B (en) Robust unit combination method for power grid safety constraint
Fu et al. Multiobjective stochastic economic dispatch with variable wind generation using scenario-based decomposition and asynchronous block iteration
CN112467807B (en) Day-ahead optimal scheduling method and system for multi-energy power system
Bai et al. A two-level approach to AC optimal transmission switching with an accelerating technique
Liu et al. Computational study of security constrained economic dispatch with multi-stage rescheduling
Yang et al. An improved robust SCUC approach considering multiple uncertainty and correlation
CN109785183A (en) A kind of consideration wind-powered electricity generation and the probabilistic Robust Scheduling method of load prediction
CN107316113B (en) Power transmission network planning method and system
CN109886446B (en) Dynamic economic dispatching method of electric power system based on improved chaotic particle swarm algorithm
JP2012254007A (en) Method of solving unit commitment problem for set of generators
CN110009141B (en) Climbing event prediction method and system based on SDAE feature extraction and SVM classification model
Huang et al. Joint generation and reserve scheduling of wind‐solar‐pumped storage power systems under multiple uncertainties
CN115425668A (en) Energy storage capacity optimal configuration method based on power system time sequence production simulation
CN115438964A (en) Random planning method and equipment for power transmission network and storage medium
Gil et al. Short-term hydrothermal generation scheduling using a parallelized stochastic mixed-integer linear programming algorithm
CN105305485A (en) Large-scale intermittent energy consuming security constrained economic dispatch method
Yang Multi‐objective optimization of integrated gas–electricity energy system based on improved multi‐object cuckoo algorithm
CN109861293B (en) Method for evaluating influence of photovoltaic uncertainty on small signal stability of power system
CN114336767A (en) Data-driven robust optimization scheduling implementation method based on multi-affine strategy
CN112085399A (en) Method, device and equipment for determining reliability of energy system
Ji et al. A scenario probability based method to solve unit commitment of large scale energy storage system and thermal generation in high wind power penetration level system
Liu et al. Two-stage robust optimal dispatch method considering wind power and load correlation
Li et al. Deep reinforcement learning for voltage control and renewable accommodation using spatial-temporal graph information

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
EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210105

Assignee: Hubei Yunzhihang Drone Technology Co.,Ltd.

Assignor: CHINA THREE GORGES University

Contract record no.: X2023980044730

Denomination of invention: A multi-stage decomposition method based on Benders decomposition

Granted publication date: 20220701

License type: Common License

Record date: 20231027