You are on page 1of 21

Bi tp ln tr tu nhn to

Mc lc
1. Tng quan v gii thut di truyn v cc ng dng.......................................3
1.1. Gii thut di truyn................................................................................3
1.2. S thc hin gii thut di truyn.......................................................3
1.3. Gii thut di truyn so vi cc phng php truyn thng ....................4
1.4. Cc ng dng ca gii thut di truyn....................................................5
1.4.1. Ti u ho v my hc:...................................................................5
1.4.2. Ghi nh y hc vi gii thut di truyn.............................................6
1.4.3. Mt s ng dng khc.....................................................................6
2. Thc hin gii thut di truyn.......................................................................6
2.1. Biu din cc c th................................................................................6
2.1.1. Biu din nh phn .........................................................................7
2.1.2. Biu din s dng hon v...............................................................7
2.1.3. Biu din bng gi tr......................................................................7
2.1.4. Biu din theo cy...........................................................................7
2.2. Hm mc tiu (Fitness)..........................................................................8
2.3. Ton t ti to (Reproduction)...............................................................8
2.3.1. Chn lc dng bnh xe Roulette.....................................................8
2.3.2. Chn lc Stochastic universal sampling........................................10
2.3.3. Chn lc ln cn a phng........................................................10
2.3.4. Chn lc loi b............................................................................10
2.4. Ton t lai ghp (Crossover)................................................................10
2.4.1. Ton t lai ghp trong biu din nh phn.....................................10
2.4.2. Ton t lai ghp trong biu din bng hon v..............................11
2.4.3. Ton t lai ghp trong biu din bng gi tr.................................11
2.4.4. Ton t lai ghp trong biu din theo cy.....................................11
2.5. Ton t t bin (Mutation).................................................................11
2.6. Cc thng s c bn ca gii thut.......................................................12
3. C s ton hc ca gii thut di truyn.......................................................13
Gii thut di truyn

Bi tp ln tr tu nhn to

3.1. Mt s khi nim..................................................................................13


3.2. Hiu qu ca s ti to.........................................................................14
3.3. Hiu qu ca s lai ghp......................................................................15
3.4. Hiu qu ca s t bin......................................................................16
4. Nng cao hiu qu gii thut di truyn........................................................17
4.1. La chn cc lc ..........................................................................17
4.2. Dng cc ton t cao cp.....................................................................18
4.2.1.Ton t vi m.................................................................................18
4.2.2. Ton t v m................................................................................19
4.3. Gii thut di truyn lai..........................................................................19
Ti liu tham kho..........................................................................................21

Gii thut di truyn

Bi tp ln tr tu nhn to

1. Tng quan v gii thut di truyn v cc ng dng.


Hin nay v trong tng lai, tr tu nhn to (Artificial Intelligent) , ang v
s c nghin cu, pht trin rt mnh m v c ng dng rng ri. y l mt
mng chuyn mn rt ln trong khoa hc my tnh, bao gm nhiu lnh vc khc
nhau. Mt trong nhng lnh vc l k thut tnh ton thng minh
(Computational Intelligent) trong c gii thut di truyn (Geneic Algorithms GA) em li nhng phng php mi gii cc bi ton m nu p dng
phng php truyn thng s gp nhiu kh khn.

1.1. Gii thut di truyn


Gii thut di truyn - ch cn nghe tn cng c th hiu c rng n da trn
vic quan st qu trnh tin ha trong t nhin. Cc nguyn l c bn ca gii thut
di truyn c tc gi J.H.Holland cng b ln u tin vo nm 1962. Sau , cc
nn tng ton hc ca gii thut ln u tin c cng b vo nm 1975 trong
cun sch Adaptation in Natural and Artificial System cng ca tc gi
J.H.Holland. C th ni Holland l ngi i tin phong nghin cu trong lnh vc
gii thut di truyn cng vi nhng tc gi Goldbeg, Beglay
Gii thut di truyn l mt gii thut da trn c ch ca chn lc tin ho
trong t nhin: Trong mi th h, mt tp mi cc sinh vt c to ra bng cch
lai ghp nhng nhn t thch nghi nht vi mi trng ca nhng sinh vt trong th
h c cng vi s xut hin t bin ngu nhin ca cc c th trong th h mi.
Vn dng c ch , gii thut di truyn c bt u vi mt qun th ngu nhin
c n chui , ri sao chp cc chui theo khuynh hng n ci tt, ghp cp v i
cc chui con thnh phn, thnh thong lm t bin gi tr bit c s o tt.

1.2. S thc hin gii thut di truyn


Sau y l s thc hin gii thut di truyn:
1. Khi to mt qun th ban u (cc p n ban u ca bi ton).
2. Xc nh gi tr hm mc tiu (fitness) cho mi c th trong qun
th.
3. To ra qun th mi bng cch lai ghp cho (crossover) t cc c
th hin ti c chn lc (selection), ng thi to ra cc t bin
(mutation) trong qun th mi theo mt xc xut nht nh.
4. Cc c th trong qun th mi sinh ra c thay th cho cc c th
trong qun th c.

Gii thut di truyn

Bi tp ln tr tu nhn to

5. Nu iu kin dng tha th gii thut dng li v tr v c th tt


nht cng vi gi tr hm mc tiu ca n, nu khng th quay li
bc 2.
y l s chung nht p dng cho rt nhiu lp bi ton s dng gii thut
di truyn. Mt s khi nim c th rt mi m i vi ngi bt u tm hiu v gii
thut di truyn. N s dn c sng t trong cc phn sau ca bn bo co ny.
Phn tip theo sau y s phn tch cch hot ng ca gii thut, so snh v gii
thch ti sao n tt hn so vi cc phng php truyn thng.

