1976
DOI: 10.1109/t-pas.1976.32228
|View full text |Cite
|
Sign up to set email alerts
|

Optimal short-term thermal unit commitment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
48
0

Year Published

1986
1986
2012
2012

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 191 publications
(48 citation statements)
references
References 9 publications
0
48
0
Order By: Relevance
“…These include deterministic, meta-heuristic, and hybrid approaches. Deterministic approaches include the priority list method [4], dynamic programming [5], Lagrangian Relaxation (LR) [6], integer/mixed-integer programming [7], [8], and the branch-andbound methods [9]. Due to the mixed binary and continuous variable nature, of the short term scheduling problem traditional optimization techniques may miss the optimal solution.…”
Section: Unmanaged Short-term Scheduling Of Fcppsmentioning
confidence: 99%
“…These include deterministic, meta-heuristic, and hybrid approaches. Deterministic approaches include the priority list method [4], dynamic programming [5], Lagrangian Relaxation (LR) [6], integer/mixed-integer programming [7], [8], and the branch-andbound methods [9]. Due to the mixed binary and continuous variable nature, of the short term scheduling problem traditional optimization techniques may miss the optimal solution.…”
Section: Unmanaged Short-term Scheduling Of Fcppsmentioning
confidence: 99%
“…[7,6,4,5]. These programs also consider power system requirements such as unit maintenance schedules, minimum up and down time requirements, spinning reserve etc.…”
Section: Unit Commitment Constraintsmentioning
confidence: 99%
“…For a larger system, a more heuristic approach that is truncated dynamic programming may be used to replace the current dynamic programming to commit the thermal units [4,5] .…”
Section: Amentioning
confidence: 99%
“…There are so many methods are executed to solve static problems. The dynamic problems are solved by the methods like priority list method [4] , dynamic programming methods [5,6] , branch and bound methods, Benders partitioning methods and Lagrangian relaxation (LR) methods [7][8][9][10] . The LR approaches are characterized by their ability to handle various constraints and to estimate the optimality of the solution in practical applications.…”
Section: Introductionmentioning
confidence: 99%