A COMBINATION OF THE GENETIC ALGORITHM AND LAGRANGIAN-RELAXATION DECOMPOSITION TECHNIQUES FOR THE GENERATION UNIT COMMITMENT PROBLEM

Unit commitment involves the scheduling of generators in a power syste m in order to meet the requirements of a given load profile. An analys is of the basis for combining the genetic algorithm (GA) and Lagrangia n relaxation (LR) methods for the unit commitment problem is presented . It is shown that a robust unit commitment algorithm can be obtained by combining the global search property of the genetic algorithm with the ability of the Lagrangian decomposition technique to handle all ki nds of constraints such as pollution, unit ramping and transmission se curity. (C) 1997 Elsevier Science S.A.