1.3. Gii thut di truyn so vi cc phng php truyn thng


Chng ta xt bi ton n gin sau y: ti u ho hm y = f(x) trn khong
xc nh D.
Khi dng phng php truyn thng c mt s cch gii sau y:

Phng php lit k: Duyt tt c cc im nm trong vng kho st D tm


ra im cc tr ca n. Phng php ny khng thch hp khi d liu u qu
ln ln. Trong trng hp ny min D c lc lng ln hn m c.

Phng php gii tch: Tm im cc tr bng cch gii tp cc phng trnh


khi cho Gradient bng 0. xt c Gradient phi tnh o hm ca hm s.
iu ny khng gii quyt c trong trng hp hm s khng lin tc hoc
khng c o hm. Ngoi ra i vi hm nhiu cc tr th c th phng php
ny b mt cc tr, cc tr tm c ch mang tnh cht a phng.

Phng php tm kim ngu nhin: l phng php kt hp gia phng


php tnh ton gii tch v s lit k . Tuy nhin nhng vic lm ngu nhin
cng vi gii thut tm kim ngu nhin cng phi b suy yu bi thiu tnh hiu
qu .

i vi gii thut di truyn, cc thng s ca bi ton tm kim phi c


m ho thnh mt chui hu hn cc k t trn mt tp hu hn cc k t. Chui
ny tng t nh cc chui gen ca cc c th sinh vt. C rt nhiu cch m
ha tp thng s. Mt cch n gin l chng ta c th m ho thnh cc chui bit
trn tp k t {0,1}. Mi mt chui i din cho mt im tm kim trong khng
gian. GA xut pht vi mt qun th cc chui c khi to mt cch ngu nhin
sau s sn sinh cc qun th tip theo thng qua vic s dng la chn ngu
nhin nh mt cng c. Nh gii thut di truyn tm kim trn nhiu im song
song c kh nng leo ln nhiu cc tr cng mt lc. Thng qua cc ton t ca
mnh, gii thut trao i thng tin gia cc cc tr vi nhau, t lm gim thiu
Gii thut di truyn

Bi tp ln tr tu nhn to

kh nng gii thut kt thc ti cc cc tr a phng v b qua mt cc tr ton


cc
y l cc c trng ca gii thut di truyn so vi cc phng php truyn
thng:

Cc gii thut di truyn lm vic vi s m ho ca tp thng s ch


khng lm vic vi cc gi tr ca cc thng s.

Cc gii thut di truyn tm kim t mt qun th cc im ch khng phi


t mt im.

Cc gii thut di truyn ch s dng thng tin v cc tiu chun ti u ca


hm mc tiu ch khng dng cc thng tin h tr no khc.

Cc gii thut di truyn s dng cc lut chuyn i mang tnh xc sut


ch khng phi l cc lut chuyn i mang tnh xc nh.

Cc gii thut di truyn thng d ci t, p dng. Tuy nhin khng phi


lc no cng cho li gii chnh xc. Mt s gii thut di truyn c th cung
cp li gii tim nng cho mt bi ton xc nh ngi s dng la
chn.

1.4. Cc ng dng ca gii thut di truyn.


Ban u gii thut di truyn ra i c p dng cho ti u ho v hc my l
ch yu. n nay n pht trin mnh v c nhiu ng dng thc t, c bit l
cc bi ton v tr tu nhn to. V d: ta c th ti u cng vic d bo thi tit sao
cho chnh xc nht da trn cc thng s kh tng do c. Nm 1967 Beglay xy
dng my chi c Hexapawn da trn thut gii di truyn v nhn ra rng thut gii
Di truyn c th thc hin tt m khng ph thuc phc tp ca tr chi.
1.4.1. Ti u ho v my hc:
Trong lnh vc ti u ha c nhiu bi ton c p dng gii thut di truyn
v thnh cng nh ti u ho hm mt bin, ti u ha hm nhiu bin, hay nh
bi ton ngi du lch, bi ton hp en, cc bi ton kinh doanh, nhn dng iu
khin h thng... . Sau y s gii thiu mt s bi ton ti u ha:
David E.Golderg ng dng GA ti u ha bi ton iu khin h thng
ng ng dn kh thin nhin. Trong bi ton ny, mc tiu l cc tiu ha nng
lng do qu trnh nn, ph thuc vo p sut ti a v p sut ti thiu v cc rng
buc t l p sut.
Ti u ho kt cu: Mc tiu ca bi ton ny l cc tiu ha trng lng ca
kt cu, ph thuc vo cc rng buc v ng sut ln nht v ng sut nh nht ca
Gii thut di truyn

Bi tp ln tr tu nhn to

mi thanh. Mt b m cho khung kt cu theo ma trn tiu chun c dng


