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
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
