Please use this identifier to cite or link to this item: https://doi.org/10.1109/PMAPS.2010.5528897
Title: Convergence acceleration techniques for the stochastic unit commitment problem
Authors: Peng, X.
Jirutitijaroen, P. 
Keywords: L-shaped algorithm
Load uncertainty
Spinning reserve
Two-stage stochastic programming
Unit commitment
Issue Date: 2010
Source: Peng, X.,Jirutitijaroen, P. (2010). Convergence acceleration techniques for the stochastic unit commitment problem. 2010 IEEE 11th International Conference on Probabilistic Methods Applied to Power Systems, PMAPS 2010 : 364-371. ScholarBank@NUS Repository. https://doi.org/10.1109/PMAPS.2010.5528897
Abstract: This paper proposes a two-stage stochastic mix-integer programming formulation that addresses a unit commitment (UC) problem in a probabilistic manner. The objective of this problem is to minimize the expected operating cost for the decision time horizon under load uncertainty. The problem is solved using a standard L-shaped algorithm. We then propose some acceleration techniques to improve convergence behavior. These techniques are tested on a 9-bus system to determine computing efficiency. Results show that the proposed acceleration techniques reduce number of iterations as well as the algorithm convergence time. © 2010 IEEE.
Source Title: 2010 IEEE 11th International Conference on Probabilistic Methods Applied to Power Systems, PMAPS 2010
URI: http://scholarbank.nus.edu.sg/handle/10635/69740
ISBN: 9781424457236
DOI: 10.1109/PMAPS.2010.5528897
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Dec 11, 2017

Page view(s)

16
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.