Scribd
Upload
36 views2 pages

Experiment-1: Coading-Economic Load Dispatch

This document describes an experiment on economic load dispatch with 6 generators. It initializes parameters like generator costs and limits. It then runs an optimization over 100 iterations to find the generator outputs that minimize total cost while meeting the load, updating the best solution found each iteration. The minimum total cost obtained was 654.5268 units, with the optimal generator outputs being 129.0272 46.2405 17.9709 24.5344 13.6335 17.7934 units.

Uploaded by

Swagat Pradhan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
36 views2 pages

Experiment-1: Coading-Economic Load Dispatch

This document describes an experiment on economic load dispatch with 6 generators. It initializes parameters like generator costs and limits. It then runs an optimization over 100 iterations to find the generator outputs that minimize total cost while meeting the load, updating the best solution found each iteration. The minimum total cost obtained was 654.5268 units, with the optimal generator outputs being 129.0272 46.2405 17.9709 24.5344 13.6335 17.7934 units.

Uploaded by

Swagat Pradhan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

EXPERIMENT-1

Coading-economic load dispatch


clear all;
clc;
pd=249.2;
ng=6;
np=10;
pgmax=[250 80 50 35 30 40];
pgmin=[50 20 15 10 10 12];
a=[0.0037 0.0175 0.0625 0.0083 0.0250 0.0250];
b=[2 1.75 1 3.25 3 3];
c=[0 0 0 0 0 0];
e=[18 16 14 12 13 13.5];
f=[0.0370 0.0380 0.0400 0.0450 0.0420 0.0410];
pg=zeros(1,6);
costm=zeros(1,30);
for iter=1:100
for i=1:10
for j=1:6
pg(i,j)=(rand-(1/2))*(pgmax(j)pgmin(j))+(1/2)*(pgmax(j)+pgmin(j));
end
end
pg
for i=1:1:20
ng1=round(rand*(ng-1))+1;
for k=1:1:10
p=0;
for j=1:1:6
if j==ng1 break;
end
p=p+pg(k,j);
end
for j=ng1+1:1:ng
p=p+pg(k,j);
end
pg(k,ng1)=pd-p;
if pg(k,ng1)>=pgmax(1,ng1)
pg(k,ng1)=pgmax(1,ng1);
elseif pg(k,ng1)<=pgmin(1,ng1)
pg(k,ng1)=pgmin(1,ng1);
end
end
end
pg
cost=zeros(np,1);
for k=1:1:np
cost(k)=0;
for i=1:ng
cost(k)=cost(k)+c(i)+b(i)*pg(k,i)+a(i)*pg(k,i)^2;
%+abs (e(i)*sin(f(i)*(pgmin(i)-pg(k,i))));
end
end
cost
[C,I]=min(cost)
gbest0=pg(I,:)
costm(iter)=C;

plot(costm)
%set(iter)=gbest0
end
bestcost=min(costm)
RESULT(wave form)

Result(data)
C =
667.7225
I =
5
gbest0 =
129.0272
bestcost =
654.5268

46.2405

17.9709

24.5344

13.6335

17.7934

You might also like