A modified binary artificial bee colony algorithm for ramp rate constrained unit commitment problem

被引:20
|
作者
Singhal, Prateek K. [1 ]
Naresh, Ram [1 ]
Sharma, Veena [1 ]
机构
[1] Natl Inst Technol, Dept Elect Engn, Hamirpur, HP, India
关键词
binary artificial bee colony; crossover; dynamic economic dispatch; ramp rates; unit commitment; DYNAMIC ECONOMIC-DISPATCH; PARTICLE SWARM OPTIMIZATION; ABC ALGORITHM;
D O I
10.1002/etep.2046
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes a new approach based on modified binary artificial bee colony (MBABC) algorithm and dynamic economic dispatch (DED) method for unit commitment problem (UCP). MBABC algorithm is used for committing/decommitting the thermal units, while optimum dispatch solution is determined using DED method. Proposed MBABC algorithm utilizes a new mechanism based on the measure of dissimilarity between binary strings for generating the new binary solutions for UCP. Moreover, in MBABC algorithm, an intelligent scout bee phase is proposed that replaces the abandoned solution with the global best solution. The solution quality achieved by MBABC is enhanced by hybridizing the genetic crossover (GC) that provides the diversified search space. Performance of the proposed MBABC-GC algorithm is tested up to 300 thermal units over 24-hour time interval. The comparison of obtained results with other methods in the literature has confirmed the superiority of the MBABC-GC algorithm in terms of production cost and robustness. Copyright (C) 2015 John Wiley & Sons, Ltd.
引用
收藏
页码:3472 / 3491
页数:20
相关论文
共 50 条