Abstract: An Upgraded Cuckoo Search Algorithm is proposed here to solve optimization problems based on the improvements made in the earlier versions of Cuckoo Search Algorithm. Short comings of the earlier versions like slow convergence, trap in local optima improved in the proposed version by random initialization of solution by suggesting an Improved Lambda Iteration Relaxation method, Random Gaussian Distribution Walk to improve local search and further proposing Greedy Selection to accelerate to optimized solution quickly and by “Study Nearby Strategy” to improve global search performance by avoiding trapping to local optima. It is further proposed to generate better solution by Crossover Operation. The proposed strategy used in algorithm shows superiority in terms of high convergence speed over several classical algorithms. Three standard algorithms were tested on a 6-generator standard test system and the results are presented which clearly demonstrate its superiority over other established algorithms. The algorithm is also capable of handling higher unit systems.
Abstract: This study presents a modified version of the artificial bee colony (ABC) algorithm by including a local search technique for solving the non-convex economic power dispatch problem. The local search step is incorporated at the end of each iteration. Total system losses, valve-point loading effects and prohibited operating zones have been incorporated in the problem formulation. Thus, the problem becomes highly nonlinear and with discontinuous objective function. The proposed technique is validated using an IEEE benchmark system with ten thermal units. Simulation results demonstrate that the proposed optimization algorithm has better convergence characteristics in comparison with the original ABC algorithm.
Abstract: This paper proposes an improved approach based on
conventional particle swarm optimization (PSO) for solving an
economic dispatch(ED) problem with considering the generator
constraints. The mutation operators of the differential evolution (DE)
are used for improving diversity exploration of PSO, which called
particle swarm optimization with mutation operators (PSOM). The
mutation operators are activated if velocity values of PSO nearly to
zero or violated from the boundaries. Four scenarios of mutation
operators are implemented for PSOM. The simulation results of all
scenarios of the PSOM outperform over the PSO and other existing
approaches which appeared in literatures.