Short-term thermal unit commitment-a new method
- 1 May 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 3 (2) , 421-428
- https://doi.org/10.1109/59.192892
Abstract
A method and an algorithm based on this new method are presented. The effectiveness of the algorithm is illustrated by studying a 20-unit midwestern utility system, the EPRI 174-unit synthetic utility system D, and the EPRI 155-unit synthetic utility system E. The algorithm produces the same unit commitment schedule for the 20-unit system as a frequently used DP-STC algorithm in 15 s of computation time versus 524 s, respectively. The computation time is approximately linear with the number of hours in the unit commitment horizon. For the EPRI 174-unit system the algorithm requires only 205 s of computation time on a VAX 11/780 for a 48-hour horizon.>Keywords
This publication has 7 references indexed in Scilit:
- Scheduling of Generation and Allocation of Fuel, Using Dynamic and Linear ProgrammingIEEE Transactions on Power Apparatus and Systems, 1984
- A New Method for Unit Commitment at Electricite De FranceIEEE Transactions on Power Apparatus and Systems, 1983
- A Branch-and-Bound Algorithm for Unit CommitmentIEEE Transactions on Power Apparatus and Systems, 1983
- Solution of Large-Scale Optimal Unit Commitment ProblemsIEEE Transactions on Power Apparatus and Systems, 1982
- Evaluation of Dynamic Programming Based Methods and Multiple area Representation for Thermal Unit CommitmentsIEEE Transactions on Power Apparatus and Systems, 1981
- An Application of Lagrangian Relaxation to Scheduling in Power-Generation SystemsOperations Research, 1977
- Optimal short-term thermal unit commitmentIEEE Transactions on Power Apparatus and Systems, 1976