Unit Commitment Problem Solution Using Shuffled Frog Leaping Algorithm

A new evolutionary algorithm known as the shuffled frog leaping algorithm is presented in this paper, to solve the unit commitment (UC) problem. This integer-coded algorithm has been developed to minimize the total energy dispatch cost over the scheduling horizon while all of the constraints should...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power systems 2011-05, Vol.26 (2), p.573-581
Main Authors: Ebrahimi, J, Hosseinian, S H, Gharehpetian, G B
Format: Article
Language:English
Subjects:
Anura
Convergence
Costs
Economic dispatch
Evolutionary computation
generation scheduling
Genetic algorithms
Java
Lagrangian functions
optimization techniques
Particle swarm optimization
Power generation
Quadratic programming
Scheduling algorithm
shuffled frog leaping algorithm
Studies
unit commitment
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new evolutionary algorithm known as the shuffled frog leaping algorithm is presented in this paper, to solve the unit commitment (UC) problem. This integer-coded algorithm has been developed to minimize the total energy dispatch cost over the scheduling horizon while all of the constraints should be satisfied. In addition, minimum up/down-time constraints have been directly coded not using the penalty function method. The proposed algorithm has been applied to ten up to 100 generating units, considering one-day and seven-day scheduling periods. The most important merit of the proposed method is its high convergence speed. The simulation results of the proposed algorithm have been compared with the results of algorithms such as Lagrangian relaxation, genetic algorithm, particle swarm optimization, and bacterial foraging. The comparison results testify to the efficiency of the proposed method.
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2010.2052639