Unit Commitment Problem Solution Using Shuffled Frog Leaping Algorithm

作者：Ebrahimi Javad^*; Hosseinian Seyed Hossein; Gharehpetian Gevorg B

来源：IEEE Transactions on Power Systems, 2011, 26(2): 573-581.

DOI：10.1109/TPWRS.2010.2052639

• Economic dispatch
• generation scheduling
• optimization techniques
• shuffled frog leaping algorithm
• unit commitment

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.

• 出版日期2011-5