GOVERNMENT ENGINEERING COLLEGE THRISSUR

Seminar on

Application of Evolutionary Computational Techniques to Economic Load Dispatch Problem

Aparna Menon K
ETAJEEE017

Under the guidance of Prof. P.A. Mercy, Prof. Jasmin E.A. & Prof. Meenakshy K.
1

Introduction
Economic Load Dispatch Problem
Artificial Bee Colony algorithm for hourly economic load dispatch Invasive Weed Optimization algorithm for daily economic load dispatch

Reduce the cost of production Conservation of energy

Fossil fuels-limited and costly

Mathematical modeling of a power plant tedious Number of power production units with their independent system properties

Problem Formulation
Mathematical modeling of thermal systems Express fuel cost as a function of the power produced Power produced dependent on the power demand Power demand varying with each hour

Hourly dispatch problem (Static ELD) Daily dispatch problem (Dynamic ELD)

Hourly Dispatch Problem

Objective function Minimize:
2 i i i i i

F
i 1
i i

NG

f (P )
i i

f (P ) a P b P c

i=1,2,3 NG

With valve point loading effect f ( P ) a P b P c e sin( f ( P Power balance constraints:

2 i i i i i i i i i

m in i

Pi ))

N P
G

i 1

P
0i i

P N N P B P N B P B
G G G

i 1

j 1

ij

i 1

00

Hourly Dispatch Problem

Generator constraints :

min

max

Ramp rate limits : If power generation increases Pti Pti 1 URi t 1 t If power generation decreases Pi Pi DRi
max(Pi ,URi Pi) Pi min( Pi , Pi DRi)
min max t 1

Prohibited operating zones :

Pi P

pz

Pi P

pz

Daily Dispatch Problem

Objective function : T N Minimize: F c k 1 i 1
G

F (P
ik

ik

i=1,2,3 NG

With valve point loading effect

F it ( Pit ) ai Pit bi Pit ci ei sin( f ( Pit Pit ))

2 m in it

Power balance constraints :

N P P
G

i 1

it

Dt

P Lt

Lt

NG G iN 1 j 1 Pit Bij P jt

Daily Dispatch Problem

Generator constraints : Pi
m in

m ax

Ramp rate limits : If power generation increases Pti Pti 1 URi If power generation decreases Pti 1 Pti DRi
max(Pi ,URi Pi) Pi min( Pi , Pi DRi)
min max t 1

Constraints handling

Evolutionary Computational Techniques

Mathematical optimization on large scale engineering problems difficult Linear programming and dynamic programming techniques inadequate Bio-inspired evolutionary algorithms for searching near-optimum solutions Simulate the natural biological evolution Learning, adaptation and evolution

Artificial Bee Colony Algorithm

Swarm based stochastic search algorithm (2006) Scrounging behavior of honey bee Three groups of bees: employed bees, onlookers and scouts
Only one employed bee for every food source Employed bee whose the food source has been abandoned by the bees becomes a scout Position of the food source determines the solution Amount of nectar represents the fitness of the respective solution

Artificial Bee Colony Algorithm

Initialization : randomly distributed initial population solution(xi=1,2...D) Reproduction :
Pi f t f t
i i N n 1 i

vij xij ( xij xkj)

ij

i (1,2,3NG) k (1,2,3NG) j (1,2,3D)

Replacement of bee and selection

limit for abandonment

xmin rand (0,1)( xmax xmin)

j j j

10

Invasive Weed Optimization Algorithm

Numerical stochastic search algorithm (2006) Simulating the natural behavior of weed colonizing in search domains for optimization of functions Invasive weeds cover spaces of opportunity left behind by improper tillage Colony become dense leaving lesser opportunity of life for the ones with lesser fitness

11

Invasive Weed Optimization Algorithm

Initialization : Population of initial solutions Reproduction : Procedure to concentrate on the highest fitness values in the search domain Spatial Dispersal (iter max iter) ( ) (iter max) Selection
n iter n initial final

Reach its maximum by fast reproduction When the maximum number of weeds in a colony is reached, each weed is allowed to produce seed as mentioned in reproduction When all seeds have found their position in the search area they are ranked together with their parents Weeds with lower fitness are eliminated to reach the maximum allowable population in a colony
12

ABC Algorithm On Hourly Economic Load Dispatch Problem

Applicability and viability of the ABC technique for practical applications tested on six-unit system Compared with the reported results of PSO, GA Six generating units -Total load demand 1263 MW Better results compared to GA and PSO Mean cost using the proposed approach is less

Parameters of all the thermal units are reported in Zwe-Lee Gaing, (2003)
13

IWO Algorithm On Daily Load Dispatch Problem

To solve the DED problem - 5 unit Transmission losses are calculated according to the formula given using the B coefficients The optimal scheduling for this problem is calculated by using the parameters of the IWO

Cost coefficients, generation limit, load pattern, ramp-rate limits are taken from R. Balamurugan and S. Subramanian, (2008)
14

Conclusion
Application of evolutionary computational techniques on economic load dispatch class of problems Practical generator operation is modeled using several nonlinear characteristics like ramp rate limits and prohibited operating zones Effectiveness of bio-inspired evolutionary computational techniques To solve smooth as well as non-smooth constrained ELD problems Newer algorithms statistically outperform the older ones

15

References
[1] A.I.Selvakumar & K. Thanushkodi (Feb 2007), A new particle swarm optimization Solution to nonconvex economic dispatch problems, IEEE Trans. on power systems, 22(1), 42-51. [2] Y. Sonmez (Jul 2011),Multi-objective environmental/economic dispatch solution with penalty factor using artificial bee colony algorithm, Scientific Research and Essays, Vol. 6 (13), pp. 2824-2831. [3] Dervis Karaboga & Bahriye Akay (2009), A comparative study of Artificial Bee Colony algorithm, Applied Mathematics and Computation, 214, 108132. [4] Krishnanand K.R., B.K. Panigrahi, Santanu Kumar Nayak, P.K. Rout, Comparative Study of Five Bio-Inspired Evolutionary Techniques, 2009 World Congress on Nature & Biologically Inspired Computing, IEEE, pp.1231-1236.

16

17