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

Modified Benders Decomposition for Solving Transmission Investment Game With Risk Measure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(5 citation statements)
references
References 37 publications
0
5
0
Order By: Relevance
“…The tests performed in Sections VI and VII serve the purpose of demonstrating the functionality of the proposed models. While the existing work tests the proposed models with fiveand eight-generator systems, it is desirable to apply these models to a full system [39], [41], [42], [45], [46]. This will be a further extension of the existing work.…”
Section: Further Discussion and Future Workmentioning
confidence: 99%
See 2 more Smart Citations
“…The tests performed in Sections VI and VII serve the purpose of demonstrating the functionality of the proposed models. While the existing work tests the proposed models with fiveand eight-generator systems, it is desirable to apply these models to a full system [39], [41], [42], [45], [46]. This will be a further extension of the existing work.…”
Section: Further Discussion and Future Workmentioning
confidence: 99%
“…As observed, the computational time for the SIP model is the highest due to the several binary variables introduced for the linearization process 5 . We can reduce the computational time in our MILP models in two ways: first, we can employ decomposition algorithms to break the MILP model into smaller and easierto-solve optimization problems [41], [42]. Second, we can use scenario generation and reduction algorithm to reduce the size of our MILP models [43], [44].…”
Section: Illustrative Examplesmentioning
confidence: 99%
See 1 more Smart Citation
“…Finally, the proposed robust co-optimisation model can be transferred to a MILP formulation who can be efficiently solved [21][22][23]. The MILP problem can be solved by branch and bound algorithm, benders decomposition algorithm, heuristic algorithm and commercial software packages such as Cplex [24][25][26]. In this paper, the CESS model is solved by the Cplex solver in the GAMS.…”
Section: Price Uncertaintymentioning
confidence: 99%
“…While, in the non-cooperative approach, each transmission planner seeks to maximise its social welfare considering the planning decisions of other planners [11]. In the non-cooperative approach, the social welfare of the whole interconnected system might not be obtained due to competition between different transmission planners [12]. According to these terminologies, the proposed algorithm in this paper, which aims at maximising the overall social welfare of the whole system, falls in the cooperative TEP category.…”
Section: Introductionmentioning
confidence: 99%