2016
DOI: 10.1016/j.ejor.2016.05.021
|View full text |Cite
|
Sign up to set email alerts
|

An empirical analysis of scenario generation methods for stochastic optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
37
0
1

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 76 publications
(38 citation statements)
references
References 35 publications
0
37
0
1
Order By: Relevance
“…Through clustering analysis, the scenarios with similar daily net load shapes will be assigned to the same cluster, then we can intuitively produce a representative scenario set by sampling few scenarios in each cluster. In addition, to ensure the effectiveness of scenario reduction, we carry out the scenario sampling and determine the weight coefficient of each scenario by solving an optimization problem of minimizing the Kantorovich distance between the raw scenario set and the reduced scenario set, a detailed description of which can be found in [24].…”
Section: Scenario Reductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Through clustering analysis, the scenarios with similar daily net load shapes will be assigned to the same cluster, then we can intuitively produce a representative scenario set by sampling few scenarios in each cluster. In addition, to ensure the effectiveness of scenario reduction, we carry out the scenario sampling and determine the weight coefficient of each scenario by solving an optimization problem of minimizing the Kantorovich distance between the raw scenario set and the reduced scenario set, a detailed description of which can be found in [24].…”
Section: Scenario Reductionmentioning
confidence: 99%
“…It is subject to (2), (3), (21), (23), (24), (43) and (44). Equations (43) and (44) can be solved by using commercial MILP solvers.…”
Section: Investment Master Problemmentioning
confidence: 99%
“…Then generated scenarios are reduced into an optimal subset that represents well enough the uncertainties using the k-means clustering technique [30]. Finally, the scenarios are combined to construct the whole set of scenarios based on a scenario tree [31]. Each branch in scenario tree corresponds to one scenario in scheduling horizon with a probability calculated as follows: There are several operating constraints for DG units that represent the relationship between active power productions of DGs and upward/downward regulation capacities as follows:…”
Section: B Proposed Solution Methodologymentioning
confidence: 99%
“…A multitude of techniques have been proposed in literature [27,28]. In this paper, importance sampling, as presented in [29], in combination with a random walk (see [28]) was applied and will be debated below.…”
Section: Appendix B Scenario Generationmentioning
confidence: 99%