Optimization Online


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

Wim van Ackooij(wim.van.ackooij***at***gmail.com)
Jérôme Malick(jerome.malick***at***inria.fr)

Abstract: 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.

Keywords: two-stage integer programming, stochastic unit-commitment, price decomposition, convex duality, nonsmooth optimization, bundle methods

Category 1: Stochastic Programming

Category 2: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 3: Applications -- OR and Management Sciences


Download: [PDF]

Entry Submitted: 04/22/2015
Entry Accepted: 04/22/2015
Entry Last Modified: 04/22/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society