Multi-objective placement in UCP by improved honey Bee Mating Optimization

摘要

Improved version of Honey Bee Mating Optimization (IHBMO) algorithm is used here to solve the Unit Commitment Problem (UCP). Actually, the computation of the optimization process is too complex in the non linear scheduling problem. When large number of thermal units are employed, this problem becomes difficult to undertake in the power system. IHBMO technique is the combination of the genetic algorithm and simulated annealing which is used for the fast local search to obtain the best solution. To show the effect and robustness of the IHBMO a ten thermal unit system at various conditions is considered. The simulation result is obtained from the reference UC and algorithm results.