Security-constrained unit commitment (SCUC) model is used for power system day-ahead scheduling. However, current SCUC uses a static network to deliver and meet demand optimally. A dynamic can provide lower optimal cost alleviate congestion. due the computational complexity lack of effective algorithms, reconfiguration has not been included in yet. This paper presents novel approach handle secu...

Security-constrained unit commitment SCUC is an important tool for independent system operators in the day-ahead electric power market. A serious issue arises that the energy realizability of the staircase generation schedules obtained in traditional SCUC cannot be guaranteed. This paper focuses on addressing this issue, and the basic idea is to formulate the power output of thermal units as pi...

The security-constrained unit commitment (SCUC) challenge is solved repeatedly several times every day, for operations in a limited time. Typical mixed-integer linear programming (MILP) formulations are intertemporal nature and have complex discrete solution spaces that exponentially increase with system size. Improvements the SCUC formulation and/or method yield faster hold immense economic va...

Considering the economics and securities for the operation of a power system, this paper presents a new adaptive dynamic programming approach for security-constrained unit commitment (SCUC) problems. In response to the “curse of dimension” problem of dynamic programming, the approach solves the Bellman’s equation of SCUC approximately by solving a sequence of simplified single stage optimizatio...

Security-constrained unit commitment (SCUC) has been extensively studied as a key decision-making tool to determine optimal power generation schedules in the operation of electricity market. With development emerging grids, fruitful research results on SCUC have obtained. Therefore, it is essential review current work and propose future directions for meet needs developing systems. In this pape...

The scenario approach is a general data-driven algorithm to chance-constrained optimization. It seeks the optimal solution that feasible carefully chosen number of scenarios. A crucial step in compute cardinality essential sets, which smallest subset scenarios determine solution. This article addresses challenge efficiently identifying sets. For convex problems, we demonstrate sparsest dual pro...

Current contingency reserve criteria ignore the likelihood of individual contingencies and, thus, their impact on system reliability and risk. This paper develops an iterative approach, inspired by current security-constrained unit commitment (SCUC) practice, enabling operators to determine risk-cognizant requirements allocation with minimal alterations SCUC practice. The proposed approach uses...