2023
DOI: 10.1016/j.compchemeng.2022.108122
|View full text |Cite
|
Sign up to set email alerts
|

Scenario reduction and scenario tree generation for stochastic programming using Sinkhorn distance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 26 publications
0
4
0
Order By: Relevance
“…Figure 1 demonstrates a general scenario reduction algorithm based on information from sources (Kammammettu and Li, 2023;Peredo and Herrero, 2022;Dvorkin et al, 2014). Scenario reduction, as outlined by Tarasov (2016), encompasses techniques aimed at filtering out potentially unrepresentative elements from the initial set of scenarios to form an optimal one.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Figure 1 demonstrates a general scenario reduction algorithm based on information from sources (Kammammettu and Li, 2023;Peredo and Herrero, 2022;Dvorkin et al, 2014). Scenario reduction, as outlined by Tarasov (2016), encompasses techniques aimed at filtering out potentially unrepresentative elements from the initial set of scenarios to form an optimal one.…”
Section: Resultsmentioning
confidence: 99%
“…With the apparent obviousness of the described problem and the urgency of the need for its solution, the methods of scenario reduction are still described quite rarely (Kammammettu and Li, 2023;Peredo and Herrero, 2022;Dvorkin et al, 2014). Interestingly, researchers often do not focus on optimization opportunities to reduce the load on computing power while noting the dependence of multi-criteria optimization on the computing capabilities of computers.…”
Section: Introductionmentioning
confidence: 99%
“…As it can be seen in the above literature, robust optimization and stochastic programming are two common optimization methods under uncertainty. Due to the intractability and higher costs of robust optimization 33 and the assumption that the probability distribution of uncertain parameters is known in stochastic programming as proposed by Dantzig (1955) 34 , the more tractable stochastic programming method specifically designed to deal with modeling problems involving uncertainty was chosen for this paper 35 . In this paper, a fuzzy chance-constrained programming model in stochastic programming is introduced.…”
Section: Methodsmentioning
confidence: 99%
“…This paper adopts LHS to generate 100 sets of scenarios and utilizes a backward scenario reduction technique based on Kantorovich distance to reduce the number of scenarios, resulting in 10 typical scenarios [30,31]. Based on these scenarios, the economic risk is transformed into costs using CVaR theory.…”
Section: Solution Methods For the Proposed Modelmentioning
confidence: 99%