AC network-constrained unit commitment via conic relaxation and convex programming. (January 2022)

• Record Type: Journal Article
• Authors: Constante-Flores, Gonzalo E.; Conejo, Antonio J.; Qiu, Feng
• Is Part Of: International journal of electrical power & energy systems. Volume 134(2022)
• Publication Date: 2022-01
• Subjects: Conic relaxation -- Convex programming -- Unit commitment; Electrical engineering -- Periodicals; Electric power systems -- Periodicals; Électrotechnique -- Périodiques; Réseaux électriques (Énergie) -- Périodiques; Electric power systems; Electrical engineering; Periodicals; 621.3
• DOI: 10.1016/j.ijepes.2021.107364
• Languages: English
• ISSNs: 0142-0615

Abstract

Highlights: Propose a solution approach for the AC network-constrained unit commitment problem. The proposed approach relies on convex (continuous and mixed-integer) programming. An active set strategy is used to speed up the solution time of the proposed approach. An AC feasible solution is recovered using a sequence of convex optimization problems. Demonstrate the effectiveness of the proposed approach using the IEEE 24-bus test system and an Illinois 200-bus system. Abstract: To address the AC network-constrained unit commitment problem, we propose an effective three-step solution approach. We first solve a DC (mixed-integer linear) approximation of the original problem to identify an initial solution and the set of transmission lines likely to be congested. Secondly, with the linear solution as a starting point, we solve a mixed-integer second-order conic relaxation of the original problem using an active set strategy regarding transmission constraints. Finally, using the solution of the relaxed problem as a starting point, we solve a set of increasingly accurate continuous convex optimization problems to ensure full AC feasibility. We show the effectiveness of the proposed approach using the IEEE 24-bus test system and an Illinois 200-bus system with 49 generators and 245 lines.