phn tch mi thit k to ra bi gii thut di truyn.
Trong lnh vc my hc, gii thut di truyn c s dng cho vic tm hiu
cc quy lut c cu trc nh cu trc IF-THEN trong mi trng nhn to.
1.4.2. Ghi nh y hc vi gii thut di truyn
Gii thut di truyn n gin c s dng thc hin ghi hnh nh, nh
l b phn ca h thng ln c tn l Digital Subtraction Angiography (DSA).
Trong DSA, bc s s c gng xem xt bn trong ca mt ng mch kh nghi bng
cch so snh hnh nh x-quang, mt c chp trc khi tim thuc nhum mu
vo ng mch, mt v mt c chp sau khi tim thuc. C hai hnh c s ha
v c tr nhau theo tng im mt, vi kt qu mong mun cui cng nhn c
mt hnh nh sai khc phc ha r rng hnh nh bn trong ng mch ch. Tuy
nhin s chuyn ng nh ca bnh nhn c th to ra hai hnh nh k nhau, lm ri
lon phn hnh nh sai khc. Kt qu l, cc hnh nh phi c xp k nhau,
tnh ton phn hnh nh sai khc.
Gii thut di truyn c dng tm kim cc h s bin i tm kim cc
h s gip cc tiu ha s sai bit hnh nh trc v sau khi tim, trn c s cc sai
khc hnh nh tuyt i.
1.4.3. Mt s ng dng khc

Thit k mng nron, kin trc ln trng s.


Qy o cho ngi my.
Cc h phi tuyn ng - phng on, phn tch d liu.
Tm dng ca cc phn t protein.
Ci tin chng trnh LISP (lp trnh gen).

2. Thc hin gii thut di truyn


Trong phn ny chng ta s i tm hiu cch hot ng ca gii thut di truyn
theo tng bc a ra trn. u tin l tm hiu mt s khi nim, sau s i
tm hiu cc cch biu din c th v cc ton t di truyn.

2.1. Biu din cc c th


Cng vic u tin khi thc hin vic gii bi ton bng gii thut di truyn
l chn cch biu din cc c th. l vic nh x cc tham s ca bi ton ln
mt chui c chiu di xc nh. Tu theo tng bi ton c th m c nhng cch

Gii thut di truyn

Bi tp ln tr tu nhn to

biu din khc nhau sao cho ph hp, thun li khi gii ton. Trong c hai cch
biu din thng dng nht l biu din nh phn v biu din s dng cc hon v.
2.1.1. Biu din nh phn
Mi c th tng ng vi mt chui bao gm cc bit 0 v 1, ngha ca cc
bit ny ph thuc vo tng tnh hung c th. y l cch biu din n gii nht
v l cch thng dng nht trong cc cch biu din.
V d trong bi ton ci ti: c n vt vi trng lng v gi tr c cho
trc v mt ci ti c trng lng bit. Hy chn ra cc vt cho vo ti
sao cho tng gi tr cc vt trong ti l ln nht?
y, vt c nh s t 1 n n, mi c th c biu din bng mt
xu nh phn di n. Trong , bit th i bng 1 c ngha l vt th i c cho
vo ti, bng 0 th b li.
2.1.2. Biu din s dng hon v
Mi c th tng ng vi mt hon v ca tp n k hiu no . Chng hn
cch biu din ny c p dng cho bi ton ngi du lch :
Mt thng gia phi i qua nhiu thnh ph (n). Hy vch l trnh i qua tt
c cc thnh ph sao cho qung ng i l ngn nht. Bit rng mi thnh ph
ch i qua mt ln.
K hiu cc thnh ph l T1, T2, ..., Tn mi c th - s m ho ca li gii - s
l mt danh sch hon v ca T1, T2, ..., Tn biu din l trnh m ngi thng gia
i qua. Th d T8T5T9T3..... s l k hiu ca hnh trnh t T8 T5 T9 T3...
Nh vy mi chui con s biu din cho mt nh ca khng gian tm kim
v qua th hin c cch tr li c th c ca bi ton. Sau ny mi chui
nhim sc th s c gii m li tr v cc thng s ban u ca bi ton.
2.1.3. Biu din bng gi tr
Biu din gi tr trc tip c th c dng trong cc bi ton c cha nhng
gi tr phc tp, chng hn nh s thc. Nu dng biu din nh phn cho loi bi
ton ny th rt phc tp. Trong m ha gi tr, mi nhim sc th l mt chui cha
nhng gi tr no . Nhng gi tr ny c th c dng bt k lin quan n bi ton,
t s nguyn, s thc, k t cho n cc i tng phc tp hn.
Mt v d cho cch m ha ny l bi ton tm trng s mng nron.
2.1.4. Biu din theo cy
M ha theo cy c dng ch yu cho cc chng trnh (hoc biu thc)
tin ha, cho lp trnh gen. Trong m ha theo cy mi nhim sc th l mt cy
Gii thut di truyn

Bi tp ln tr tu nhn to

cha cc i tng chng hn nh hm hoc lnh trong mt ngn ng lp trnh no


.
V d: bi ton tm hm t nhng gi tr cho trc. Cho trc mt s u vo
v u ra. Tm hm cho ra kt qu tt nht vi mi u vo.
M ha: Nhim sc th l cc hm c biu din bng cy.

Sau khi biu din c cc c th cho bi ton ri th c th bt tay ngay


vo vic thc hin gii thut di truyn theo s c trong phn trc. Bc u
tin l cn c mt qun th ban u. N c th c c bng cch chn ngu nhin
cc c th; hoc c th dng chin thut la chn thng qua hm mc tiu s c
trnh by ngay sau y.

2.2. Hm mc tiu (Fitness)


Mt hm mc tiu (fitness) s ly mt chui nhim sc th nh l u vo v
tr v gi tr tng trng cho chui nhim sc th nh gi trn vn cn
gii quyt.
Hm mc tiu c vai tr tng t nh l mi trng sng trong s tin ha
ca t nhin. Vn tng tc gia mt c th vi mi trng sng c th hin
qua gi tr cu hm mc tiu trong mi mt c th.
Gi tr hm mc tiu l Maximum hay Minimum ty theo bi ton s quyt
nh xc sut ca mi chui c th tham gia vo cc ton t di truyn.

