TP CH PHT TRIN KH&CN, TP 10, S 02 - 2007

TI CU TRC LI PHN PHI 3 PHA GIM TN THT IN NNG

BNG CC GII THUT META HEURISTIC
Trng Quang ng Khoa, Phan Th Thanh Bnh, Nguyn Minh Hiu
Trng i hc Bch Khoa, HQG HCM
(Bi nhn ngy26 thng 01 nm 2006)
TM TT: Trong h thng in, mng in phn phi chim 1 t l tn tht ng k.
Nhm gim hao ph in nng ngi ta p dng nhiu phng php nh: ci to li in, t
t b vi dung lng v v tr thch hp v.v bi bo ny cp n mt phng php khc
lm gim tn tht l phng php ti cu trc. Phng php ti cu trc l phng php tm
ra 1 cu trc li ti u ca mng in m c tn tht nh nht. Vic ti cu trc bng phng
php c in s i hi rt nhiu thi gian i vi mng in c nhiu nt, v khng thch hp
cho vic p ng nhanh. V vy, trong bi bo ny s a ra cc gii thut nhn to tm
kim cu trc ti u ca h thng phn phi l gii thut Gen di truyn, gii thut Kin (Ant
colony search), ng thi so snh vi cc gii thut khc nh Heuristic, gii thut luyn kim
(Simulated Annealing). im chnh ca bi bo l dng gii thut Kin kt hp vi kinh
nghim ca ngi vn hnh a ra hm nh gi kh nng ng m ca cc kha trn
mng phn phi (membership of switches) lm cho phng php tm kim cu trc ti u
nhanh hn.
1. TNG QUAN TI CU TRC
Theo thng k ca in lc Vit Nam th tng cng sut tn tht l 10 15% in nng sn
xut ra, trong tn hao trn ng dy t 3 5%. V vy lng in tn tht trn ng dy
phn phi c gi tr ln so vi tng tn tht in nng.
Qua thng k trn ta thy rng vic gim tn tht cho mng phn phi l vic lm rt c
ngha, v ch cn gim i 1% tn tht in nng th cng c gi tr rt ln. Vic gim tn tht
in nng gp phn lm gi thnh in nng h, v dn n h gi thnh cc sn phm khc c
s dng in sn xut ra sn phm v thc y kinh t pht trin, nhu cu phc v dn
sinh ngy cng cao. Tuy nhin khng phi vic gim c ti thiu tn tht in nng khng
phi lc no cng ng ngha vi vic t c kt qu cao trong vic vn hnh kinh t mng
phn phi. N ty thuc vo cc c im ring ca mng phn phi . Nh vy, gim tn
tht in nng trong mng phn phi l 1 phn ca bi ton chung nng cao tnh kinh t trong
vn hnh mng phn phi.
Trong mng phn phi in, ti trn mng phn phi in ngy cng tng nhng s gia tng
ti phi nm trong gii hn cho php, trong khi cu trc ca mng li khng thay i. T
s lm cho tn tht ca mng phn phi in tng ln nu cu trc mng vn gi nguyn. Mun
gim tn tht ngi ta s dng cc phng php nh: t t b ti cc v tr thch hp, ci to li
li in nhng nu lm nh th s i hi phi cn u t rt nhiu m hiu qu gim tn
tht in nng li khng ng k. V vy, khi ti tng trong gii hn cho php ca mng phn
phi, ta c th dng phng php ti cu trc lm gim tn tht trn ng dy. C rt nhiu
phng php ti cu trc trn li phn phi tn tht l nh nht nh: phng php c
in nhng li khng dng trong mng phn phi thc t do khng gian nghim ln s mt
nhiu thi gian cho vic tm kim cu trc ti u. Gn y ngi ta p dng cc phng php
nhn to nh: gii thut Heuristic[1], gii thut m phng Luyn Kim(SA)[2] c p dng
Trang 13
Science & Technology Development, Vol 10, No.02 - 2007

