A New Hybrid Approach for Unit Commitment Using Lagrangian Relaxation Combined with Evolutionary and Quadratic Programming
Authors:
- M. BavafaMBM. Bavafa
- H. MonsefHMH. Monsef
- N. NavidiNNN. Navidi
- 1 March 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 14 (21574839) , 1-6
Abstract
This paper proposes an approach which combines Lagrangian relaxation principle with evolutionary programming and quadratic programming (LREQP) for short-term thermal unit commitment. Unit commitment is a complex combinatorial optimization problem which is difficult to be solved for large-scale power systems. This paper presents a hybrid method for ramp rate constrained unit commitment (RUC) problem. Hybrid LREQP minimizes the total supply cost subject to the power balance, generation ramp limit constraints, on/off line minimum level constraints, minimum up and new down time constraints and generator operating constraints. The proposed solution method solves unit commitment problem with two coordination procedures. In the first procedure, an evolutionary programming algorithm is used to improve a solution obtained by the Lagrangian relaxation method: Lagrangian relaxation gives the starting point for a evolutionary programming procedure. In the second procedure, economic dispatch (ED) by quadratic programming (QP) is performed 24 hours to simultaneously dispatch output subject to all constraints and unit decommitment is carried out. Hybrid LREQP is tested on the 26 unit IEEE reliability test system. The proposed algorithm takes the advantages of both methods and therefore it can search a better solution within short computation time.Keywords
This publication has 21 references indexed in Scilit:
- A new approach for GenCos profit based unit commitment in day-ahead competitive electricity markets considering reserve uncertaintyInternational Journal of Electrical Power & Energy Systems, 2007
- Unit Commitment by Enhanced Adaptive Lagrangian RelaxationIEEE Transactions on Power Systems, 2004
- Congestion management for generation scheduling in a deregulated Chinese power system2001
- Unit commitment with transmission security and voltage constraintsIEEE Transactions on Power Systems, 1999
- Auction implementation problems using Lagrangian relaxationIEEE Transactions on Power Systems, 1999
- An evolutionary programming solution to the unit commitment problemIEEE Transactions on Power Systems, 1999
- Optimal scheduling of spinning reserveIEEE Transactions on Power Systems, 1999
- A practical resource scheduling with OPF constraintsIEEE Transactions on Power Systems, 1996
- Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxationIEEE Transactions on Power Systems, 1995
- Daily generation scheduling optimization with transmission constraints: a new class of algorithmsIEEE Transactions on Power Systems, 1992