We propose a novel global solution algorithm for the network-constrained unit commitment problem that incorporates a nonlinear alternating current model of the transmission network, which is a nonconvex mixed-integer nonlinear programming (MINLP) problem. Our algorithm is based on the multi-tree global optimization methodology, which iterates between a mixed-integer lower-bounding problem and a nonlinear upper-bounding problem. We exploit the mathematical structure of the unit commitment problem with AC power flow constraints and leverage second-order cone relaxations, piecewise outer approximations, and optimization-based bounds tightening to provide a globally optimal solution at convergence. Numerical results on four benchmark problems illustrate the effectiveness of our algorithm, both in terms of convergence rate and solution quality.
Jianfeng Liu, Carl D. Laird, Joseph K. Scott, Jean-Paul Watson, and Anya Castillo. Global Solution Strategies for the Network-Constrained Unit Commitment Problem With AC Transmission Constraints. IEEE Transactions on Power Systems.
View Global Solution Strategies for the Network-Constrained Unit Commitment Problem With AC Transmission Constraints