Economic Dispatch Using Hybrid of Differential Evolution and Water Cycle Algorithm (T-0404) (MFN 5880)

Abstract

Economic dispatch (ED) is a very demanding part of power system operational and control detailed by means of procedure of evaluating electrical power production of thermal machines for lowest total power cost in a manner that both equality (i.e. Power demand) and inequality (i.e. Generating machine limits) constraints are satisfied. In system optimization, there are two minima in search space a native minima and global minima. Complication is to find global minima instead of local minima. ED is a trying OP that needs proficient computational techniques. Many classical methods, such as mixed integer programming, newton technique, DP, gradient search method, Lagrange method, nonlinear programming with network flow, and Lagrange relaxation. [1-4] these traditional methods have drawback of finding a local minimum instead of global minima. We have many techniques called evolutionary procedures to solve such types of complications with global minima e.g. Cooku Search Algorithm, Fuzzy evolutionary programming (fuzzy EP), Simulated annealing based goal-attainment (SAGA), Quantum particle swarm optimization (QPSO), differential evolution(DE) & Water Cycle Algorithm(WCA) etc. In this report a hybrid of differential evolution(DE) and water cycle algorithm (WCA) is implemented on ED. DE is a heuristic approach for minimalizing non differentiable also non linear unremitting space functions and WCA is a meta-heuristic population constructed algorithm which has been recently introduced for cracking restrained Optimization Problems OPs. Hybrid of DE and WCA is tested on non-convex test systems in this project. The feasibility is demonstrated for three different standard systems (3 machine,6 machine and 10 machine system) published on IEEE, and matched with further optimization mechanisms concerning the result quality. Results demonstrate that prescribed scheme is competent for ED problems to uncover heal thier results efficiently.