2015
DOI: 10.1002/etep.2132
|View full text |Cite
|
Sign up to set email alerts
|

A new hybrid stochastic-robust optimization approach for self-scheduling of generation companies

Abstract: Summary This paper presents a new mixed‐integer linear programming model for day‐ahead self‐scheduling of generating companies integrating the underlying ideas of robust optimization (RO) and stochastic programming (SP) to cope with the uncertainties of electricity market prices and availability/unavailability of units. The proposed hybrid approach models the uncertainty of electricity market prices by bounded intervals instead of probability distributions, aiming to derive a more tractable optimization model.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
6

Relationship

4
2

Authors

Journals

citations
Cited by 17 publications
(17 citation statements)
references
References 29 publications
0
17
0
Order By: Relevance
“…The uncertain parameters are first bounded through (6a) to (6c). The budget of uncertainty “ DR ” is used to control the robustness level of the proposed adaptive robust approach through limiting the size of the polyhedral uncertainty set in (6d) . The minimum value for the budget of uncertainty is 0.…”
Section: The Proposed Adaptive Robust Approachmentioning
confidence: 99%
See 2 more Smart Citations
“…The uncertain parameters are first bounded through (6a) to (6c). The budget of uncertainty “ DR ” is used to control the robustness level of the proposed adaptive robust approach through limiting the size of the polyhedral uncertainty set in (6d) . The minimum value for the budget of uncertainty is 0.…”
Section: The Proposed Adaptive Robust Approachmentioning
confidence: 99%
“…The budget of uncertainty "DR" is used to control the robustness level of the proposed adaptive robust approach through limiting the size of the polyhedral uncertainty set in (6d). 24,25,[32][33][34][35][36][37] The minimum value for the budget of uncertainty is 0. When DR = 0, no uncertain parameter can deviate from its forecasted value, which leads to a deterministic representation with no robustness.…”
Section: Uncertainty Set Realizationmentioning
confidence: 99%
See 1 more Smart Citation
“…When the Lagrangian relaxation algorithm is used to solve a generation scheduling problem, constraints that couple different units are typically relaxed to make the relaxed problem separable in units. In this paper, constraints that couple different units include constraints (11) and (20). If constraints (20) are relaxed, the resulting subproblem that contains dual variables 0 and , = 1, .…”
Section: The Lagrangian Relaxation Algorithmmentioning
confidence: 99%
“…From Table 1, we can observe that the robust generation self-scheduling problem was usually solved by commercial solvers. In order to make the problem solvable by the solvers, the model was simplified by piecewise linearly approximating the quadratic fuel cost function [8,10,11], reducing the time-dependent exponential startup cost function as a constant [8,10], omitting the startup cost [9,12], or omitting the unit commitment decision [12]. The solution approach has two disadvantages.…”
Section: Introductionmentioning
confidence: 99%