An implementation of harmony search algorithm to unit commitment problem

This paper presents a harmony search algorithm (HSA) to solve unit commitment (UC) problem. HSA was conceptualized using the musical process of searching for a perfect state of harmony, just as the optimization process seeks to find a global solution that is determined by an objective function. HSA can be used to optimize a non-convex optimization problem with both continuous and discrete variables. In this paper it is shown that HSA, as a heuristic optimization algorithm, may solve power system scheduling problem in a better fashion in comparison with the other evolutionary search algorithm that are implemented in such complicated issue. Two case studies are conducted to facilitate the effectiveness of the proposed method. One is a conventional 10-unit test system and its multiples while the other is a 26-unit system, both of which are with a 24-h scheduling horizon. Comparison of the obtained results with other approaches addressed in the literature shows the effectiveness and fastness of the proposed method.

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

[2]  Malcolm Irving,et al.  A genetic algorithm modelling framework and solution technique for short term optimal hydrothermal scheduling , 1998 .

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

[4]  F. Aminifar,et al.  A Novel Straightforward Unit Commitment Method for Large-Scale Power Systems , 2007, IEEE Transactions on Power Systems.

[5]  S. Oren,et al.  Solving the Unit Commitment Problem by a Unit Decommitment Method , 2000 .

[6]  M. Fesanghary,et al.  Combined heat and power economic dispatch by harmony search algorithm , 2007 .

[7]  S. M. Shahidehpour,et al.  Unit commitment using a hybrid model between Lagrangian relaxation and genetic algorithm in competitive electricity markets , 2004 .

[8]  A. J. Svoboda,et al.  A new unit commitment method , 1997 .

[9]  T. Numnonda,et al.  Unit commitment by parallel simulated annealing , 1995 .

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

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

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

[13]  C.-P. Cheng,et al.  Unit commitment by annealing-genetic algorithm , 2002 .

[14]  A.H. Mantawy,et al.  A new tabu search algorithm for the long-term hydro scheduling problem , 2002, LESCOPE'02. 2002 Large Engineering Systems Conference on Power Engineering. Conference Proceedings.

[15]  Fu Yang,et al.  A Heuristic Particle Swarm Optimization Method and its Application in Power Network Planning , 2008, 2008 First International Conference on Intelligent Networks and Intelligent Systems.

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

[17]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[18]  Yuan-Yih Hsu,et al.  Fuzzy dynamic programming: an application to unit commitment , 1991 .

[19]  Ching-Lien Huang,et al.  Application of genetic-based neural networks to thermal unit commitment , 1997 .

[20]  H. H. Balci,et al.  Scheduling electric power generators using particle swarm optimization combined with the Lagrangian relaxation method , 2004 .

[21]  Alice E. Smith,et al.  A Seeded Memetic Algorithm for Large Unit Commitment Problems , 2002, J. Heuristics.

[22]  G.B. Gharehpetian,et al.  Fault current reduction in distribution systems with distributed generation units by a new dual functional series compensator , 2008, 2008 13th International Power Electronics and Motion Control Conference.

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

[24]  Minqiang Li,et al.  A floating-point genetic algorithm for solving the unit commitment problem , 2007, Eur. J. Oper. Res..

[25]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .

[26]  Chuangxin Guo,et al.  An improved particle swarm optimization algorithm for unit commitment , 2006 .

[27]  Weerakorn Ongsakul,et al.  Ramp rate constrained unit commitment by improved priority list and augmented Lagrange Hopfield network , 2008 .

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

[29]  K. Lee,et al.  A new structural optimization method based on the harmony search algorithm , 2004 .

[30]  Tomonobu Senjyu,et al.  Emerging solution of large-scale unit commitment problem by Stochastic Priority List , 2006 .

[31]  W. Ongsakul,et al.  Ramp Rate Constrained Unit Commitment by Improved Adaptive Lagrangian Relaxation , 2005 .

[32]  K. S. Swarup,et al.  A genetic algorithm approach to generator unit commitment , 2003 .

[33]  Z. Gaing.  Discrete particle swarm optimization algorithm for unit commitment , 2003, 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491).

[34]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[35]  Probability Subcommittee,et al.  IEEE Reliability Test System , 1979, IEEE Transactions on Power Apparatus and Systems.

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