A practical algorithm for unit commitment based on unit decommitment ranking

Abstract

AbstractThis paper presents a practical algorithm for solving Unit Commitment (UC) problems with network constraints represented in Optimal Power Flow (OPF). The proposed algorithm is based on Successive Approximation Dynamic Programming (SADP) according to a Unit Decommitment Ranking (UDR) which is a priority list for unit decommitment procedure. The UDR can be determined by Dynamic Programming (DP) according to the information of OPF consisting of a set of Lagrange multipliers (dual variables). Since the set of Lagrange multipliers represents the relationship between the optimal value of objective function and OPF constraints, the proposed algorithm can determine power system resource scheduling in consideration of network constraints, such as line flow and voltage constraints. The feasibility and effectiveness of the proposed algorithm are demonstrated on a modified IEEE Reliability Test System. © 2001 Scripta Technica, Electr Eng Jpn, 138(2): 1–13, 2002