K NIM NGY THNH LP TRNG (01/04/1956 - 01/04/2011)

GII THIU THUT TON CHUI DI TRUYN TRONG NGHIN CU NG DNG GII CC M HNH TI U GENETIC ALGORITHM FOR OPTIMIZATION OBJECTIVES IN OPERATIONAL RESEARCH
TSKH. NGUYN THANH THY Trung tm o to Logistics, Trng HHH Tm tt Thut ton chui di truyn l mt k thut ca khoa hc my tnh nhm tm kim gii php thch hp cho cc bi ton ti u t hp, l mt trong cc thut ton c s dng rng ri nht trong kinh t, sinh hc, nng nghip, giao thng vn ti v logistics. Thut ton ny vn dng cc nguyn l ca tin ha nh chn lc, sinh sn, lai ging v t bin nhm tm ra b phng n t tim cn ti u n ti u gip nh qun l sn xut c nhiu la chn hn trong ra quyt nh. Abstract Genetic algorithm is a technical computer science for combinatorial optimization problems. This algorithm is widely used in economics, biology, agriculture industrial, transportation and logistics. This algorithm applies the principles of evolution such as genetic selection, reproduction, crossover and mutations, in order to find a set of approximately optimal solutions and optimal solutions in order to help managers to have more choices in decision making. 1. t vn Ngy nay trong nghin cu khoa hc, thut ton c s dng rng ri tm ra li gii cho cc mc tiu khc nhau. Cc mc tiu ny c ton hc ha thnh cc hm mc tiu ton hc hay ni cch khc l cc m hnh ton ti u. Trong hng triu cc nghin cu ng dng ca hu ht cc ngnh t y hc, nng nghip, sinh hc, khoa hc c bn, qun s, hi dng hc, kinh t hay giao thng vn ti, cc m hnh ti u lun c s dng rng ri. Tuy nhin, trong cc nghin cu khoa hc c bn cc nh khoa hc c khuynh hng s dng cc thut ton ti u tm ra cc li gii ti u cho m hnh, th trong cc nghin cu ng dng cc nh khoa hc li c khuynh hng s dng cc thut ton ti u tm ra mt b cc phng n t tim cn ti u n ti u cho m hnh. Khuynh hng ny bt ngun t cc thc t sau: (1) Cc phng n ti u thng a ra rt t la chn cho ngi s dng. Ngay c khi la chn c a ra, ngi s dng khng th p dng do cc hn ch trn thc t. Trong khi cc phng n tim cn ti u c th a ra hng nghn/trm nghn la chn cho cng mt vn m khng c s chnh lch ng k trn thc t. V d, nu phng n thi gian ti u ca mt k hoch sn xut l 130 pht v phi tun th duy nht mt cch b tr, th c hng nghn cch b tr khc cho phng n ny vi khong thi gian t 128-130 pht. Trong ton hc, 2 pht l c mt s khc bit ln, nhng trn thc t, phn ln cc nh qun l sn sng la chn phng n 128 pht m vic b tr sn xut thun tin hn cho c s mnh. (2) Rt nhiu bi ton ti u cho kt qu v nghim nu c tnh tm kim phng n ti u, m trn thc t sn xut khng bao gi chp nhn tnh hung v nghim. Trong khi phng n tim cn ti u lun lun tn ti la chn trong bt k tnh hung no. Chnh v cc l do trn, cc thut ton gip tm ra b phng n t tim cn ti u n ti u c s dng rt rng ri trong nghin cu ng dng hin nay v d nh thut ton K thut m phng (Simulated Annealing Algorithm), thut ton Tm kim Tabu (Tabu Search Algorithm), hay thut ton Chui di truyn (Genetic Algorithm). C th tham kho cc thut ton ny hu ht cc nghin cu trong hn 2.500 Tp ch trn cng thng tin khoa hc Sciencedirect (http://www.sciencedirect.com/), hoc hng ngn Tp ch khc trn Springer (http://www.springer.com), hoc trn cc cng thng tin khoa hc khc. Mi thut ton ny li c hng ngn cch ng dng khc nhau ty thuc vo tng vn nghin cu c th v tnh sng to ca ngi nghin cu ng dng. i km vi cc thut ton ny chnh l chng trnh my tnh (computer program) c lp bi ngi nghin cu, thng bng cc ngn ng nh C, C++, Tp ch Khoa hc Cng ngh Hng hi S 26 3/2011 77

K NIM NGY THNH LP TRNG (01/04/1956 - 01/04/2011) hoc Lingo/Lindo vi u vo l cc s liu thc t, u ra l cc phng n tt c th la chn. Bng cch la chn cc vng lp chng trnh khc nhau, ngi nghin cu c th a ra cc phng n gii tim cn ti u khc nhau cho cng mt m hnh. Trong cc thut ton ny, thut ton chui di truyn (Genetic Algorithm) l mt trong cc thut ton c s dng rng ri nht trong kinh t, sinh hc, nng nghip, giao thng vn ti v logistics. 2. Gii thiu v thut ton chui di truyn Thut ton chui di truyn (hay cn c dch l gii thut di truyn) l mt k thut ca khoa hc my tnh nhm tm kim gii php thch hp cho cc bi ton ti u t hp (combinatorial optimization). Thut ton ny vn dng cc nguyn l ca tin ha nh chn lc, sinh sn, lai ging v t bin nhm tm ra b phng n t tim cn ti u n ti u gip nh qun l sn xut c nhiu la chn hn trong ra quyt nh. Thut ton chui di truyn thng c ng dng nhm s dng ngn ng my tnh m phng qu trnh tin ho ca mt tp hp nhng i din tru tng (gi l nhng nhim sc th) ca cc gii php c th (gi l nhng c th) cho bi ton ti u. Tp hp ny s tin trin theo hng chn lc nhng gii php tt hn. Thng thng, nhng gii php c th hin di dng nh phn vi nhng chui 0 v 1, nhng li mang nhiu thng tin m ha khc nhau. Qu trnh tin ha xy ra t mt tp hp nhng c th hon ton ngu nhin tt c cc th h. Trong tng th h, tnh thch nghi ca tp hp ny c c lng, nhiu c th c chn lc nh hng t tp hp hin thi (da vo th trng), c sa i (bng t bin hoc t hp li) hnh thnh mt tp hp mi. Tp hp ny s tip tc c chn lc lp i lp li trong cc th h k tip ca thut ton. Thut ton chui di truyn c s dng nhm: (1) Ti u ha hoc nng cao hiu qu ca mt h thng ang khai thc Thut ton chui di truyn c th c s dng la chn cc rng buc nhm ti u ha hiu qu ca mt h thng. Thng thng h thng ny l mt h thng thc t nh h thng phn phi gas, h thng bn hng c ng, iu chuyn v tr thit b vn vn. (2) Th nghim hoc ng dng cc m hnh nh lng y l kha cnh ng dng t c nhc ti trong thut ton chui di truyn. Nghin cu khoa hc v mt vn nht nh c coi nh mt qu trnh tc ng qua li. M hnh din gii hoc m t c thit lp cng vi vic thu thp s liu nhm th nghim m hnh. Khi tm ra cc kt qu tri ngc, m hnh s c sa i v qu trnh ny c lp li cho ti khi gii quyt xong vn . (3) Gii cc bi ton cc i ha (maximization) hoc cc tiu ha (minimization) Lu rng thut ton chui di truyn cn c bin i khi gii cc bi ton c hm mc tiu tri ngc. 3. Cc bc ca thut ton chui di truyn Thut ton chui di truyn l thut ton c ni dung v cng rng, vi hng ngn cch ng dng khc nhau ty thuc vo tng vn c th. Trong bi vit ny, tc gi ch gii thiu khi qut cc bc c bn khi p dng thut ton chui di truyn gii bi ton ti u. 3.1 . Chn lc i din (Representation) Cc bin s s c chn sn vo mt s a ch nht nh chn thit lp cc nhim sc th (chromosome), kt hp vi th t ca nhim sc th . Chiu di ca chui k t th hin s nghim cn x l, km theo mt s b phn kt ni bng s khng. V d trong bi ton iu tu [5] vo cu tu, Nishimura v cc tc gi khc (2008) xy dng chui gm s tu vo cng, s cu tu v th t vo cu gi nh (Hnh 1). 3.2 . Xc nh ch s bin i (Fitness) Ch s bin i phn nh kh nng tt hn ca mt c th so vi cc c th khc trong tp c la chn ti bc 3.1. Nu hm mc tiu l hm min th ch s bin i cng ln cng tt. Thng thng, la chn ch s bin i thng qua cng thc: f(x)= 1/(1+exp(y(x)/a)) trong y(x) l hm mc tiu, a l mt thng s bt k biu din s bc lp ca thut ton. Tp ch Khoa hc Cng ngh Hng hi S 26 3/2011 78

K NIM NGY THNH LP TRNG (01/04/1956 - 01/04/2011) 3.3 . Cc ton t ca thut ton chui di truyn (Genetic algorithm operators)

Point 1 A Parents B 6 5 9 17 3 2 54 61 53 49 0 98 17 2 9 5 3 6 0 49 54 53 61 97

Point 2 98 105 101 97 105 101

C' Children D'

17 6

2 5

9 9

17 5

3 3

2 6

54 0

61 49

53 54

49 53

0 61

98 97

98 105

101 97

105 101

C D

17 6

2 5

9 9

5 17

3 3

6 2

54 0

61 49

53 54

49 53

0 61

97 98

98 105

101 97

105 101

(1) La chn sinh sn (Reproduction) La chn sinh sn l qu trnh trong mi chui c la chn thy thuc vo ch s bin i ca chui . Chui no c ch s bin i tt hn s c sao chp nhiu hn cho th h sau. C nhiu cch la chn kt hp chui khc nhau, trong 2 cch ph bin nht l La chn kiu bnh xe Roulette (Roulette selection) v la chn kiu Cuc u vng trn (Tournament selection) [4] (xem T.T.Thy v cc tc gi khc (2008) bit thm chi tit ). (2) Trn chui (Crossover) Sau khi la chn chuisao chp chui nhim sc th to thnh mt qun th mi, trn chui c thc hin to ra cc chui mi tt hn. C nhiu cch trn chui, trong 2 cch thng dng nht l Trn chui mt n (Mask- Crossover) v Trn chui 2 im (two points crossover). Hnh 2 v 3 biu din cch trn chui 2 im khi b tr tu vo cu tu v khi b tr cn trc xp d container trn bi. (3) Bin i chui (Mutation) Bin i chui l qu trnh to ra cc thay i ngu nhin bng cch xc nh thng s t l bin i (mutation rate). Nu cc chui no t c t l ny th mi p dng bin i chui thu v chui mi tt hn. Khi bin i chui, cc gi tr nm trong chui c i v tr ln nhau to ra

Tp ch Khoa hc Cng ngh Hng hi

S 26 3/2011

79

K NIM NGY THNH LP TRNG (01/04/1956 - 01/04/2011) s thay i v th t, t to ra mt chui mi nhiu u th hn. Hay ni cch khc mt phng n mi nhiu u th hn. Sau mt s cc vng lp nht nh, gi tr phng n thu c cng ngy cng gn vi gi tr phng n ti u. Hnh 4 biu din ton b qu trnh p dng thut ton chui di truyn. 4. Cc bc thc hin chng trnh trn my tnh Chng trnh trn my tnh thng c thit lp bi ngn ng C, C++ hay Lingo/Lindo cho h thng my ch Unix, hoc APS, nhng cng c th chy c trn cc my tnh thng thng c tc nhanh nu cc case study khng c b s liu ln. Cc bc thc hin chng trnh trn my tnh bao gm: (1) Xc nh s liu u vo; (2) Thit lp cc tp gi nh (case study); (3) Chy chng trnh; (4) c thng s u ra v a ra kt lun. 5. Kt lun Thut ton chui di truyn l mt thut ton c ng dng mnh v rng ri trn th gii nhng vn cn kh xa l vi cc nghin cu ng dng Vit Nam. Nm c thut ton ny c th gii quyt c rt nhiu ng dng thc t v a ra cc kt qu tim cn ti u vi thi gian ngn. V vy, thut ton ny cn c tm hiu v a vo cc nghin cu nhiu hn na. TI LIU THAM KHO [1] A. Blanco, M.Delgado, M.C. Pegalaja A genetic Algorithm to obtain oprimal recurrent neural network, International Journal of Approximated Reasoning, Vol. 23, pp. 67-83. 2000 [2] Lance Chambers, The Practical Handbook of Genetic Algorithm, Printed by Chapman & Hall/CRC, 2000 [3] Nguyen Thanh Thuy, Etsuko Nishimura, Akio Imai, A Heuristic Approach for the Containership Stowage Problem in Multiple Port-of-call Route, The Journal of Japan Institute of Navigation, Vol. 120, pp. 164 -172, ISSN: 0388-7405, 2009 [4] Nguyen Thanh Thuy, Akio Imai, Etsuko Nishimura, Stratos Papadimitriou, Multi-objective model of containership loading plan considering the effectiveness of crane employed, 10th International Conference on Applications of Advanced Technologies in Transportation E Proceedings, Greece. 2008 [5] Nishimura, E., Imai, A., Papadimitriou, S., Berth allocation planning in the public berth system by genetic algorithms, European Journal of Operation Research 131, pp. 282-292, 2001 Ngi phn bin: ThS. Bi Thanh Tng

Tp ch Khoa hc Cng ngh Hng hi

S 26 3/2011

80