A Multi-Layer Data-Driven Security Constrained Unit Commitment Approach with Feasibility Compliance

Abstract

Security constrained unit commitment is an essential part of the day-ahead energy markets. The presence of discrete and continuous variables makes it a complex, mixed-integer, and time-hungry optimization problem. Grid operators solve unit commitment problems multiple times daily with only minor changes in the operating conditions. Solving a large-scale unit commitment problem requires considerable computational effort and a reasonable time. However, the solution time can be improved by exploiting the fact that the operating conditions do not change significantly in the day-ahead market clearing. Therefore, in this paper, a novel multi-layer data-driven approach is proposed, which significantly improves the solution time (90% time-reduction on average for the three studied systems). The proposed approach not only provides a near-optimal solution (<1% optimality gap) but also ensures that it is feasible for the stable operation of the system (0% infeasible predicted solutions). The efficacy of the developed algorithm is demonstrated through numerical simulations on three test systems, namely a 4-bus system and the IEEE 39-bus and 118-bus systems, and promising results are obtained.