Fast identifying redundant security constraints in SCUC in the presence of uncertainties

Abstract

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.

Keywords

• day‐ahead market
• computational complexity
• uncertain feasible region
• SCUC
• high dimensional space
• fast identification method