Fast identifying redundant security constraints in SCUC in the presence of uncertainties
| Autor: | Chen Tian'en, Jiang Wu, Ming Qu, Wenhao Jia, He Yuankang, Tao Ding, Jiawen Bai |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Mathematical optimization
Computational complexity theory Lift (data mining) Computer science 020209 energy 020208 electrical & electronic engineering Feasible region Energy Engineering and Power Technology 02 engineering and technology Identification (information) Power system simulation Control and Systems Engineering Order (exchange) 0202 electrical engineering electronic engineering information engineering Power grid Electrical and Electronic Engineering Greedy algorithm |
| Zdroj: | IET Generation, Transmission & Distribution. 14:2441-2449 |
| ISSN: | 1751-8695 1751-8687 |
| Popis: | Security constrained unit commitment (SCUC), with renewable resources integrated into power grid, is one core function in the day-ahead market. However, it confronts with critical challenges as the heavy complicated security constraints are considered. Usually, it is observed that lots of security constraints are redundant, which can be identified and eliminated, so as to reduce the computational complexity. In this study, the authors first lift the uncertain feasible region of SCUC into a high dimensional space. Furthermore, a fast identification method is proposed to relax the original feasible region, which thus can be solved by the classical greedy algorithm. In order to prevent the over-relaxation and find more redundant constraints, an efficient feasible-based bound tightening strategy is utilised to provide a tighter bound. Numerical results on large-scale test systems verify the effectiveness of the proposed method. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text