Decomposition algorithm for large-scale two-stage unit-commitment - Archive ouverte HAL Access content directly
Journal Articles Annals of Operations Research Year : 2016

Decomposition algorithm for large-scale two-stage unit-commitment


Everyday, electricity generation companies submit a generation schedule to the grid operator for the coming day; computing an optimal schedule is called the unit-commitment problem. Generation companies can also occasionally submit changes to the schedule, that can be seen as intra-daily incomplete recourse actions. In this paper, we propose a two-stage formulation of unit-commitment, wherein both the first and second stage problems are full unit-commitment problems. We present a primal-dual decomposition approach to tackle large-scale instances of these two-stage problems. The algorithm makes extensive use of warm-started bundle algorithms, and requires no specific knowledge of the underlying technical constraints. We provide an analysis of the theoretical properties of the algorithm, as well as computational experiments showing the interest of the approach for real-life large-scale unit-commitment instances.
Fichier principal
Vignette du fichier
vanAckooij-Malick.pdf (685.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01145653 , version 1 (24-04-2015)



Wim van Ackooij, Jérôme Malick. Decomposition algorithm for large-scale two-stage unit-commitment. Annals of Operations Research, 2016, 238 (1), pp.587-613. ⟨10.1007/s10479-015-2029-8⟩. ⟨hal-01145653⟩
380 View
447 Download



Gmail Facebook Twitter LinkedIn More