2.3. Ton t ti to (Reproduction)


L mt qu trnh m trong cc chui c la chn ty thuc vo gi tr
hm mc tiu. Hm mc tiu f(i) c gn cho mi c th trong mt qun th, v
nhng c th no c gi tr hm mc tiu cao s i din cho nhng c th tt, thch
nghi v s c xc sut chn lc ln. Ton t ny c th c xem nh l qu trnh
chn lc trong t nhin: cc c th tt, thch nghi vi mi trng s c c hi c
sng st nhiu hn.
C nhiu cch thc hin ton t ny.
2.3.1. Chn lc dng bnh xe Roulette
y c coi l phng php chn lc n gin nht, y mi chui (c th)
trong qun th chim mt khe trong vng trn Roulette c rng t l vi gi tr
hm mc tiu ca chui. Mi ln quay vng trn Roulette chng ta nhn c mt
chui v coi nh l cch la chn chui cho vic ti to.
Gii thut di truyn

Bi tp ln tr tu nhn to

Cc bc thc hin:

Tnh tng cc gi tr mc tiu ca cc c th trong mt dn s v gn kt


qu ny vo bin Total fitness.

th h th n, ly mt s ngu nhin gia 0 v Total fitness.

Tr v s c th u tin ca mt dn s mi , da vo gi tr mc tiu ca
n .

V d: Gi s ta c mt dn s ban u vi 6 chui nhim sc th , tng gi tr


ca hm mc tiu l 50 nh th hin trong bng 1
STT
1
2
3
4
5
6

Chui
01110
11000
00100
10010
01100
00010

Hm mc tiu
10
12
5
8
9
6

T l %
20
24
10
16
18
12

Total
8
22
27
35
44
50

Bng 1
Bnh xe trng s c th hin trong hnh nh sau :
12%

20%

18%
24%
16%
10%

Hnh 1
Sau ta s to cc s ngu nhin trong khong t (0, 50) tng ng vi vic
quay vng trn bnh xe , i vi mi s, k thut chn la trn vng trn bnh xe
s c p dng chn mt chui nhim sc th u tin vi gi tr hm mc tiu
ln hn hay bng s ngu nhin . By s ngu nhin c to ra cng vi cc chui
c chn c th hin trong bng 2 :
S ngu nhin
Chui NST

26
3

16
2

46
6

30
4

5
1

18
2

Bng 2

Gii thut di truyn

Bi tp ln tr tu nhn to

V d ny chng t rng cc chui no c gi tr mc tiu cao th s c nhiu


con chu hn trong th h sau .
2.3.2. Chn lc Stochastic universal sampling
Thc hin ging nh phng php bnh xe Roulette, nhng cch chn cc gi
tr ngu nhin nh sau: gi s cn chn ra N c th, khi khong cch gia cc lt
ct l 1/N. Chng ta chn 1 s ngu nhin trong on [0, 1/N] ri t xc nh cc
lt ct.
2.3.3. Chn lc ln cn a phng
Ln cn a phng l mt vng khp kn m c th tng tc vi cc c th
khc nm trong vng .
Theo phng php ny, mt na s c th u tin c chn bi mt phng
php bt k no khc, chng hn nh phng php bnh xe Roulette. Sau vi
mi c th chn, xc nh mt ln cn a phng ca n v tm c th lai
ghp vi n.
2.3.4. Chn lc loi b
Cc lm rt n gin: dng mt ngng la chn xc nh cc c th c
la chn. Theo cc c th c gi tr hm mc tiu h hn ngng th s b loi
b, cn cc c th c gi tr hm mc tiu ln hn ngng th c la chn.

2.4. Ton t lai ghp (Crossover)


Qu trnh ti to tm kim trc tip cc c th tt nht tn ti nhng khng
to ra bt k mt c th mi no . Trong t nhin, mt i con phi c cha, m v
tha k gen ca c hai. Ton t chnh hot ng trn gen ca cha, m l ton t lai
ghp, ni tng cp chui nhim sc th c chn la lai ghp vi xc sut l
Pc. C nhiu cch thc hin ton t tp lai tu theo cch biu din c th v tng
trng hp c th.
2.4.1. Ton t lai ghp trong biu din nh phn
Lai ghp mt im
y l cch lai ghp n gin nht.
u tin, 1 v tr ghp cho c la chn
ngu nhin (crossover site) trn hai chui
c chn ra trong qu trnh ti to, sau
cc chui ny c tin hnh ghp cho
ti v tr ny . Qu trnh ny s to ra hai
chui mi , mi mt chui mi s c
Gii thut di truyn

10

Bi tp ln tr tu nhn to

ly t phn bn phi ca chui ny ghp vi phn bn tri chui kia tnh t v tr


ghp cho v tng t cho chui cn li.
Hnh 2
Lai ghp nhiu im
Phng php thc hin th ging nh lai ghp mt im nhng s c nhiu
im c chn trong chui c th lai ghp.
2.4.2. Ton t lai ghp trong biu din bng hon v
Mt im lai ghp c chn, phn u ca chui con c to thnh bng
cch ly phn u ca chui cha m th nht (t v tr u n v tr chn lai ghp).
Phn cn li ca chui con c to thnh bng cch duyt t u chui cha m th
hai v a vo chui con nhng gi tr cha c.
(1 2 3 4 5 6 7 8 9) + (1 8 6 2 5 3 7 9 4) = (1 2 3 4 5 6 8 7 9)
Mt s phng php lai ghp nhiu im c hiu qu hn m trong phm vi
ca bn bo co nh ny khng th ni ht c. Xin tham kho trong [1]
2.4.3. Ton t lai ghp trong biu din bng gi tr
S dng cch lai ghp trong biu din nh phn.
2.4.4. Ton t lai ghp trong biu din theo cy.
Lai ging theo cy - trong c hai b m im lai ging c chn, cc b m
c chia theo im y v hon i phn di im lai ging to ra con chu
mi

