2013
DOI: 10.1109/tpwrs.2013.2250530
|View full text |Cite
|
Sign up to set email alerts
|

Two-Stage Minimax Regret Robust Unit Commitment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
119
0
1

Year Published

2014
2014
2020
2020

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 211 publications
(125 citation statements)
references
References 45 publications
0
119
0
1
Order By: Relevance
“…where P ti , Q ti and V ti are the active, reactive power and voltage amplitude of bus i, respectively; N bus is the number of buses; q ij is the phase angle difference between bus i and j; G ij and B ij are conductance and susceptance between bus i and j. ; i2N g ; t2T (22) where P g i;min and P g i;max are the minimum and maximum active power of conventional generator i; Q g i;min and Q g i;max are the minimum and maximum reactive power of conventional generator i; P g ti and Q g ti are the active and reactive power of conventional generator i at time t. (24) where DP g i;max is the active power ramping rate of generator i. The AROD model is proposed for a 24-h dispatch horizon.…”
Section: ) Power Flow Equations [37]mentioning
confidence: 99%
See 1 more Smart Citation
“…where P ti , Q ti and V ti are the active, reactive power and voltage amplitude of bus i, respectively; N bus is the number of buses; q ij is the phase angle difference between bus i and j; G ij and B ij are conductance and susceptance between bus i and j. ; i2N g ; t2T (22) where P g i;min and P g i;max are the minimum and maximum active power of conventional generator i; Q g i;min and Q g i;max are the minimum and maximum reactive power of conventional generator i; P g ti and Q g ti are the active and reactive power of conventional generator i at time t. (24) where DP g i;max is the active power ramping rate of generator i. The AROD model is proposed for a 24-h dispatch horizon.…”
Section: ) Power Flow Equations [37]mentioning
confidence: 99%
“…[23]. To reduce the conservativeness of the traditional RO [24], proposes an innovative two-stage robust UC model with a minimax regret strategy. Moreover, uncertain demand response is involved in the multistage robust UC model proposed in Ref.…”
Section: Introductionmentioning
confidence: 99%
“…Here, the P is the orthogonal matrix used for orthogonal decomposition (15) and D is a diagonal matrix consists of eigenvalues of positive definite matrix Q. For the axial ellipsoid E ′ , the matrix which the column vectors consist of the 2 × n vertices coordinates can be expressed as:…”
Section: Vertices Of the Ellipsoidmentioning
confidence: 99%
“…To encounter the uncertainties brought by the DGs, stochastic optimisation methods such as chance-constrained optimisation [12,13] and robust optimisation techniques [14][15][16][17][18] can be used. Among the robust optimisation method, the uncertainty set is to describe the robust region which the optimal decision should be adaptive to.…”
Section: Introductionmentioning
confidence: 99%
“…For example, regret minimization objective is introduced as a means to decrease the conservativeness of the robust UC solution [70], where the regret of a UC solution is defined as the maximum difference between the minimum total cost by adjusting the dispatch decision for the fixed UC solution and the total cost in the perfect-information case where the UC and dispatch solutions can be jointly optimized after knowing the uncertainty. A hybrid approach of combining the worst-case cost of a robust UC model with the average cost of a stochastic UC model is proposed in [71].…”
Section: Robust Optimizationmentioning
confidence: 99%