A modified algorithm for allocating reserve power considering security constraints.

Summary: This paper addresses a novel formulation and solution for the security constrained reserve management (SCRM) problem in both normal and N − 1 contingency conditions. Indeed, the SCRM problem is a modified version of the security constraint unit commitment problem which is updated with the operational reserve management and frequency stability constraints in both normal and N − 1 contingency conditions. The objective of this problem is to determine the optimal amounts of generation associated with different units and frequency regulation reserve (FRR) and allocate the FRR among the generation units. Therefore, the SCRM problem is a mixed integer nonlinear problem which is solved using the genetic algorithm in this paper. The powerful PLEXOS software is also utilized to solved and evaluate the results of the SCRM problem. To determine the effectiveness of the proposed method, some test systems, that is, IEEE 24‐bus, IEEE 39‐bus, and IEEE 118‐bus test systems are considered. Results confirm the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]