DOE OSTI · 1485467
Global Solution Strategies for the Network-Constrained Unit Commitment Problem with AC Transmission Constraints
Abstract
Here, we propose a novel global solution algorithm for the network-constrained unit commitment problem that incorporates a nonlinear alternating current (AC) 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 (UC-AC) and leverage second-order cone relaxations, piecewise outer approximations, and optimization-based bounds tightening to guarantee 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Liu, Jianfeng, Laird, Carl Damon, Scott, Joseph K., Watson, Jean -Paul, Castillo, Anya. 2018-10-17. Global Solution Strategies for the Network-Constrained Unit Commitment Problem with AC Transmission Constraints. https://doi.org/10.1109/tpwrs.2018.2876127. https://searchnasa.com/record/osti%3A1485467/global-solution-strategies-for-the-network-constrained-unit-commitment-problem-with-ac-transmission
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.