Robust unit commitment with dispatchable wind power

Journal Article (2018)
Author(s)

G.A. Morales-España (TU Delft - Algorithmics)

Álvaro Lorca (Pontificia Universidad Católica de Chile)

Mathijs M. de Weerdt (TU Delft - Algorithmics)

Research Group
Algorithmics
Copyright
© 2018 G. Morales-Espana, Álvaro Lorca, M.M. de Weerdt
DOI related publication
https://doi.org/10.1016/j.epsr.2017.10.002
More Info
expand_more
Publication Year
2018
Language
English
Copyright
© 2018 G. Morales-Espana, Álvaro Lorca, M.M. de Weerdt
Research Group
Algorithmics
Volume number
155
Pages (from-to)
58-66
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

The increasing penetration of uncertain generation such as wind and solar in power systems imposes new challenges to the unit commitment (UC) problem, one of the most critical tasks in power systems operations. The two most common approaches to address these challenges — stochastic and robust optimization — have drawbacks that restrict their application to real-world systems. This paper demonstrates that, by considering dispatchable wind and a box uncertainty set for wind availability, a fully adaptive two-stage robust UC formulation, which is typically a bi-level problem with outer mixed-integer program (MIP) and inner bilinear program, can be translated into an equivalent single-level MIP. Experiments on the IEEE 118-bus test system show that computation time, wind curtailment, and operational costs can be significantly reduced in the proposed unified stochastic–robust approach compared to both pure stochastic approach and pure robust approach, including budget of uncertainty.