Open AccessFast identifying redundant security constraints in SCUC in the presence of uncertainties
Author(s) -
Ding Tao,
Qu Ming,
Bai Jiawen,
Jia Wenhao,
Wu Jiang,
He Yuankang,
Chen Tianen
Publication year - 2020
Publication title -
iet generation, transmission and distribution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.92
H-Index - 110
eISSN - 1751-8695
pISSN - 1751-8687
DOI - 10.1049/iet-gtd.2019.1275
Subject(s) - mathematical optimization , computer science , grid , power system simulation , identification (biology) , function (biology) , electric power system , power (physics) , mathematics , physics , geometry , botany , quantum mechanics , evolutionary biology , biology
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.