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

Abstract

Summary 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 © 2015 John Wiley & Sons, Ltd.

A micro-artificial bee colony based multicast routing in vehicular ad hoc networks

“…This avoids the notorious problem of choosing proper repair method [31] . Unlike the proposed algorithm in [27,[32][33][34] , The MABC algorithm does not introduce any new parameter, and does not increase the burden of algorithmic parameter control. …”

Application of stud krill herd algorithm for solution of optimal power flow problems

“…The same may be overcome by normalizing the ET of different methods. Therefore, in the present paper ET of the SKH algorithm is compared with another existing optimization algorithms by normalizing the processor chip frequency as shown in Equation 22 …”

Ant lion optimizer versus particle swarm and artificial immune system for economical and eco‐friendly power system operation

“…Recently, several evolutionary programs are investigated for solving ELD problem. The literature documents the most relevant . The evolutionary algorithms in general require limited knowledge of the problem.…”

“…The most promising meta‐heuristic approaches for ELD are fast converging evolutionary programming, ant colony, population variant differential evolution, genetic algorithm, Tabu search, differential harmony, bacterial foraging, artificial bee colony, firefly algorithm, simulated annealing, semi‐definite programming, gravitational search algorithm, and hybrid univariate marginal distribution algorithm . It could be concluded based on literature that some evolutionary approaches suffer from serious drawbacks as premature convergence, time consuming, and initial solution sensitivity. Moreover, they differ widely according to the implementation complexity, the computation speed, and the storage requirements …”

“…It could be concluded based on literature that some evolutionary approaches suffer from serious drawbacks as premature convergence, time consuming, and initial solution sensitivity. Moreover, they differ widely according to the implementation complexity, the computation speed, and the storage requirements …”