Important: Use custom search function to get better results from our thousands of pages

Use " " for compulsory search eg:"electronics seminar" , use -" " for filter something eg: "electronics seminar" -"/tag/" (used for exclude results from tag pages)


 
 
Thread Rating:
  • 0 Votes - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Request for codes
Post: #1

Hello,I'm Anahita and I want coding for backward and forward sweep method and for bibc and bcbv method for radial distribution system.Kindly send the program to my email id:1995singhanahita[at]gmail.com
Post: #2

clear all
%branch no sending reciving R(PU) X(pu)
LD=[ 1 1 2 0.04997 0.06644;
2 2 3 0.02332 0.03310 ;
3 1 4 0.04664 0.06201;
4 1 5 0.02082 0.02768;
5 5 6 0.02500 0.03322;
6 1 7 0.02665 0.03543;
7 7 8 0.02748 0.03654;
8 1 9 0.03331 0.04430;
9 1 10 0.02082 0.02768;
10 2 11 0.02082 0.02768];

% bus no activepower reactivepower
BD=[ 1 0 0
2 1.22 0.916
3 0.032 0.024
4 0.778 0.584
5 0.673 0.595
6 1.22 0.916
7 0.0488 0.0366
8 0.956 0.717
9 0.698 0.523
10 1.265 0.949
11 0.265 0.0949];

F=LD(:,2:3);
M=max(LD(:,2:3));
N=max(M);
f=[1:N]';
for i=1:N
g=find(F(:,Smile==i);
h(i)=length(g);
end
k(:,1)=f;
k(:,2)=h';
cent=input('central bus ');
% this section of the code is to adjust line data to the standard
NLD=zeros(N,size(LD,2));
c=find(LD(:,2:3)==cent);
NLD=LD(c,Smile;
LD(c,Smile=[];
t=find(k(:,1)==cent);
k(t,2)=k(t,2)-size(c,1);
j=size(c,1);
i=1;
while sum(k(:,2))>0
c=[];
b=[];
t=[];
[c e]=find(LD(:,2:3)==NLD(i,3));
if size(c,2)~=0
b=LD(c,Smile;
LD(c,Smile=[];
t=find(k(:,1)==NLD(i,3));
k(t,2)=k(t,2)-(size(c,1)+1);
d=find(b(:,3)==NLD(i,3));
b(d,2:3)=[b(d,3),b(d,2)];
NLD(j+1:j+size(c,1),Smile=b;
j=j+size(c,1);
end
i=i+1;
end
LD=NLD;
%LD=sortrows(NLD,3);

% end the data is represented in standard format

%code for bus-injection to branch-current matrix and bcbv
bibc=zeros(size(LD,1),size(LD,1));
for i=1:size(LD,1)

if LD(i,2)==1
bibc(LD(i,3)-1,LD(i,3)-1)=1;
BCBV(LD(i,3)-1,LD(i,3)-1)=complex(LD(i,4),LD(i,5));
else
bibc(:,LD(i,3)-1)=bibc(:,LD(i,2)-1);
bibc(LD(i,3)-1,LD(i,3)-1)=1;
BCBV(LD(i,3)-1,Smile=BCBV(LD(i,2)-1,Smile;
BCBV(LD(i,3)-1,LD(i,3)-1)=complex(LD(i,4),LD(i,5));
end
end
S=complex(BD(:,2),BD(:,3));% complex power
Vo=ones(size(LD,1),1);% initial bus votage% 10 change to specific data value
S(1)=[];
VB=Vo;
iteration=input('number of iteration : ');

for i=1:iteration
%backward sweep
I=conj(S./VB);% injected current
%Z=complex(LD(:,4),LD(:,5));%branch impedance
%ZD=diag(Z);%makeing it diagonal
IB=bibc*I; %branch current

%forward sweep
TRX=BCBV*bibc;
VB=Vo-TRX*I;
end

Vbus=[1;VB];
display(abs(Vbus));
display(abs(IB));
% reference
%1)An Effective Approach for Distribution System Power Flow Solution A. Alsaadi, and B. Gholam
%2)The Standard Backward/Forward Sweep Power Flow Paulo M. De Oliveira-De Jesus,
 


[-]
Quick Reply
Message
Type your reply to this message here.

Image Verification
Image Verification
(case insensitive)
Please enter the text within the image on the left in to the text box below. This process is used to prevent automated posts.

Possibly Related Threads...
Thread: Author Replies: Views: Last Post
  ns2 codes for grayhole attack Guest 1 192 27-04-2017 02:44 PM
Last Post: jaseela123
  mini project request Guest 1 301 25-04-2017 04:33 PM
Last Post: jaseela123
  matlab codes for touchless fingerprint recognition Guest 1 139 10-04-2017 10:17 AM
Last Post: jaseela123
  macrocell and femtocell interference using matlab codes Guest 3 201 06-03-2017 11:40 AM
Last Post: jaseela123
  Request for project tittle Guest 1 0 02-03-2017 10:04 AM
Last Post: jaseela123
  matlab codes for touchless fingerprint recognition Guest 0 181 17-02-2017 09:25 PM
Last Post: Guest
  mini project request Guest 0 253 17-02-2017 09:25 PM
Last Post: Guest
  mini project request Guest 0 252 17-02-2017 09:25 PM
Last Post: Guest
  hackchina matlab codes Guest 0 241 17-02-2017 09:25 PM
Last Post: Guest
  matlab codes for opportunistic routing Guest 0 257 17-02-2017 09:25 PM
Last Post: Guest
This Page May Contain What is Request for codes And Latest Information/News About Request for codes,If Not ...Use Search to get more info about Request for codes Or Ask Here

Options: