Hybrid Taguchi-Immune Algorithm for the thermal unit commitment

In this paper, a Hybrid Taguchi-Immune Algorithm (HTIA) is presented to deal with the unit commitment problem. HTIA integrates the Taguchi method and the Traditional Immune Algorithm (TIA), providing a powerful global exploration capability. The Taguchi method (TM) is incorporated in the crossover operations in order to select the better gene for achieving crossover consequently, enhancing the TIA. It has been widely used in experimental designs for problems with multiple parameters. The effectiveness and efficiency of HTIA are demonstrated by presenting several cases, and the results are compared with previous publications. Our results show that the proposed method is feasible, robust, and more effective than many other previously developed computation algorithms.

[1]  T.O. Ting,et al.  A novel approach for unit commitment problem via an effective hybrid particle swarm optimization , 2006, IEEE Transactions on Power Systems.

[2]  Ahmed Yousuf Saber,et al.  Scalable unit commitment by memory-bounded ant colony optimization with A∗ local search , 2008 .

[3]  L. N. Harris,et al.  Taguchi techniques for quality engineering, Philip J. Ross, Mcgraw-hill book company, 1988 , 1989 .

[4]  Claudio A. Roa-Sepulveda,et al.  A 4-state unit definition for the unit commitment problem , 2007 .

[5]  Tung-Kuan Liu,et al.  Hybrid Taguchi-genetic algorithm for global numerical optimization , 2004, IEEE Transactions on Evolutionary Computation.

[6]  Nanming Chen,et al.  A double-filtration algorithm for optimal scheduling of thermal units , 2004 .

[7]  Shyh-Jier Huang,et al.  An immune-based optimization method to capacitor placement in a radial distribution system , 2000 .

[8]  M. R. Mohan,et al.  An evolutionary programming-based tabu search method for solving the unit commitment problem , 2004, IEEE Transactions on Power Systems.

[9]  Anastasios G. Bakirtzis,et al.  A genetic algorithm solution to the unit commitment problem , 1996 .

[10]  Tomonobu Senjyu,et al.  Fast technique for unit commitment by genetic algorithm based on unit clustering , 2005 .

[11]  Song-Yop Hahn,et al.  A study on comparison of optimization performances between immune algorithm and other heuristic algorithms , 1998 .

[12]  K. Chandram,et al.  Unit Commitment by improved pre-prepared power demand table and Muller method , 2011 .

[13]  G.-C. Liao.  Application of an immune algorithm to the short-term unit commitment problem in power system operation , 2006 .

[14]  E. Mosca.  Optimal, Predictive and Adaptive Control , 1994 .

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

[16]  Mats J Edvinsson.  Load Management in Europe - Marketing Aspects , 1986, IEEE Transactions on Power Systems.

[17]  Farid Benhamida,et al.  Enhanced Lagrangian relaxation solution to the generation scheduling problem , 2010 .

[18]  T. Senjyu,et al.  Fuzzy unit commitment scheduling using absolutely stochastic simulated annealing , 2006, IEEE Transactions on Power Systems.

[19]  Bor-Wen Cheng,et al.  A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm , 2007, Expert Syst. Appl..

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

[21]  K. Uezato,et al.  A fast technique for unit commitment problem by extended priority list , 2003, 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491).

[22]  D. P. Kothari,et al.  Optimal thermal generating unit commitment: a review , 1998 .

[23]  N.P. Padhy,et al.  Unit commitment-a bibliographical survey , 2004, IEEE Transactions on Power Systems.

[24]  C. Christober Asir Rajan,et al.  An evolutionary programming based simulated annealing method for solving the unit commitment problem , 2007 .

[25]  Tung-Kuan Liu,et al.  Optimal design of digital IIR filters by using hybrid taguchi genetic algorithm , 2006, IEEE Trans. Ind. Electron..