Hnh 3
Qu trnh ti to v lai ghp lm tng thm sc mnh cho gii thut di truyn
bi vic trc tip tm kim nhng thng tin tt hn s dng nhng thng tin tn ti
bit .

2.5. Ton t t bin (Mutation)


Mc d ti to v ghp cho sn sinh ra nhiu chui mi nhng n khng gii
thiu bt k mt thng tin mi no trong qun th cp bit. Vi mt chui cc
bit mi, ta p dng t bin vi mt xc sut thp Pm, n c tc dng chuyn 1 bit t
0 thnh 1 hay ngc li vi bit ny c chn la mt cch ngu nhin.

Gii thut di truyn

11

Bi tp ln tr tu nhn to

Biu din nh phn: Chn mt s bit ri o gi tr cc bit .


Biu din bng hon v: Chn hai v tr bt k ri han i gi tr ca chng
cho nhau: (1 2 3 4 5 6 7 8 9) => (1 2 8 4 5 6 7 3 9)
Biu din bng gi tr: Chn mt vi gi tr ri thm hoc bt (cng hay
tr) mt gi tr nh:
(3.49; 7.63; 3.55; 7.24; 4.83) => (3.49; 7.63; 3.61; 7.18; 4.83)
Biu din theo cy: Chn mt vi nt trong cy ri thay i gi tr ca nt
.
Ba ton hng ti to, ghp cho, t bin c p dng lp i lp li to ra
nhng chui nhim sc th mi, cho n khi vt qu kch thc qun th chn ban
u th dng li. n y coi nh mt th h mi tng ng vi mt qu trnh sinh
sn (generation) c to dng xong bao gm mt qun th ca cc chui nhim
sc th. Qu trnh s tip tc cho n khi c th tt nht c to ra hay iu kin
dng ca bi ton c tho mn.

2.6. Cc thng s c bn ca gii thut


Qua cc phn trn chng ta d dng nhn ra trong gii thut di truyn cn xc
nh cc thng s sau :
n : kch thc ca qun th hay s lng c th trong qun th. Vic la
chn kch thc qun th l quan trng, phi c tnh cn nhc. Nu chn
kch thc nh th khng th pht huy c hiu qu ca gii thut,
nhng nu chn kch thc ln th chng trnh s chy chm li. Kch
thc qun th tt nn trong khong t 20-30, tuy nhin i khi kch
thc 50-100 vn c xem l tt.
Pc : xc sut lai ghp cho bit vic lai ghp c thc hin thng xuyn
nh th no. Khng phi lc no vic lai ghp gia hai c th b m cng
cho c th con tt hn. Do vic chn xc sut lai ghp p c cao cng
cha hn phi l tt. Khong 80%- 95% l thch hp (mt s bi ton t
sut lai ging thch hp l 60%).
Pm : xc sut t bin cho bit cc phn ca nhim sc th thay i
thng xuyn nh th no.. Nh trn ni xc sut ny cn rt nh, nu
qu ln th gii thut di truyn s khng khc g mt gii thut tm kim
ngu nhin. T sut tt nht thng trn on 0.5% - 1%.

Gii thut di truyn

12

Bi tp ln tr tu nhn to

3. C s ton hc ca gii thut di truyn


Phn ny chng ta quan tm n c s ton hc ca thut ton. tm hiu c
s ton hc ca thut ton di truyn chng ta hy quan st cc chui c la chn
qua cc th h di truyn. Chng ta nh li rng t tng ca thut ton di truyn l
xem xt, nh gi cc xu th no l tt cho mc tiu, s dng n tip cho th h
sau ni theo ngn ng di truyn l gi li cc gen tri, v loi b xu khng tt, ni
theo ngn ng di truyn l o thi nhng th h khng tt. gii quyt vn
trn, chng ta hy lm quen vi mt s khi nim sau.

3.1. Mt s khi nim


Khng lm mt tnh tng qut , chng ta xt mt chui c to t b k t
nh phn V ={0,1}. Theo quy c, chng ta k hiu chui bng k t in hoa, cc k
t ring bit bng ch thng c nh ch s v tr. V d, chui A gm 7 bit :
A =0111000, c biu din di dng sau :
A = a1 a2 a3 a4 a5 a6 a7
y, ai ch c tnh nh phn n (cn gi l gen ai), mi c tnh c th
nhn gi tr 1 hoc 0 (i khi chng ta cn gi gi tr ai l gen tng ng). Trong
chui c th, a1 = 0, a2 =1, a3 =1, a4 =1, a5 = 0
Cng c th c cc chui m c tnh khng c sp th t nh chui A, th
d: A = a2 a6 a4 a3 a7 a1 a5.
Ti mi th h t chng ta c qun th A(t) v cc chui c nh s th t l
Aj, j=1,2,...,n. Chng ta a thm k t *, hay cn gi l k t khng quan trng.
N c th i din cho bt k k t no.
Ta gi xu c cha k t '*' l mt Lc (Schem), k hiu l H. Nh vy
mt lc H s l i din cho mt tp cc xu. V d: Lc H= 10**1 gm
cc chui sau :
10111

