BAB V KESIMPULAN DAN SARAN
5.2 Saran
1. Menggunakan metode optimasi lain untuk mendapatkan hasil yang lebih optimal.
2. Melakukan rekonfigurasi jaringan yang memiliki sumber utama lebih dari 1 seperti pada jaringan loop, spindle dan sebagainya.
68
DAFTAR PUSTAKA
[1] Fayyadl, Muhammad. “Rekonfigurasi Jaringan Distribusi Daya Listrik Dengan Metode Algoritma Genetika”. Universitas Diponegoro, Semarang.
2012.
[2] Stephan, and Adi Soeprijanto. “Rekonfigurasi Jaring Distribusi untuk Meminimalkan Kerugian Daya menggunakan Particle Swarm Optimization”.
Institut Teknologi Sepuluh November,Surabaya.2011.
[3] Yin, Nwe New, Myint Thuzar, and Ei Phyo Thwe. “Analysis of Loss Reconfiguration for Distribution Network System”. Mandalay: Department of Electrical Power Engineering Mandalay Technological University,2017.
[4] Ahuja, Ashish and Anil Pahwa. “Using Ant Colony Optimization for Loss Minimization in Distribution Networks”. IEEE. 2005
[5] S. Civanlar, J. J. Grainger, H. Yin, and S. S. H. Lee, “Distribution Feeder Reconfiguration for Loss Reduction,” IEEE Trans. Power Deliv., 1988, doi:
10.1109/61.193906.
[6] A. Merlin and H. Back, “Search for a minimum-loss operating spanning tree configuration in an urban power distribution,” 1975.
[7] T. Gözel and M. H. Hocaoglu, “An analytical method for the sizing and siting of distributed generators in radial systems,” Electr. Power Syst. Res., 2009, doi: 10.1016/j.epsr.2008.12.007.
[8] M. M. Elnashar, R. El Shatshat, and M. M. A. Salama, “Optimum siting and sizing of a large distributed generator in a mesh connected system,” Electr.
Power Syst. Res., 2010, doi: 10.1016/j.epsr.2009.10.034.
69 [9] Ahmed Korashy, Salah kamel, Abdel Raheem Youseef and Francisco Jurado,
“Most Valuable Player Algorithm for Solving Directional Overcurrent Relays Coordination Problem”. Dept. of Electrical Engineering Faculty of Engineering, Aswan University, Aswan. 2019.
[10] Suswanto, Dawan. ”Sistem Distribusi Tenaga Listrik”. Edisi Pertama.
Jurusan Teknik Elektro Fakultas Teknik Universitas Negeri Padang,2012.
[11] Gonen, Turan. “Electric Power Distribution System Engineering”. Mc-Graw Hill. Sacramento,1986.
[12] H. Saadat, Power System Analysis. New York: Kevin Kane, 1999.
[13] M. M. Aman, G. B. Jasmon, A. H. A. Bakar, K. Naidu, and H. Mokhlis,
“Discrete artificial bee colony algorithm for solving Network Reconfiguration problem,” 2014, doi: 10.1049/cp.2014.1473.
[14] M.Dorigo and L.M.Gambardella. "Ant Colony System: A Cooperative learning approach to the traveling salesman problem”. IEEE Trans Evol.computing Vol-I, April- 1997.
[15] Enrico Carpaneto and Gianfranco Chicco, “Ant colony search based minimum losses reconfiguration of distribution systems”, in IEEE MELECON Conf., Dubrovnik, Croaria, May 2004.
[16] Ji-Pyng Chiou, Chung-Fu Chang, and Ching – Tzong Su, “Variable scaling Hybird Differential Evolution for solving network reconfiguration of distribution systems’, IEEE Trans. Power Systems, Vol. 20, No. 2, May 2005.
70 [17] Juan Carlos Cebrian, Nelson Kagan, “Reconfiguration of distribution network to minimize loss and disruption cost using genetic algorithms”, Elsevier, electric power sistem research 80 (2010) 53-62.
[18] A. González, F. M. Echavarren, L. Rouco, T. Gómez, and J. Cabetas,
“Reconfiguration of large-scale distribution networks for planning studies,”
Int. J. Electr. Power Energy Syst., 2012, doi: 10.1016/j.ijepes.2011.12.009.
[19] D. Shirmohammadi and H. W. Hong, “Reconfiguration of electric distribution networks for resistive line losses reduction,” IEEE Trans. Power Deliv., 1989, doi: 10.1109/61.25637.
71
LAMPIRAN
LAMPIRAN A
1SINGLE LINE DIAGRAM SISTEM IEEE 30 BUS TIDAK TERHUBUNG DISTRIBUTED GENERATION
(DG)
LAMPIRAN A
2SINGLE LINE DIAGRAM SISTEM IEEE 30 BUS TERHUBUNG DISTRIBUTED GENERATION (DG)
LAMPIRAN B
ALIRAN DAYA SISTEM IEEE 30 BUS TIDAK TERHUBUNG DISTRIBUTED GENERATION (DG)
SEBELUM REKONFIGURASI
LAMPIRAN C
ALIRAN DAYA SISTEM IEEE 30 BUS TIDAK TERHUBUNG DISTRIBUTED GENERATION (DG)
SESUDAH REKONFIGURASI
LAMPIRAN D
ALIRAN DAYA SISTEM IEEE 30 BUS TERHUBUNG DISTRIBUTED GENERATION (DG) SEBELUM
REKONFIGURASI
LAMPIRAN E
ALIRAN DAYA SISTEM IEEE 30 BUS TERHUBUNG DISTRIBUTED GENERATION (DG) SESUDAH
REKONFIGURASI
LAMPIRAN F
ALGORITMA ANT COLONY OPTIMIZATION
%% Data Masukan
%Switch and state matrix
% Loop
swl3(c,2)=loop3sw(c,1);
for la = 1:size(swl1,1) if loop1(x(1,1))==swl1(la,1)
for lb = 1:size(swl2,1) if loop2(x(1,2))==swl2(lb,1)
for lc = 1:size(swl3,1) if loop3(x(1,3))==swl3(lc,1)
for ld = 1:size(swl4,1) if loop4(x(1,4))==swl4(ld,1) swl4(ld,2)=0;
else
swl4(ld,2)=1;
end end
%swl5
for le = 1:size(swl5,1) if loop5(x(1,5))==swl5(le,1)
% fbtb dan tbfb setiap branch for a=1:max(branch)
fbtotbbranch(a,1)=branch(a,1);
fbtotbbranch(a,2)=fbbranch(a,1);
fbtotbbranch(a,3)=tbbranch(a,1);
tbtofbbranch(a,1)=branch(a,1);
tbtofbbranch(a,2)=tbbranch(a,1);
tbtofbbranch(a,3)=fbbranch(a,1);
end
%loop1
%fbtbl1 dan tbfbl1 for a=1:length(loop1)
for f=1:length(fbtotbbranch)
if loop1(a,1)==fbtotbbranch(f,1)
fbtbl1opnz(:,2) = nonzeros(fbtbl1op(:,2));
%cek nilai fb apakah fb sudah terenergize for k=1:size(fbtbl1opnz,1)
if fbtbl1opnz(k,2) == 2 continue
end
if ismember(fbtbl1opnz(k,2),fbtbl1opnz(:,3))==0 fbtbl1opnz(k,2) = tbfbl1opnz(k,2);
for f=1:length(fbtotbbranch)
if loop2(b,1)==fbtotbbranch(f,1)
%fbtbl2 yang benar swl2 for b =1:length(loop2)
%cek nilai fb apakah fb sudah terenergize fbtbl2opnzcc = vertcat(fbtbl1opnz,fbtbl2opnz);
if ismember(fbtbl2opnzcc(l,2),fbtbl2opnzcc(:,3))==0 fbtbl2opnzcc(l,2) = tbfbl2opnzcc(l,2);
for f=1:length(fbtotbbranch)
if loop3(c,1)==fbtotbbranch(f,1)
%fbtbl2 yang benar swl2 for c =1:length(loop3)
%cek nilai fb apakah fb sudah terenergize
fbtbl3opnzcc = vertcat(fbtbl2opnzcc,fbtbl3opnz);
tbfbl3opnzcc = vertcat(tbfbl2opnzcc,tbfbl3opnz);
for m=1:size(fbtbl3opnzcc,1) if fbtbl3opnzcc(m,2) == 2 continue
end
if ismember(fbtbl3opnzcc(m,2),fbtbl3opnzcc(:,3))==0 fbtbl3opnzcc(m,2) = tbfbl3opnzcc(m,2);
for f=1:length(fbtotbbranch)
if loop4(d,1)==fbtotbbranch(f,1)
%fbtbl4 yang benar swl4 for d =1:length(loop4)
%cek nilai fb apakah fb sudah terenergize
fbtbl4opnzcc = vertcat(fbtbl3opnzcc,fbtbl4opnz);
tbfbl4opnzcc = vertcat(tbfbl3opnzcc,tbfbl4opnz);
for n=1:size(fbtbl4opnzcc,1) if fbtbl4opnzcc(n,2) == 2
continue end
if ismember(fbtbl4opnzcc(n,2),fbtbl4opnzcc(:,3))==0 fbtbl4opnzcc(n,2) = tbfbl4opnzcc(n,2);
for f=1:length(fbtotbbranch)
if loop5(e,1)==fbtotbbranch(f,1)
%fbtbl5 yang benar swl5 for e =1:length(loop5)
%cek nilai fb apakah fb sudah terenergize
fbtbl5opnzcc = vertcat(fbtbl4opnzcc,fbtbl5opnz);
if ismember(fbtbl5opnzcc(o,2),fbtbl5opnzcc(:,3))==0
fbtbl5opnzcc(o,2) = tbfbl5opnzcc(o,2);
if fbtbfinal(aa,1)==data33(ab,1)
branchdatacal(aa,1)= fbtbfinal(aa,1); for ac=1:1:size(fbtbfinal,1)
if fbtbfinal(aa,3)==data33(ac,3)
zcalrect(aa,1)=branchdatacal(aa,1);
zcalrect(aa,2)=branchdatacal(aa,4)+ branchdatacal(aa,5)*1i;
zcalpol (aa,1)=branchdatacal(aa,1);
zcalpol(aa,2)=r2p(zcalrect(aa,2));
zcalpol(aa,3)=theta(zcalrect(aa,2));%theta end
%kalkulasi Slb
for aa=1:size(branchdatacal,1)
plbcal(aa,1)=branchdatacal(aa,6)- branchdatacal(aa,8);
qlbcal(aa,1)=branchdatacal(aa,7)- branchdatacal(aa,9);
slbcalrect(aa,1)=branchdatacal(aa,3);
slbcalrect(aa,2) = plbcal(aa,1)+ qlbcal(aa,1)*1i;
slbcalpol(aa,1)=branchdatacal(aa,3);
slbcalpol(aa,2) = r2p(slbcalrect(aa,2));
slbcalpol(aa,3) = theta(slbcalrect(aa,2));%theta end
%vcal mula
for aa=1:size(branchdatacal,1)
vcalrect(aa,1)=branchdatacal(aa,1);
vcalrect(aa,2) = v(1,1);
vcalpol(aa,1)=branchdatacal(aa,1);
vcalpol(aa,2)=r2p(vcalrect(aa,2));
vcalpol(aa,3)=theta(vcalrect(aa,2));%theta end
%run data kalkulasi dulu
%arus beban
for aa=1:size(branchdatacal,1)
ilcalpol(aa,1)=branchdatacal(aa,3);
ilcalpol(aa,2)=slbcalpol(aa,2)./vcalpol(aa,2);
ilcalpol(aa,3)=slbcalpol(aa,3)-vcalpol(aa,3); %theta ilcalrect(aa,1)=branchdatacal(aa,3);
ilcalrect(aa,2)=p2r(ilcalpol(aa,2),ilcalpol(aa,3));
ilcalrectconj(aa,1)=branchdatacal(aa,3);
ilcalrectconj(aa,2)=conj(ilcalrect(aa,2));
ilcalrectconjpol(aa,1)=branchdatacal(aa,3);
ilcalrectconjpol(aa,2) = r2p(ilcalrectconj(aa,2));
ilcalrectconjpol(aa,3) = theta(ilcalrectconj(aa,2));
end
%arus branch
%masukkan nilai ibr bus cabang for be=size(ilcalrectconj,1):-1:1
ibrcalrectmat(branchdatacal(be,2),branchdatacal(be,3))=
ilcalrectconj(be,2)+ sum(ibrcalrectmat(branchdatacal(be,3),:));
end
%cek apakah nilai br bus sudah sesuai for bd=1:size(ilcalrectconj,1)
if ibrcalrectmat(branchdatacal(bd,2),branchdatacal(bd,3))==
ilcalrectconj(bd,2)+ sum(ibrcalrectmat(branchdatacal(bd,3),:))
ibrcalrectmatnew(branchdatacal(bd,2),branchdatacal(bd,3))=ibrcalrect mat(branchdatacal(bd,2),branchdatacal(bd,3));
else
ibrcalrectmatnew(branchdatacal(bd,2),branchdatacal(bd,3))=
ilcalrectconj(bd,2)+ sum(ibrcalrectmat(branchdatacal(bd,3),:));
end end
% Error Calculation
for bd=1:size(ilcalrectconj,1)
eribr(branchdatacal(bd,2),branchdatacal(bd,3)) =
abs(ibrcalrectmatnew(branchdatacal(bd,2),branchdatacal(bd,3))-ibrcalrectmat(branchdatacal(bd,2),branchdatacal(bd,3)));
end
eribrmax = max(nonzeros(eribr));
while eribrmax > 0.00001
ibrcalrectmat=ibrcalrectmatnew;
for bd=1:size(ilcalrectconj,1)
if ibrcalrectmat(branchdatacal(bd,2),branchdatacal(bd,3))==
ilcalrectconj(bd,2)+ sum(ibrcalrectmat(branchdatacal(bd,3),:))
ibrcalrectmatnew(branchdatacal(bd,2),branchdatacal(bd,3))=ibrcalrect mat(branchdatacal(bd,2),branchdatacal(bd,3));
else
ibrcalrectmatnew(branchdatacal(bd,2),branchdatacal(bd,3))=
ilcalrectconj(bd,2)+ sum(ibrcalrectmat(branchdatacal(bd,3),:));
end
% Error Calculation
for bd=1:size(ilcalrectconj,1)
eribr(branchdatacal(bd,2),branchdatacal(bd,3)) =
abs(ibrcalrectmatnew(branchdatacal(bd,2),branchdatacal(bd,3))-ibrcalrectmat(branchdatacal(bd,2),branchdatacal(bd,3)));
end
eribrmax = max(nonzeros(eribr));
end
[bestobj,ind] = min([f;bestobj]);
CombinedSol = [P ; bestsol];
bestsol = CombinedSol(ind,:);
objvalval(t)=bestobj;
Fitnessvalue(t)=bestfit;
end
[bestobj,ind] = min([f;bestobj]);
CombinedSol = [P ; bestsol];
bestsol = CombinedSol(ind,:);
openswitch(1)=loop1(bestsol(1));
disp(['Open Switch = ' num2str(openswitch)]);
figure('Name','Objective Value') plot(objvalval,'LineWidth',2) xlabel('Iteration');
ylabel('Value');
grid on;
figure('Name','Fitness Value') plot(Fitnessvalue,'LineWidth',2) xlabel('Iteration');
ylabel('Fitness Value');
grid on;