Decomposition Algorithm for Security-Constrained Unit Commitment with AC Optimal Power Flows

This paper presents a comprehensive approach to solving the security-constrained unit commitment with alternating current power flows (SCUC-ACPF) problem in contemporary power systems. We introduce algorithms that decompose the problem into subproblems suitable for specialized solvers, so that the large-scale mixed-integer nonlinear program-ming SCUC-ACPF problem can be solved. In case studies, we validate the efficiency and effectiveness of our algorithms on synthetic and industry-scale power system networks.