Thermal Unit Commitment Using Binary Differential Evolution

This paper presents a new approach for thermal unit commitment (UC) using a differential evolution (DE) algorithm. DE is an effective, robust, and simple global optimization algorithm which only has a few control parameters and has been successfully applied to a wide range of optimization problems. However, the standard DE cannot be applied to binary optimization problems such as UC problems since it is restricted to continuous-valued spaces. This paper proposes binary differential evolution (BDE), which enables the DE to operate in binary spaces and applies the proposed BDE to UC problems. Furthermore, this paper includes heuristic-based constraint treatment techniques to deal with the minimum up/down time and spinning reserve constraints in UC problems. Since excessive spinning reserves can incur high operation costs, the unit de-commitment strategy is also introduced to improve the solution quality. To demonstrate the performance of the proposed BDE, it is applied to largescale power systems of up to 100-units with a 24-hour demand horizon.

[1]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[2]  Richard C. Wilson,et al.  An Application of Mixed-Integer Programming Duality to Scheduling Thermal Generating Systems , 1968 .

[3]  Allen J. Wood,et al.  Power Generation, Operation, and Control , 1984 .

[4]  Jasbir S. Arora,et al.  Introduction to Optimum Design , 1988 .

[5]  Eiichi Tanaka,et al.  An Evolutionary Programming Solution to the Unit Commitment Problem , 1997 .

[6]  Mohamed Rachid Mekideche,et al.  Inverse Problem Methodology for Parameter Identification of a Separately Excited DC Motor , 2009 .

[7]  Francisco D. Galiana,et al.  Towards a more rigorous and practical unit commitment by Lagrangian relaxation , 1988 .

[8]  C.D. Vournas,et al.  Unit Commitment by an Enhanced Simulated Annealing Algorithm , 2006, 2006 IEEE PES Power Systems Conference and Exposition.

[9]  Arthur I. Cohen,et al.  A Branch-and-Bound Algorithm for Unit Commitment , 1983, IEEE Transactions on Power Apparatus and Systems.

[10]  A. Merlin,et al.  A New Method for Unit Commitment at Electricite De France , 1983, IEEE Transactions on Power Apparatus and Systems.

[11]  K. S. Swarp,et al.  Unit Connuitment Solution Methodology Using Genetic Algorithm , 2002, IEEE Power Engineering Review.

[12]  Wei Xiong,et al.  An Improved Particle Swarm Optimization Algorithm for Unit Commitment , 2008, 2008 International Conference on Intelligent Computation Technology and Automation (ICICTA).

[13]  S. M. Shahidehpour,et al.  An intelligent dynamic programming for unit commitment application , 1991 .

[14]  Francisco D. Galiana,et al.  Unit commitment by simulated annealing , 1990 .

[15]  H. Chen,et al.  Cooperative Coevolutionary Algorithm for Unit Commitment , 2002, IEEE Power Engineering Review.

[16]  Walter L. Snyder,et al.  Dynamic Programming Approach to Unit Commitment , 1987, IEEE Transactions on Power Systems.

[17]  Costas Vournas,et al.  Unit commitment by an enhanced simulated annealing algorithm , 2006 .

[18]  Ji-Pyng Chiou,et al.  Robust searching hybrid differential evolution method for optimal reactive power planning in large-scale distribution systems , 2007 .

[19]  Panthep Laohachai,et al.  Parameter Estimation of Three-Phase Induction Motor by Using Genetic Algorithm , 2009 .

[20]  Gerald B. Sheblé,et al.  Solution of the unit commitment problem by the method of unit periods , 1990 .