An Efficient Robust Solution to the Two-Stage Stochastic Unit Commitment Problem

Ignacio Blanco

doi:10.1109/TPWRS.2017.2683263

Return

An Efficient Robust Solution to the Two-Stage Stochastic Unit Commitment Problem

2017-11-01

Ignacio Blanco

Juan M. Morales *

DOI：10.1109/TPWRS.2017.2683263

Original

Save

View PDF

Abstract

En 中文

This paper provides a reformulation of the scenariobased two-stage unit commitment problem under uncertainty that allows finding unit-commitment plans that perform reasonably well both in expectation and for the worst case. The proposed reformulation is based on partitioning the sample space of the uncertain factors by clustering the scenarios that approximate their probability distributions. The degree of conservatism of the resulting unit-commitment plan (that is, how close it is to the one provided by a purely robust or stochastic unit-commitment formulation) is controlled by the number of partitions into which the said sample space is split. To efficiently solve the proposed reformulation of the unit-commitment problem under uncertainty, we develop two alternative parallelization and decomposition schemes that rely on a column-and-constraint generation procedure. Finally, we analyze the quality of the solutions provided by this reformulation for a case study based on the IEEE 14-node power system and test the effectiveness of the proposed parallelization and decomposition solution approaches on the larger IEEE 3-Area RTS-96 power system.

Keywords:

Stochastic and robust unit commitment

clustering

column-and-constraint generation

parallel computing

scenario reduction

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.