Please use this identifier to cite or link to this item: https://doi.org/10.1109/PES.2011.6039516
Title: Stochastic unit commitment using multi-cut decomposition algorithm with partial aggregation
Authors: Xiong, P.
Jirutitijaroen, P. 
Keywords: Mix-Integer Linear Programming
Multi-Cut Algorithm
Stochastic Programming
Unit Commitment
Issue Date: 2011
Citation: Xiong, P.,Jirutitijaroen, P. (2011). Stochastic unit commitment using multi-cut decomposition algorithm with partial aggregation. IEEE Power and Energy Society General Meeting : -. ScholarBank@NUS Repository. https://doi.org/10.1109/PES.2011.6039516
Abstract: This paper solves stochastic unit commitment problems using multi-cut decomposition algorithm with partial aggregation. The generation unavailability and load uncertainty are both incorporated into the unit commitment formulation, and it is demonstrated by simulations that this method has better performance in economic and reliability perspective than its deterministic counterpart. The modified version of multi-cut algorithm is used to solve this large-scale unit commitment problem. The efficiency of this modified multi-cut algorithm with different levels of aggregation is examined by numerical studies, which show that the computational cost is significantly reduced by the algorithm. © 2011 IEEE.
Source Title: IEEE Power and Energy Society General Meeting
URI: http://scholarbank.nus.edu.sg/handle/10635/71870
ISBN: 9781457710018
ISSN: 19449925
DOI: 10.1109/PES.2011.6039516
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

9
checked on Oct 14, 2018

Page view(s)

33
checked on May 4, 2018

Google ScholarTM

Check

Altmetric


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