Trang 14
trong cc lun vn trc nhng tin cy tm kim cu trc ti u khng cao. Bi bo ny s
p dng gii thut Gen di truyn (GA) [3], [4] v gii thut Kin (ACS) [5], [6], [7] gii
bi ton ti cu trc cho mng phn phi in
2. GII THIU M HNH C TRNG CA MNG PHN PHI
Mng phn phi c trng l mng vng nhng vn hnh h c ngha l mng vn hnh
phi l mng hnh tia. Vn tip theo l phi ng m cc kha trong mi vng sao cho tn
tht trn mng phn phi c trng l nh nht. lm c iu ny ta cn phi c hm mc
tiu c th tm kim cu trc cho tn tht nh nht.
Hm mc tiu ca bi ton ti cu trc cho mng phn phi 3 pha c trng:
) (k Ploss =

=
n
b
b b
I R
1
2
V cc iu kin rng buc:
in p ln nht ti cc nt i: 0
max

i i
V V
in p nh nht ti cc nt i: 0
min

i i
V V
Dng in ln nht trn cc nhnh bB: 0
max

b b
I I
Tuy nhin nu ch c hm mc tiu khng th s khng tm c cu trc ti u. v vy, ta
s a ra cc gii thut di truyn v gii thut kin c th tm kim cu trc ti u trong thi
gian nhanh nht.
3. GII THUT DI TRUYN (GA)
T tng chnh ca gii thut di truyn l ban u pht sinh ra 1 lc nhiu li gii khc
nhau song song. Sau nhng li gii c to ra, chn nhng li gii tt nht lm c s
pht sinh ra nhng li gii sau vi nguyn tc cng v sau cng tt hn. Qu trnh c tip
din cho n khi tm c li gii ti u trong thi gian cho php. Mc tiu chnh ca gii thut
di truyn khng nhm a ra li gii chnh xc m a ra li gii tng i chnh xc trong thi
gian cho php. Gii thut di truyn tuy da trn tnh ngu nhin nhng ngu nhin c s iu
khin. Gii thut ny thch hp cho vic tm kim cc bi ton c khng gian nghim ln nh:
bi ton tm kim mt m kha c 30 ch s Bn cnh , bi ton ti cu trc mng phn
phi in vi s lng kha v cng ln nn khng gian nghim ca bi ton ny rt ln, bi
ton ny i hi phi tm ra c cu trc ti u trong thi gian nhanh nht. T tng v c
im ca gii thut di truyn, ta nhn xt gii thut ny rt thch hp gii bi ton ti cu
trc.
Cc bc quan trng trong vic p dng gii thut di truyn vo bi ton ti cu trc:
- Bc 1: chn ra 1 s cu trc ngu nhin c th tm c trong mng phn phi in.
- Bc 2: k hiu cc kha ng (sectionalize switches) trong mng phn phi l 0; cc
kha thng m (tie switches) l 1.
- Bc 3: tm h s thch nghi v hm mc tiu cho tng cu trc c to ra ban u.
- Bc 4: chn ra c cu trc tt nht da vo hm mc tiu (trnh by II), tip theo
em cu trc ny thay i 1 s v tr hay cn gi l t bin to ra cu trc mi.
Cc cng thc tnh ton t bin delta k S gen Bnp gen Bnp * * ) ( ) ( ' + =
Trong Bnp: chui nh phn to ra angu nhin
TP CH PHT TRIN KH&CN, TP 10, S 02 - 2007
Bnp: chui nh phn to ra do t bin
S (-1, 1) vi cng xc sut GGAP t bin;K: gi tr ngu nhin (1, PRECI)

=
=
n
j
j
j
a delta
1
2
1
*
j
a : Tng v tr kha ng m c m ha thnh chui nh phn (0 or 1)
- Bc 5: tnh cc h s thch nghi v hm mc tiu cho cc cu trc va mi to ra, v loi
b cc cu trc c hm mc tiu nh hn.
- Bc 6: nu cha ht thi gian cho php th lp li bc 4 tm cu trc mi.
- Bc 7: nu thi gian cho php chm dt th dng chng trnh tm kim v bo co kt
qu tnh c.
4. GII THUT KIN
Ban u, s con kin bt u t t kin i tm ng n ni c thc n. T t kin s c
rt nhiu con ng khc nhau i n ni c thc n, nn 1 con kin s chn ngu nhin mt
con ng i n ni c thc n. Quan st loi kin, ngi ta nhn thy chng tm kim nhau
da vo du chn m chng li trn ng i (hay cn gi l du chn kin li). Sau 1
thi gian lng du chn (pheromone) ca mi chng ng s khc nhau. Do s tch ly du
chn ca mi chng ng cng khc nhau ng thi vi s bay hi ca du chn on
ng kin t i. S khc nhau ny s nh hng n s di chuyn ca nhng con kin sau i
trn mi on ng. Nu du chn li trn ng i nhiu th s c kh nng thu ht cc
con kin khc di chuyn trn ng i , nhng chng ng cn li do khng thu ht c
lng kin di chuyn s c xu hng bay hi du chn sau 1 thi gian qui nh. iu c bit
trong cch hnh x loi kin l lng du chn trn ng i c s tch ly cng ln th cng
ng ngha vi vic on ng l ngn nht t t kin n ni c thc n (xem hnh 1). T
khi Gii thut kin tr thnh 1 l thuyt vng chc trong vic gii cc bi ton tm kim ti u
ton cc c nhiu ng dng thc t cho gii thut ny nh: tm kim cc trang wed cn tm
trn mng, k hoch sp xp thi kha biu cho cc y t trong bnh vin, cch hnh thnh cc
mu khc nhau da vo cc mu tiu chun c sn, tm kim ng i ti u cho nhng ngi
li xe hi ni tm li phng php ny a ra gii quyt cc bi ton c khng gian
nghim ln tm ra li gii c nghim l ti u nht trong khng gian nghim vi thi gian
cho php hay khng tm ra cu trc ti u hn th dng. Phng php ny cng rt thch hp
gii bi ton ti cu trc c th tm ra trong cc cu trc c th ca mng phn phi c 1 cu
trc c cng sut tn tht l nh nht.








Hnh 1.V d gii thut kin (ACS)
Trang 15
Science & Technology Development, Vol 10, No.02 - 2007

Trang 16
Cc bc to ra gii thut kin p dng cho bi ton ti cu:
Bc 1: 1 s cu trc ca mng phn phi s c to ra ban u
Bc 2: mi cu trc tng trng cho on ng i m kin i ny s c tnh ton
hm mc tiu (xem phn II)
Bc 3: mi cu trc ny s c cp nht vo ma trn du chn (ban u cc ma trn du
chn ny s bng nhau) theo cng thc 4.1
) (
) 1 ( ) 1 (
k ploss
Q
k T k T
xy
ij
xy
ij
+ + = + (4.1)
) (k T
xy
ij
: Du chn ca kin trn chng ng xy ca con kin th ix v con kin th jy,
ln lp th i.
Q: gi tr hng s ;: Xc sut bay hi du chn ca nhng con kin i qua li
) 0 (
xy
ij
T : Du chn ban u c to ra cho mi on ng.
Sau khi cc cu trc ban u to ra cp nht vo ma trn du chn, ta s chn ra c
cu trc tt nht trong s cc cu trc ban u, cc cu trc cn li th ta s lm bay hi du
chn ca cc cu trc ny bng cng thc 4.2 :
) 0 ( ) ( ) 1 (
xy
ij
xy
ij
xy
ij
T k T k T + = + (4.2)
Bc 4: da vo ma trn du chn ta s xy dng c danh sch cc cu trc c chn
theo cc cng thc 4.3
max
T
T
xy
ij
n
i
= ; ix; (4.3)

xy
ij
T : Cng du chn ln nht ca hng th iX;
max
T : Cng du chn ln nht ca ma trn du chn.
n
i
: kh nng ng m ca cc kha trong tng vng, gi tr ny [0, 1].
Bc 5: nu thi gian cho php vn cn v cc cu trc chn vn cn th ta quay li bc 2.
Bc 6: nu thi gian cho php chm dt hay cu trc c chn khng cn th ta dng
chng trnh v xut ra kt qu.
4. KT QU KHO ST
Mng phn phi c trng c 3 ngun, 13 im ti v 16 dao cch ly c trnh by hnh 2.

Hnh 2.Mng phn phi c trng 3 PHA

Vng Th t ca cc kha
1 {1, 2, 14, 8, 6, 5}
2 {7, 15, 11, 10}
3 {3, 4, 16, 13, 12}
TP CH PHT TRIN KH&CN, TP 10, S 02 - 2007
Bng 1. Kt qu kho st Gii thut GA:
Chy ln 1 2 3 4
Tn tht(MW) 3.9913 3.8653 3.8653 3.8653
S ln lp 60 60 60 60
Chy chng trnh gii thut di truyn vi MAXGEN = 60, tn tht cc tiu l
3.8653(MW) l nghim ca bi ton ti u.
Bng 2. Kt qu kho st gii thut ACS
Ln 1 2 3
CS tn tht (MW) 3.8653 3.8653 3.8653
S ln lp 40 38 32
Kt qu cng sut tn tht trong 3 ln chy l 3.8653 (MW). Chng trnh gii thut kin
tm kim t hp ti u c da vo ma trn du chn chy tng i n nh.
Do chng chnh ACS ph thuc vo s cu trc to ra ban u c th xc nh c
danh sch cc cu trc c chn. Nn s mt nhiu thi gian chy chng trnh tm hm
mc tiu cho cc cu trc ban u c to ra. Trong khi trong mng phn phi in ngi
vn hnh c th xc nh c cc v tr kha u ngun thng c kh nng ng m rt nh
v khi bnh thng cc kha u ngun m ra s lm cho tn tht trn mng phn phi tng ln
ch tr khi c s c th cc kha ny mi m. T suy lun nh vy, ta t hi ti sao khng to
ra 1 hm nh gi kh nng ng m ca cc kha trong tng vng nh trnh by phn II
c th lm cho thi2 gian tm kim cu trc ti u nhanh hn m khng cn phi to ra s
cu trc ban u. T ta c th xy dng kh nng tham gia ng m ca cc kha hay cn
gi l hm membership of switches da vo kinh nghim ca ngi vn hnh. Dn n c th
xc nh c danh sch cu trc c chn lm cho thi gian tm kim s nhanh hn. Cc hm
membership of switches c th c rt nhiu hnh khc nhau nh hnh tam gic, hnh thang
Kho st kt qu:
Hnh thang Hnh tam gic


Bng 3.Kt qu kho st gii thut ACS ci tin
Ln 1 2
CS tn tht (MW) 3.8653 3.8653
S ln lp 14 2
Trang 17
Science & Technology Development, Vol 10, No.02 - 2007

Trang 18
Trong chng trnh gii thut Kin ci tin tm t hp ti u th kt qu c membership
hnh thanh hi t chm hn so vi membership hnh tam gic nhng c hai u c cng sut tn
tht l 3.8653(MW) xem bng 4.2. Vy chng trnh xy dng membership of switches hnh
thang v hnh tam gic da vo kinh nghim ngi vn hnh chy n nh.
Ni tm li, gii thut ACS v ACS ci tin tt hn gii thut di truyn v khng gian
nghim trong bi ton tm kim t hp ti u ca mng phn phi 3 PHA c trng. ng thi
2 gii thut ny s ln lp v thi gian, tin cy tm kim cc t hp ti u ca mng phn
phi c trng c kh thi. V vy 2 gii thut ny c th ng dng tm kim t hp ti u cho
mng phn phi ln hn.
Mt kt qu khc ca chng trnh ng dng cho 1 pht tuyn ca in Lc TpHCM:
Bng 4. So snh kt qu ca cc gii thut khc nhau
Gii thut ACS ci tin ACS GA Heuristic Luyn kim(SA)
S ln lp (max) 3 6 18 3 52
CS tn tht(MW) 0.0284 0.0284 0.0284 0.0298 0.0284
tin cy tm kim (%) 100 95 90 70 80
5. KT LUN CHUNG
Gii thut Kin (ACS) kt hp vi kinh nghim ngi vn hnh xy dng hm membership
of switches gii quyt bi ton ti cu trc cho mng phn phi in tm kim ra cu trc ti
u trong thi gian nhanh hn v c tin cy tm kim cao hn so vi cc gii thut GA, SA,
HERISTIC. Tuy nhin, do thi gian lm lun vn c gii hn nn gii thut ny cn rt nhiu
hn ch ch c th p dng vo mng in phn phi c s nt v c dao cch ly t 100 tr li.
V vy, cc lun vn sau c th pht trin tip v ci tin gii thut ny cho hon chnh c th
p dung vo mng in thc t vi s lng nt v dao cch ly ln.
RECONFIGURATION OF DISTRIBUTION NETWORKS
BY META-HEURISTICS ALGORITHMS
Truong Quang Dang Khoa, Phan Thi Thanh Binh, Nguyen Minh Hieu
University of Technology, VNU-HCM
ABSTRACT: In Power Systems, distribution networks really spend amount of power loss
. To reduce the power loss there are some solutions such as upgrading networks, setting
capacitors at some places in networks,etc.This paper is concentrated on re-configuring
networks to reduce power loss. This means looking for a optimal configuration to operate the
distribution system. Some Heuristics search methods for optimization problems were proposed
such as Heuristics, Genetics, Simulated Annealing. We proposed Ant Colony Search (ACS) and
Hybrid ACS combining membership functions to achieve both the globe optimization and the
TP CH PHT TRIN KH&CN, TP 10, S 02 - 2007
fastest computing time. Results are examined on a typical distribution network and a feeder of
Hochiminh Power Company.
TI LIU THAM KHO
[1]. T. P Wagner, A.Y. Chikhanni and R. Hackam, Feeder reconfiguration for loss
reduction an application of distribution automation, IEEE transactions on power
Delivery, vol 6, no. 4, October (1994).
[2]. Young Jae Jeon and Jae Chul Kim, Network reconfiguration in radial distribution
systems using simulated annealing and Tabu search, IEEE (2000).
[3]. Bhoomesh Radha, Robert T.F.Ah King and Harry C.S. Rughooputh, A modified
genetic algorithm for optimal electrical distribution network reconfiguration, IEEE
(2003).
[4]. Jen-Hao Teng and Chan Nan Lu, Feeder-switches relocation for customer interruption
cost minimization, IEEE transactions on power delivery, vol. 17, No. 1, January (2002)
[5]. Haibao Zhai, Haozhong Cheng And Xuwang, Using ant colony system algorithm to
solve dynamic transmission network expansion plainning, Singapore, 27-29 November
(2003).
[6]. Enrico Carpaneto and Gianfranco chicco, Ant colony search based minimum losses
reconfiguration of distribution systems, IEEE MELECON 2004, Dubrovnik, croaria,
May 12-15, (2004).
[7]. Jen-Hao Teng and Yi-Hwa Lui, A novel ACS based optimum switch relocation method,
IEEE transactions on power systems, Vol 18, No, 1 February (2003).
























Trang 19