Enhanced genetic algorithm with guarantee of feasibility for the unit commitment problem

  • Authors:
  • Guillaume Sandou;Stéphane Font;Sihem Tebbani;Arnaud Hiret;Christian Mondon

  • Affiliations:
  • Supelec, Automatic Control Department, Gif-sur-Yvette, France;Supelec, Automatic Control Department, Gif-sur-Yvette, France;Supelec, Automatic Control Department, Gif-sur-Yvette, France;EDF Recherche et Développement, Chatou, France;EDF Recherche et Développement, Chatou, France

  • Venue:
  • EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, an enhanced genetic algorithm for the Unit Commitmentproblem is presented. This problem is known to be a large scale, mixed integerprogramming problem for which exact solution is highly intractable.Thus, a metaheuristic based method has to be used to compute a very often suitablesolution. The main idea of the proposed enhanced genetic algorithm is touse a priori knowledge of the system to design new genetic operators so as toincrease the convergence rate. Further, a suitable penalty criterion is defined toexplicitly deal with numerous constraints of the problem and to guarantee thefeasibility of the solution. The method is also hybridized with an exact solutionalgorithm, which aims to compute real variables from integer variables. Finally,results show that the enhanced genetic algorithm leads to the tractable computationof a satisfying solution for large scale Unit Commitment problems.