Resolution of the unit commitment problems by using the hybrid Taguchi-ant colony system algorithm

Abstract This work presents a hybrid Taguchi-ant colony system (HTACS) algorithm to solve the unit commitment (UC) problem. The proposed algorithm integrates the Taguchi method and the conventional ant colony system (ACS) algorithm, providing a powerful global exploration capability. The Taguchi method is incorporated into the ACS process before its global pheromone update mechanism. Based on the systematic reasoning ability of the Taguchi method, improved UC solutions are selected quickly to represent potential UC schedules, subsequently, enhancing the ACS algorithm. Therefore, the proposed HTACS algorithm can be highly robust, statistically sound and quickly convergent. Additionally, feasibility of the proposed algorithm is demonstrated on a 10-unit system. Analysis results demonstrate that the proposed algorithm is feasible, robust, and more effective in solving the UC problem than conventional ACS methods.

[1]  K. Chandrasekaran,et al.  Optimal Deviation Based Firefly Algorithm Tuned Fuzzy Design for Multi-Objective UCP , 2013, IEEE Transactions on Power Systems.

[2]  W. Ongsakul,et al.  Unit commitment by enhanced adaptive Lagrangian relaxation , 2004, IEEE Transactions on Power Systems.

[3]  Narayana Prasad Padhy,et al.  An ant colony system approach for unit commitment problem , 2006 .

[4]  M. Shahidehpour,et al.  Price-based unit commitment: a case of Lagrangian relaxation versus mixed integer programming , 2005, IEEE Transactions on Power Systems.

[5]  Xiaoqing Bai,et al.  Semi-definite programming-based method for security-constrained unit commitment with operational and optimal power flow constraints , 2009 .

[6]  Ayaz Ahmad,et al.  Profit based unit commitment and economic dispatch of IPPs with new technique , 2013 .

[7]  Chern-Lin Chen,et al.  Branch-and-bound scheduling for thermal generating units , 1993 .

[8]  Thomas Stützle,et al.  A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..

[9]  Juan Álvarez Lopez,et al.  Commitment of Combined Cycle Plants Using a Dual Optimization–Dynamic Programming Approach , 2011, IEEE Transactions on Power Systems.

[10]  Jin Hao,et al.  Ant colony optimization algorithm with random perturbation behavior to the problem of optimal unit commitment with probabilistic spinning reserve determination , 2004 .

[11]  Chuan-Ping Cheng,et al.  Unit commitment by Lagrangian relaxation and genetic algorithms , 2000 .

[12]  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.

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

[14]  Narayana Prasad Padhy,et al.  Thermal unit commitment using binary/real coded artificial bee colony algorithm , 2012 .

[15]  S. J. Huang,et al.  Enhancement of Hydroelectric Generation Scheduling Using Ant Colony System-Based Optimization Approaches , 2001, IEEE Power Engineering Review.

[16]  Sishaj P. Simon,et al.  Nodal ant colony optimization for solving profit based unit commitment problem for GENCOs , 2012, Appl. Soft Comput..

[17]  Tomonobu Senjyu,et al.  Optimal operation of thermal unit in smart grid considering transmission constraint , 2012 .

[18]  In-Keun Yu,et al.  A novel short-term generation scheduling technique of thermal units using ant colony search algorithms , 2001 .

[19]  T. R. Bement,et al.  Taguchi techniques for quality engineering , 1995 .

[20]  M. Carrion,et al.  A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem , 2006, IEEE Transactions on Power Systems.

[21]  C.D. Vournas,et al.  Reliability Constrained Unit Commitment Using Simulated Annealing , 2006, IEEE Transactions on Power Systems.

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

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

[24]  K. Vaisakh,et al.  Evolving ant colony optimization based unit commitment , 2011, Appl. Soft Comput..

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

[26]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

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

[28]  A. Bakirtzis,et al.  A solution to the unit-commitment problem using integer-coded genetic algorithm , 2004, IEEE Transactions on Power Systems.

[29]  Jin-Ho Kim,et al.  A Novel Binary Ant Colony Optimization: Application to the Unit Commitment Problem of Power Systems , 2011 .

[30]  K. Chandrasekaran,et al.  Network and reliability constrained unit commitment problem using binary real coded firefly algorithm , 2012 .

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

[32]  K. P. Wong,et al.  Artificial intelligence algorithms for short term scheduling of thermal generators and pumped-storage , 1997 .

[33]  Tomonobu Senjyu,et al.  A fast technique for unit commitment problem by extended priority list , 2003 .

[34]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[35]  Ying Cai,et al.  Taguchi method for solving the economic dispatch problem with nonsmooth cost functions , 2005 .

[36]  Dilip Datta,et al.  A binary-real-coded differential evolution for unit commitment problem , 2012 .

[37]  N. Yamashita,et al.  New Local Search Methods for Improving the Lagrangian-Relaxation-Based Unit Commitment Solution , 2010, IEEE Transactions on Power Systems.