2003
DOI: 10.1111/j.1475-3995.2004.00437.x
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic unit commitment problem

Abstract: The electric power industry is undergoing restructuring and deregulation. We need to incorporate the uncertainty of electric power demand or power generators into the unit commitment problem. The unit commitment problem is to determine the schedule of power generating units and the generating level of each unit. The objective is to minimize the operational cost which is given by the sum of the fuel cost and the start-up cost. In this paper we propose a new algorithm for the stochastic unit commitment problem w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
46
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
7
2
1

Relationship

1
9

Authors

Journals

citations
Cited by 87 publications
(46 citation statements)
references
References 12 publications
0
46
0
Order By: Relevance
“…Many popular algorithms for stochastic unit commitment (SUC) problems are based on decomposition techniques. They can be divided into three groups: Benders decomposition [9], Progressive Hedging [10], and Lagrangian relaxation [11] or Dantzig-Wolfe decomposition [12]. All three approaches are applicable to two-stage or multi-stage models and can be used to decompose the problem by stages, scenarios, or generation units.…”
Section: Introductionmentioning
confidence: 99%
“…Many popular algorithms for stochastic unit commitment (SUC) problems are based on decomposition techniques. They can be divided into three groups: Benders decomposition [9], Progressive Hedging [10], and Lagrangian relaxation [11] or Dantzig-Wolfe decomposition [12]. All three approaches are applicable to two-stage or multi-stage models and can be used to decompose the problem by stages, scenarios, or generation units.…”
Section: Introductionmentioning
confidence: 99%
“…Alternative relaxations were subsequently presented by Carpentier et al [20] and Nowak and Römisch [21]. Shiina and Birge [22] presented an alternative decomposition approach for solving the stochastic unit commitment problem using column decomposition. In Papavasiliou et al [14] the authors present a dual decomposition algorithm for solving the problem that is also used in this paper.…”
Section: Introductionmentioning
confidence: 99%
“…Representative integer programming and combinatorial optimization problems include the unit commitment problem , Shiina and Birge (2004) Shiina and Watanabe (2004)) and the power generation planning problem (Shiina and Birge (2003)). Discussions of the application of stochastic programming methods to the electricity industry can be found in works by Ruszczyński and Shapiro (2008) and by Shapiro, Dentcheva and Ruszczyński (2009).…”
Section: Introductionmentioning
confidence: 99%