10101

10011

10001

Lc ny chng ta c tp k t m rng l V+ ={0,1,*}. Chng ta d nhn


thy ngay l vi tp k t m rng ny chng ta c 3l lc c trong chui
c di l l, v c n.2l lc c trong qun th n chui nh phn di l.
Nhng tnh ton ny cho chng ta mt cm nhn no v ln ca thng
tin c x l bi gii thut di truyn. Tuy nhin, hiu r tm quan trng
ca nhng khi gch xy i vi nhng gii php trong tng lai, chng ta cn
phn bit s khc nhau gia cc loi lc .

Gii thut di truyn

13

Bi tp ln tr tu nhn to

Tt c cc lc khng c to nn mt cch ng u, c mt s lc
c bit hn nhng ci khc . V d,lc 011*1* * l mt th hin xc nh
hn v s tng ng quan trng so vilc 0* * * * * * . Hn na, mt lc
no c th tri rng vi chiu di chui nhiu hn cc lc khc. V d, lc
1* * * *1* s tri mt phn ca chui rng hn lc 1*1* * * *.
nh gi nhng tng ny, chng ta cn gii thiu v hai c trng ca
lc : bc (other) ca lc v di nh ngha (defining length) ca lc
.
Bc ca lc H , k hiu l O(H), l s cc v tr xc nh (trong b k t
nh phn, chnh l tng s cc bit 1 v 0 c trong mu.
V d: bc ca lc 011*1* * l 4 (k hiu O(011*1**) = 4) cn bc ca
lc 0* * * * * * l 1.
di ca lc H, k hiu l (H), l khong cch gia v tr c nh u
tin v v tr c nh cui cng.
V d:
(1 * * 1 * 0 * * 0 * * *) = 9 -1=8
(0 * * * * * * * *) =1-1=0
Lc v nhng c trng ca n l nhng cng c k hiu thch hp
tho lun v phn loi chnh xc cc s tng ng ca chui .Hn th na chng
cung cp cc phng tin c s phn tch hiu qu rng ca vic sinh sn v cc
thao tc di truyn trn cc khi gch xy c cha bn trong dn s .Chng ta hy
xem xt hiu qu ring v hiu qu phi hp ca vic ti to, ghp cho v t bin,
trn lc c cha trong qun th ca cc chui.

3.2. Hiu qu ca s ti to
Chng ta nh gi hiu qu ca s ti to (Reproduction) thng qua s lc
c chn trong tp hp cc lc trc . Gi s rng bc chn lc th t,
ta nhn c m xu ca lc H trong tp hp A(t). K hiu: m=m(H, t).
Gi Pj l xc sut chn xu Aj trong tp A(t) , Pj =fj /S fj (fj : gi tr ca hm f
ng vi xu j).
Sau ln ti to th t ta nhn c tp xu A (t+1) c s chui ca lc H l
m(H,t+1)
m(H, t+1) = m(H, t)*n*f(H) / f.
Trong n l s xu trong tp A(t). (n=| A(t)|)
Gii thut di truyn

14

Bi tp ln tr tu nhn to

f(H): Gi tr trung bnh ca lc H.


gi f : Gi tr trung bnh trong ton tp hp A(t)
f =
fj /n

t suy ra:
m( H, t + 1) = m( H, t )

f (H)
f

V cn xc sut nn mt cch gn ng theo cng thc trn ta c: lc no


c gi tr hm mc tiu ln hn gi tr trung bnh th c kh nng c mt cao hn
trong tp hp ln chn lc tip theo. Hay ni cch khc, mt lc tn ti (v
c sinh ra trong ln k tip) ra hay mt i ph thuc vo gi tr ca n so vi gi
tr trung bnh ca ton tp, v c thc hin bi th tc Reproduction. V vy ta c
th kt lun lc c gi tr ln hn gi tr trung bnh th s c chn lc cho ln
tip theo, nu c gi tr thp hn gi tr trung bnh s b loi b.
Gi s nhng lc cn li (c chn lc) c gi tr tri so vi gi tr trung
bnh l c* f vi c = const (tt nhin 0<c<1)
Suy ra

m( H, t + 1) = m( H, t )

( f + cf )
= (1 + c).m( H, t )
f

V vy m(H,t) = m(H,0)*(1+c)t.. Tc l s ln xut hin ca lc c tnh tt


trong cc th h Di Truyn v sau tng trng theo hm m.
Sau y ta s xem xt nh hng ca Crossover v Mutation n s chn lc
ca thut ton di truyn.

3.3. Hiu qu ca s lai ghp


Trc ht ta xem xt lc nh th no s b tc ng bi lai ghp
(Crossover). Gi thit lc c di (Length Schem) L=7. Ta xt 2 lc i
din ca chui A=0111000 l:
H1= *1****0 v H2= ***10**.
Gi s hai lc H1 v H2 c chn. Chng ta bit rng ton t tp lai c
tin hnh vi vic la chn v tr tp lai l ngu nhin trn ton di ca chui.
Gi s chui A c chn cho vic tp lai v v tr tp lai c chn ngu nhin l
v tr th 3. Hiu ng ca ton t tp lai nh hng ti hai lc nh sau :
Thc hin hon v cho kt qu :
H1= *1* 10**

Gii thut di truyn

15

Bi tp ln tr tu nhn to

H2 = *** ***0
Kh nng lc H1 b loi b (dng ca lc ny khng c tp hp Di
Truyn k tip) l ln, v v tr hon v c nhiu kh nng ri vo v tr cc k t (*)
lin tip (on "v tr c nh ph"): (1 v 5). kho st nhn xt ny ta ch rng
(H1) =5. Kh nng chn v tr hon v trong L-1 = 7-1 = 6 v tr c th. Nn xc
sut lc 1 b loi b l: Pd (Probability Detroy) = (H1)*(L-1) = 5/6.
Xc xut tn ti l Ps (Probability Stay) = 1 - Pd = 1/6.
Tng qut:
Mt lc tn ti nu im hon v nm ngoi on "v tr c nh". Kh
nng tn ti l:

ps 1 pc .

( H )
l 1

V iu gi s nn cng thc trn l ng khi xc xut chn H1 v H2 l 1. Nu


kh nng chn ngu nhin 1 cp hon v cho 1 lc l P c (Probability Choice) th
kh nng tn ti ca lc l:
Ps >= 1 - Pc * (H) / ( L - 1).
Gi nh l ton t ti to v tp lai hot ng mt cch c lp vi nhau,
chng ta c th tnh c s mu ca mt lc bt k H cho th h tip theo l :
m( H, t + 1) m( H, t ).

f (H)
( H )
1 pc .

f
l 1

Nh vy kh nng tn ti ca mt lc ph thuc :
- Lc c gi tr cao hn hay thp hn gi tr trung bnh ca tp hp.
- V tr hon v nm trong hay ngoi on "v tr c nh ph".
T y ta d hiu rng nhng lc no c gi tr hm mc tiu trn trung
bnh v c gi tr d(H) nh th t l tn ti vn tng theo hm m.

3.4. Hiu qu ca s t bin


Cng vic cui cng l thc hin Mutation. Do c k t (*) nn thc cht
Mutation l s thay i ngu nhin ca v tr n l c nh vi xc xut Pm
(Probability Mutation). Kh nng tn ti ca cc v tr ny l: 1 - Pm. Vi s v tr
ny l O(H) nn xc xut tn ti ca lc l: (1 - Pm)O(H).
Vi Pm < 1 th:
(1 - Pm)O(H) =1- O(H)*Pm
Qua c 3 cng vic ca chn lc ta nhn c s lc l:
Gii thut di truyn

16

Bi tp ln tr tu nhn to

m( H, t + 1) m( H, t ).

f (H)
( H )

p
o( H ).p m
c

f
l 1

Nhng lc bc thp, c di ngn v c gi tr trung bnh ln hn gi tr


trung bnh ca ton qun th, s c s mu tng theo hm s m trong th h tip
theo. Kt lun quan trng ny c bit ti nh nh l lc hay nh l nn tng
ca gii thut di truyn (Fundamental Theorem of Genetic Algorithms).

4. Nng cao hiu qu gii thut di truyn


Qua cc phn trn nhng khi nim c bn ca khi nim c cp, tuy
nhin thc thi c hiu qu hn, ngi ta c mt s ci tin da trn gii thut
di truyn chun ny. Trc tin ci tin da trn chn lc cc lc v sau l
mt s ci tin trn ton t di truyn.

4.1. La chn cc lc
Vic chn lc cc lc c s dng trong GAs chun l la chn trn
vng trn roulette. Nhng lc ny l nhng thnh vin tt nht nhng c th
tht bi trong cc ln sinh k tip v c th dn n nhng li ngu nhin. ci
thin iu ny, mt vi phng php ci tin c lin kt cng vi vic chn la
trn bnh xe roulette c tin hnh.

Chn lc u t (elitist): Chin thut ny nhm sao chp li thnh vin tt


nht trong mt th h v a n vo trong th h k tip .Chin thut ny
c th gia tng tc ti u ca mt qun th bi nhng c th tt v do
khng nhng ci thin c vic tm kim cc b m cn lm cho gii
thut di truyn c thc hin hon chnh hn .

Chn lc khi ly mu (Deterministic Sampling): Trong mt lc , xc


sut chn lc thng c tnh nh sau : pselecti = fi / fj. Sau s con
ci ei trong mt chui Ai c tnh bi ei = n * ps. Mi chui s cp pht
mt s con ci ty thuc vo gi tr ei. Nhng chui cn li cn phi in
cho y mt qun th th s c ly ra theo th t t u qun th
c sp xp trc .

Ly mu cn li ngu nhin c thay th (Remainder Stochatic Sampling


With Replacement): Sau khi tnh s con ci ei trong mt s c
chn lc ly mu trong giai on trn, th phn nguyn ca ei s gn cho
nhng c th c trong qun th ,cn phn l ca ei s c s dng
tnh trng s trong vic chn la trn vng trn bnh xe sinh ra cc c
th cn li.

Ly mu cn li ngu nhin v khng thay th (Remainder Stochatic


Sampling Without Replacement): Cng tng t nh trn nhng phn l

Gii thut di truyn

17

Bi tp ln tr tu nhn to

ca gi tr ei by gi c xem nh l xc sut. Hay ni cch khc, s ln


tham gia vo trong qu trnh sinh sn ca mt chui bng vi gi tr phn
nguyn ca ei. Sau , m bo kch thc qun th, ta chn nhng
con ci khc ca nhng chui vi xc sut tng ng vi phn l ca s
c th mong i cho n khi t c kch thc dn s n. V d chui Ai
c s ei = 1,5 s ng gp 1 con vo th h tip theo v mt con khc vi
xc sut l 0,5.

Th tc phn hng (Ranking Procedure): Theo phung php ny, mt


qun th c sp xp ty thuc vo gi tr fitness. Sau ta gn cc c
th ny cho mi mt con chu m c hm gn ging vi Rank. Hm Rank
do BanKer ra (1985) (hnh 4)

Trong max l gi tr do ngi dng


a vo, 1 max 2 v n l kch thc qun
th. Min ei sau s l [2 - max, max]. Phng
trnh trn l mt trng hp c bit.

Hnh 4

4.2. Dng cc ton t cao cp


Gii thut di truyn l s kt hp ca ba ton t: ti to, lai ghp v t bin.
Chng tc ng cp trn ton b qun th. C hai loi ton t c a vo d
ci thin hot ng v tnh hiu qu ca gii thut di truyn n gin: l ton t
vi m (micro operator) tc ng ti gen ca tng c th v ton t v m tc ng
n ton qun th.
4.2.1.Ton t vi m
Lai ghp nhiu im:
Ton t lai ghp m ta s dng t trc n gi l lai ghp ch trn 1 bit n
ti 1 v tr c. Qu trnh lai ghp ny c th tin ha thnh lai ghp nhiu im
m trong s im lai ghp s c cho trc Nc. Khi Nc = 1 th tr thnh lai
ghp n, vi Nc chn chui c xem nh l mt chui khng c s bt u v kt
thc, v s im lai ghp Nc c chn xung quanh mt vng trn ng nht mt
cch ngu nhin. Qu trnh lai ghp nhiu im c th gii quyt 1 t hp c th cc
t tnh c m ha trn mt chui nhim sc th m s lai ghp mt im
khng gii quyt c.
Cc ton t ti lp li bc:
Khng ging nh ton t t trc ch tm kim trn tp allele tt, cc ton t
ny cn tm kim trn nhng cch m ha cng nh tp cc gi tr allele tt hn.
Gii thut di truyn

18

Bi tp ln tr tu nhn to

Nhng ton t ny thch hp cho bi ton m gi tr fitness ph thuc vo s sp


xp chui, chn hn nh tr fitness ph thuc vo t hp ca cc gi tr allele v v
bc o, f = f(v,o), mt chui kt hp cc gi tr allele v cc thnh tin c th biu
din nh sau :
12345678
10010001
Trong 1,2 8 biu din v tr gen hay tn gen. Thng thng cc ton t
ti lp li bc l ton t o chiu. Vi ton t ny, ngi ta chn hai im trn
chiu di chui, sau ta tin hnh ct li im ny, v nhng im cui ca phn
ct s hon ch cho nhau. V d, hai chui c 8 bit s hon i nh sau :
12|3456|78
01|1110|10
Sau khi hon i ta c :
12654378
01011110
4.2.2. Ton t v m
Trong t nhin c mt s chuyn bit ho: s hnh thnh phn bit cc loi.
Nm 1987, Goldberg v Richardson gii thiu hm chia s cho ra s m phng s
hnh thnh cc loi trong gii thut di truyn. Mt hm chia s xc nh tnh gn gi
v chia s cho mi chui trong qun th.
i vi mt c th, chia s c xc nh bng tng cc gi tr hm chia s
vi cc chui khc trong qun th. Chui cng gn c th th gi tr hm chia s
cng cao, nhng c th xa th gi tr hm chia s nh. Do vy, thch nghi ca c
th c tnh theo nh cng thc sau:
f s ( xi ) =

f ( xi )
n

s(d ( x , x ))
j =1

Cng thc trn cho thy, khi c nhiu c th gn nhau, chng lm gim
thch nghi ca nhau. Ton t v m c s dng khc phc hn ch ny.

4.3. Gii thut di truyn lai


Gii thut lai di truyn n gin, mc d mnh m, nhng ni chung khng
phi lc no gii thut cng t ti u ho. Lai ghp ho mt gii thut di truyn vi
gii thut hin c c th sinh ra mt gii thut tt hn c gii thut di truyn v gii
Gii thut di truyn

19

Bi tp ln tr tu nhn to

thut hin ti. V vy, i vi cc bi ton ti u ho, khi c nhiu gii thut ti u
ho mt cch c hiu qu, th c th s dng n cho vn ti u. Mt gii thut di
truyn c th ghp vi nhiu k thut tm kim khc nhau, ta ra mt dng lai
ghp m khai thc c vic tm kim ton cc v c tm kim cc b.
C rt nhiu k thut o hm v khng o hm c sn cho vic tm kim
ti u ha cc b trong cc hm tnh ton quen thuc. Mc d khng c nhng hm
tnh ton quen thuc, vn lun lun c nhng s tm kim ti u cho bi ton
c bit. Trong mt s trng hp, s k tha lai ghp a ra vic biu din tt
cng nh k thut tt trong vic s dng.

Gii thut di truyn

20

Bi tp ln tr tu nhn to

Ti liu tham kho


[1]
David E.Goldberg. Genetic Algorimths in search Optimization and
Machine learning.
[2]
Springer Verlag. Introduction to Genetic Algorithms- Data
structures + Genetic Algorithms = Evolution Program.
[3]
Eggermont and J.I. van Hemert. Stepwise Adaptation of Weights
for Symbolic Regression with Genetic Programming.
[4]
Salvatore Mangano. Genetic Algorimth. DATSI, Universidad
Politcnica de Madrid.
[5]
Brian M. Kelley. Genetic Programming and a Genetic Algorithm for
Approximate Optimal Timetable Design. Theory of Computing, June 11, 2001.

Gii thut di truyn

21

You might also like