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

An inexact column-and-constraint generation method to solve two-stage robust optimization problems

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
2025
2025

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…17.36%. In Case II, transmission line 9-21 is to be built, strengthening the renewable energy transmitted from the group (25,26,27,28,29,30) to the rest of the system. In Case III, when the uncertainty on the PDFs is considered, the second-stage cost increases by 109.55%, where the storage expansion results are adjusted, i.e.…”
Section: Simulation Results Of Ieee-30 Bus Test Systemmentioning
confidence: 99%
See 2 more Smart Citations
“…17.36%. In Case II, transmission line 9-21 is to be built, strengthening the renewable energy transmitted from the group (25,26,27,28,29,30) to the rest of the system. In Case III, when the uncertainty on the PDFs is considered, the second-stage cost increases by 109.55%, where the storage expansion results are adjusted, i.e.…”
Section: Simulation Results Of Ieee-30 Bus Test Systemmentioning
confidence: 99%
“…With the increase of scenarios, the objective value converges to 1888 M$. When it comes to Cases V and VI, the nested C&CG converges in 2855.10 and 7322.03 s in Cases V and VI, respectively, which is much longer than the solution time in Cases I–IV, as the worst scenarios are to be explored by the inner C&CG iteration, which is strongly affected by the mixed‐integer gap of the master problem in the inner iterations [25]. These results verify the superiority of the proposed algorithm regarding computational time and scalability.…”
Section: Case Studiesmentioning
confidence: 99%
See 1 more Smart Citation
“…For the above two-stage robust optimization model, due to the difficulty in solving the main problem, the i-C&CG algorithm is adopted herein [34]. i-C&CG algorithm is similar to C&CG) algorithm in that the alternate solution of the original problem consists of a main problem and a subproblem.…”
Section: An I-candcg Algorithmmentioning
confidence: 99%