Chuyn san Cng ngh thng tin v Truyn thng - S 02 (4-2013)

GII THUT DI TRUYN V NG DNG TRONG

H TR LP LCH IU HNH CNG TC
BNH VIN
Phan Vit Anh
1
, Bi Thu Lm
1
Tm tt
Bi bo nghin cu xut xy dng m hnh bi ton h tr ra quyt nh: h tr lp lch
cng tc ti Bnh vin. i vi bi ton ny, nhiu cn b cn c phn cng trc, mi ngi
c th thc hin nhiu nhim v khc nhau; mi thi im ch thc hin duy nht mt nhim v.
Trong khi , thi gian trc ca cc cn b phi tng ng nhau.
gii quyt, u tin chng ti m hnh ha ton hc bi ton vi 2 tp rng buc: cng v mm.
Da trn m hnh ton hc, chng ti thit k gii thut di truyn tm cc li gii cho bi ton.
Sau chng ti tin hnh chy th nghim nhiu ln trn b d liu thc kim tra phng n
tt nht. Kt qu thu c kim nghim so snh vi kt qu ca thut ton leo i.
In this paper, we propose a model for a decision support problem: staff scheduling at the hospital.
For this problem, a wide range of schedules will be applied for different kind of staff; each person
may perform many various tasks but a single task at a certain point of time. Meanwhile, working
time for staff is set equally.
Regarding the possible solution, we first try to derive a mathematical formulation of the problem
with 2 sets of constraints: hard and soft. Based on the formulation, we design a genetic algorithm for
finding solutions for this problem. To validate the proposal, we run multiple tests on a real dataset.
The testing results are compared with findings of hill-climbing algorithm.
1. Gii thiu
Gii thut di truyn (GA) l mt trong nhng m hnh tnh ton ph bin v thnh cng
nht trong lnh vc tnh ton thng minh. Cng vi cc k thut tnh ton thng minh khc
nh tnh ton m (fuzzy computing), mng N-ron (neural networks), h a tc t (multi-
agent systems), tr tu by n (swarm intelligence), gii thut di truyn ngy cng pht trin,
c p dng rng ri trong cc lnh vc ca cuc sng. C th ni, GA bc u c
p dng thnh cng trong cc trng hp, m vic m t ton hc cho bi ton gp rt nhiu
kh khn. V d: cc h thng phc hp (complex systems) vi cc hm mc tiu n v cc
mi rng buc phc tp, cc bi ton thit k vi cc hm mc tiu qu phc tp khng
tuyn tnh, hay cc bi ton lp k hoch/lp lch vi khng gian tm kim NP-kh (NP-hard).
Ngi c c th xem thm thng tin chi tit ti [7].
(1) Hc vin K thut Qun s
92
Tp ch Khoa hc v K thut - Hc vin KTQS s 153 (4-2013)
Trong lnh vc lp lch, gii thut di truyn thu ht c rt nhiu cc nghin cu v
xut. L do cho xu hng ny c th thy l bi ton lp lch nhn chung thuc lp cc
bi ton NP-kh v v vy, rt cn cc gii thut xp x [1]. Tnh n nay c rt nhiu cc
xut s dng gii thut di truyn cho bi ton lp lch [2], [3], [4], [5], [6], [8], [9]. Tuy
nhin, mt iu cn phi ch r y l bi ton lp lch l mt trong nhng bi ton m c
nhiu th loi a dng, mi mt th loi cn c thit k gii thut di truyn c bit. V c
bn, bi ton lp lch c coi nh l vic gn cc mc thi gian (time slots) thc hin cho
cc cng vic (tasks) sao cho ph hp vi kh nng v ti nguyn (resources). Tuy nhin, s
a dng th hin cc th loi rng buc khc nhau v mi mt bi ton thc t s c nhng
rng buc c trng ring. Chnh v vy, m cc nghin cu xut gii thut di truyn cho
bi ton lp lch lun lun l mt ch nng.
Trong khun kh bi bo ny, cc tc gi tm hiu bi ton lp lch cng tc ti Bnh
vin Mt Trung ng, c th l lch trc chuyn mn v phng khm. Mc tiu chnh ca
bi ton l xp lch trc cho cc cn b vo cc b phn sao cho thi gian trc ca cc cn
b tng ng nhau v iu ny nh hng trc tip n quyn li cn b (nhim v v
tin trc).
ng gp chnh ca bi bo ny bao gm: Phn tch v xy dng m hnh bi ton lp
lch cng tc bnh vin, sau thit k mt gii thut di truyn cho bi ton ny. Chng ti
s dng biu din s nguyn, cc ton t lai ghp, t bin v la chn. Thc hin php
tin ha qua nhiu th h chn ra phng n ph hp nht. Kt qu thu c trn b d
liu th nghim cho cho thy cc lch tm c u tha mn cc rng buc ca bi ton v
t kt qu tt v cc gi tr hm mc tiu. Kt qu ny cng c kim chng thng qua
so snh vi gii thut leo i.
Phn cn li ca bi bo c t chc nh sau: phn 2 - tng quan v gii thut di truyn,
phn 3 bi ton lp lch cng tc ti Bnh vin Mt Trung ng v m hnh ton hc.
Phn 4 - Thit k gii thut di truyn. Phn 5 - K hoch chy th. Phn cui kt lun.
2. Tng quan v gii thut di truyn
Gii thut di truyn (hay gii thut tin ha ni chung) l mt trong nhng pht trin quan
trng ca nhng nh nghin cu v tnh ton ng dng cui th k trc trong vic gii xp
x cc bi ton ti u ton cc. Vic khai thc nguyn l tin ha nh l mt nh hng
heuristics gip cho gii thut di truyn gii quyt hiu qu cc bi ton ti u (vi cc
li gii chp nhn c) m khng cn s dng cc iu kin truyn thng (lin tc hay kh
vi) nh l iu kin tin quyt.
Mt trong nhng c tnh quan trng ca gii thut di truyn l lm vic theo qun th cc
gii php. Vic tm kim by gi c thc hin song song song trn nhiu im (multipoints).
93
Chuyn san Cng ngh thng tin v Truyn thng - S 02 (4-2013)
Tuy nhin, y khng phi l l thut ton tm kim a im n thun v cc im c tng
tc vi nhau theo nguyn l tin ha t nhin. Trong ng cnh s dng gii thut di truyn,
ngi ta c th dng khi nim c th tng ng vi khi nim gii php. Cc bc
c bn ca gii thut di truyn c m t nh sau:
Bc 1: t=0; Khi to P(t) = {x
1
,x
2
,. . . ,x
N
}, vi N l tng s lng c th.
Bc 2: Tnh gi tr cc hm mc tiu cho P(t).
Bc 3: To b lai ghp MP = se{P(t)} vi se l ton t la chn.
Bc 4: Xc nh P(t) = cr{MP}, vi cr l ton t lai ghp.
Bc 5: Xc nh P(t) = mu{P(t)}, vi mu l ton t t bin.
Bc 6: Tnh gi tr cc hm mc tiu cho P(t)
Bc 7: Xc nh P(t+1) = P(t) v t t = t+1
Bc 8: Quay li Bc 3, nu iu kin dng cha tha mn.
- Biu din gii php: y l mt trong nhng cng vic quan trng trong thit k gii thut
di truyn, quyt nh vic p dng cc ton t tin ha. Mt trong nhng biu din truyn
thng ca GA l biu din nh phn. Vi php biu din ny, gii php cho mt bi ton
c biu din nh l mt vector bit, cn gi l nhim sc th. Mi nhim sc th bao gm
nhiu gen, trong mt gen i din cho mt tham s thnh phn ca gii php. Mt kiu
biu din khc cng thng dng l biu din s thc. Vi php biu din ny, cc ton t
tin ha s thc hin trc tip trn cc gi tr s thc (genes).
- La chn: Vic la chn cc c th c thc hin khi cn mt s c th thc hin sinh
sn ra th h sau. Mi c th c mt gi tr thch nghi (fitness). Gi tr ny c dng
quyt nh xem la chn c th no. Mt s phng php la chn thng dng bao gm:
+ Roulette wheel: Da trn xc sut (t l thun vi gi tr hm thch nghi) la chn c
th.
+ Giao u (nh phn): Ch nh ngu nhin 2 c th, sau chn c th tt hn trong hai
c th .
- Lai ghp: Ton t lai ghp c p dng nhm sinh ra cc c th con mi t cc c th
cha m, tha hng cc c tnh tt t cha m. Trong ng cnh tm kim th ton t lai ghp
thc hin tm kim xung quanh khu vc ca cc gii php biu din bi cc c th cha m.
94
Tp ch Khoa hc v K thut - Hc vin KTQS s 153 (4-2013)
- t bin: Tng t nh lai ghp, t bin cng l ton t m phng hin tng t bin
trong sinh hc. Kt qu ca t bin thng sinh ra cc c th mi khc bit so vi c th
cha m. Trong ng cnh tm kim, ton t t bin nhm a qu trnh tm kim ra khi khu
vc cc b a phng.
3. Lp k hoch cng tc cho cn b ti Bnh vin Mt Trung ng (TW)
3.1. M t quy trnh lp k hoch cng tc
Ti Bnh vin Mt Trung ng, hng thng Phng K hoch Tng hp (KHTH) phi lp
k hoch trc d kin cho cn b; trnh Ban Gim c duyt; sau trin khai cho cc n
v thc hin. K hoch trc d kin cho s lng ln cn b v cc b phn cng tc khc
nhau. Cc cn b c th tham gia trc khm cha bnh theo chuyn mn, trc phng khm.
Mt c nhn c th tham gia trc cc nhim v sau:
+ Trc chuyn mn: Bnh vin c nhiu b phn chuyn mn. Mi ngy, cc cn b trc
phi c phn cng theo ng chuyn mn ca mnh. y l nhim v chnh, u tin hng
u ca cc cn b.
+ Trc phng khm: Bnh vin c nhiu phng khm trc thuc khoa. Nu cn b trc
chuyn mn th khng xp trc phng khm.
Ty tng b phn m cn b c xp phi trc c ngy hoc c tun.
+ Cc b phn chuyn mn trc theo ngy: Ban Gim c, y mt, Glocom, Phng m,
. . . ; Cc b phn chuyn mn trc theo tun: Xquang, Dc, Gy m, Ngn hng mt, in
nc.
+ Cc phng khm trc theo ngy: Phng khm gio s 1 & 2, t vn; Cc phng khm trc
theo tun: Tiu phu, Chn thng, Nhi 1, Nhi 2, y mt, . . .
Mt s b phn ch lm vic na ngy, do trong ngy ch cn xp mt cn b, thi gian
trc tnh bng na ngy.
Cn b no i cng tc hoc ngh php phi bo cho Phng KHTH phng khng xp
cn b trc thi gian ny. Nu lch trc c trnh ln v c ch k ca Gim c th
khng c php sa. Trng hp cn b m au, c vic t xut, . . . khng th trc c,
cn b thay th s do Phng KHTH sp xp v ghi vo nht k kim tra.
Mi ngy, mt b phn chuyn mn hoc mt phng khm phi c bc s v t nht 1 iu
dng trc. Trong khi , cn b khng th thc hin song song 2 nhim v, s lng cn
b thng xuyn c s thay i: cng tc, ngh php, nhn vin mi, cn b ngh hu, cn
b thc tp. Nhim v l phi tm ra php gn cn b trc cc khong thi gian ca tng
b phn theo cc nhim v. iu kin l tng l cc b phn chuyn mn v phng khm
lun c cn b trc, khng xp cc cn b ang ngh php, cng tc phi trc, thi gian trc
ca cc cn b tng ng nhau. Tuy nhin, iu ny khng phi lc no cng t c.
Do c cn b phi cng tc, ngh php, mi b phn phi yu cu cn b chuyn mn
trc, khng d dng thay th cn b t b phn ny sang b phn khc.
95
Chuyn san Cng ngh thng tin v Truyn thng - S 02 (4-2013)
Th t sp xp lch nh sau: Lch trc chuyn mn c xp trc, sau n lch trc
phng khm. Mt phng n chp nhn c ca bi ton phi tha mn cc rng buc sau:
Rng buc cng: - Ti mi thi im, cn b khng c php trc nhiu b phn (bao
gm: nu cn b trc chuyn mn th khng xp trc phng khm).
- Khng xp trc nhng cn b ngh theo ch , quy nh ca nh nc hoc ca vin:
cng tc, au m, thai sn, ngh php, . . .
- Mi ngy, mi b phn u phi c cn b trc (bao gm mt bc s v 1 iu dng).
- Mi cn b ch c php lm vic mt s b phn nht nh (v d, phng khm Gio
s (GS) ch phn cng gio s trc. Do , thi gian trc ca phng khm GS c th rt
ln, khng th tng ng vi cc phng khm khc).
Rng buc mm: - Khong cch hai ln trc lin tip ca mt cn b cng xa nhau cng
tt.
- Trnh xp cn b trc mt ngy c nh trong tun.
- Tng thi gian trc ca cc cn b tng ng nhau, m bo ch v tin trc u
nhau.
R rng, bi ton lp lch c th chia ra thnh 2 lp bi ton c lp l lp lch cho bc s v lp
lch cho iu dng. Trong khun kh bi bo, chng ti ch m t bi ton lp lch cho bc s.
3.2. M hnh ton hc
Inputs:
- Tp S cc cn b.
- Tp R cc b phn.
- Tp T cc ngy trong khong thi gian cn xp.
- Mng trng thi S
s,t
trng thi ca bc s s trong ngy th t .
S
s,t
=
{
0 rnh
1 ngc li
(1)
- Mng Q biu din mi quan h gia cn b v phng b phn lm vic
Q
s,r
=
{
1 Nu cn b s c th lm vic b phn r
0 ngc li
(2)
Cc bin s (Variables):
- Cc bin quyt nh x
s,t,r
x
s,t,r
=
{
1 Bc s s b phn r c xp vo thi gian t
0 ngc li
(3)
96
Tp ch Khoa hc v K thut - Hc vin KTQS s 153 (4-2013)
- Cc bin tr gip y
s,j
, trong y
s,j
= k : ln trc th j ca bc s s trong cng mt lch l
ngy th k trong tp cc ngy cn xp lch.
- Cc bin c
s
lu tr s ln trc trong t ca cn b s
c
s
=
|R|

r=1
N

t=1
x
s,t,r
(4)
- Cc bin tr gip z
s,j
, trong z
s,j
= 1 nu ln trc th j 1 v j ca cn b s cch nhau
7 ngy, ngc li z
s,j
= 0.
z
s,j
=
{
1 Nu (y
s,j
y
s,j1
) mod 7 = 0
0 ngc li
(5)
Trong j=1,. . . ,|c
s
|.
Rng buc cng :
- HC1: Ti mt thi im, mt cn b khng c php trc nhiu b phn
|R|

r=1
x
s,t,r
1 1 t |T|, 1 s |S| (6)
- HC2: Khng xp cn b ngh php, cng tc phi trc
|S|

s=1
|T|

t=1
S
s,t
x
s,t,r
= 0 1 r |R| (7)
- HC3: Mi ngy, mi b phn u phi c mt cn b trc
|S|

s=1
x
s,t,r
= 1 1 t |T|, 1 r |R| (8)
- HC4: Mi cn b ch c php lm vic mt s b phn nht nh
|R|

r=1
|S|

s=1
Q
s,r
x
s,t,r
= 0 t (9)
Rng buc mm:
- SC1: Khong cch gia 2 ln trc ca mt cn b cng cch xa nhau cng tt.
|S|

s=1
|T|

j=2
(y
s,j
y
s,j1
) max (10)
97
Chuyn san Cng ngh thng tin v Truyn thng - S 02 (4-2013)
- SC2: Trnh xp cn b trc mt ngy c nh trong tun. Nu z
s,j
= 1 th 2 ln trc lin
tip ln j-1 v j cng mt th trong tun.
|S|

s=1
|cs|

j=2
z
s,j
min (11)
- SC3: Tng thi gian trc ca cc cn b tng ng nhau. Thi gian trc ca mt cn b
gm: thi gian trc ca lch ang xp + thi gian trc t lch trc t.
t
s
= c
s
+ t

s
(12)
|S|

i=1
|S|

j=i+1
(t
i
t
j
)
2
min (13)
4. Thit k gii thut di truyn cho bi ton Lp lch Bnh vin Mt Trung
ng
Trong phn ny chng ti s m t thit k gii thut di truyn gii quyt bi ton lp
lch Bnh vin Mt Trung ng. Gii thut bt u bng vic khi to ngu nhin mt qun
th cc gii php (lch trc). Qun th s c tin ha qua nhiu th h. Qua mi th h,
c th tt nht c lu gi cho qun th tip theo. Sau khi tin ha xong, c th tt nht
trong qun th cui cng s l phng n xp lch ca bi ton. Thit k tp trung vo cc
vn sau:
- Biu din gii php: Biu din cc gi tr trong mt nhim sc th.
- Hm nh gi: nh ngha thch nghi ca mt gii php.
- Cc ton t tin ha: nh ngha phng php bin i nhim sc th trong qu trnh tin ha.
4.1. Biu din qun th
Biu din l mt vn quan trng i vi vic gii cc bi ton lp lch [8]. i vi
bi ton ny, chng ta c th s dng mt trong hai cch: biu din nh phn v biu din
nguyn. i vi biu din nh phn, ta c th thc hin nh x trc tip t vector nh phn
thnh lch c th (thng qua cc bin quyt nh x). i vi biu din nguyn, chng ta c
th s dng nh x gin tip ti x. Vi nh x gin tip, ta c th loi b mt cch t ng
mt s rng buc (v d: HC3).V y cng l l do m chng ti chn biu bin nguyn
trong thit k thut ton ca mnh.
Mt gii php hon chnh bt buc phi c y cc thng tin v lch trc: b phn, thi
gian, cn b. Do , mt nhim sc th (gii php) ca chng ti c biu din nh sau(v
d lp lch cho giai on 4 tun):
98
Tp ch Khoa hc v K thut - Hc vin KTQS s 153 (4-2013)
i
1
i
2
i
3
i
4
i
5
. . .
i
28
pk
1
cb
1,1
cb
1,2
cb
1,3
cb
1,4
cb
1,5
. . .
cb
1,28
pk
2
cb
2,1
cb
2,2
cb
2,3
cb
2,4
. . .
pk
n
cb
n,1
cb
n,2
cb
n,3
cb
n,4
cb
n,5
. . .
cb
n,28
Trong :
+ i
1
, i
2
, . . . , i
28
l cc khe thi gian cn xp cn b trc.
+ pk
1
, pk
2
, . . . l cc phng khm trong bnh vin.
+ cb
k,j
l cn b th j ca phng khm k.
y, do c mt s phng khm cn lp lch theo tun nn c th thu gn khng gian biu
din. C th:
+ Cc phng khm trc theo tun ch cn xp 4 n v thi gian ( v d: pk
2
).
+ Cc phng khm trc theo ngy phi cn xp 28 n v thi gian ( v d: pk
1
).
4.2. nh gi c th
Vic nh gi c th (gii php) lin quan ti kim tra tnh kh thi thit lp bi cc rng
buc cng v mm. nh gi tt ca mt c th, u tin phi cn c vo tng s
ln vi phm rng buc cng: Nu hai c th cng vi phm rng buc cng, mc vi phm
rng buc cng s c dng nh gi, vi phm t hn c ngha l thch nghi cao hn.
i vi cc rng buc mm, SC3 s c u tin xem xt trc (v c coi l hm mc
tiu), sau l SC1 v SC2. la chn c th cho th h tip theo ca gii thut tin ha,
chng ti s dng php la chn giao u nh phn (binary tournament selection).
Sau qu trnh tin ha, chn c th tt nht lm phng n cho bi ton. Gii php ny cn
phi tha mn cc rng buc cng. Nu c th ny vn vi phm rng buc cng, chng ti
hin cnh bo chi tit cc vi phm cho ngi dng.
4.3. Cc ton t
Ch : Phng php ca chng ti vn cho php cc c th vi phm rng buc cng tham
gia vo qu trnh tin ha (s dng mc vi phm rng buc lm gi tr thch nghi). Ton
t chn lc dng chn ra nhng c th tt, sau lai ghp chng vi nhau sinh ra th h
con tip theo. iu ny cng ging nh trong t nhin vi hy vng rng: cc hai th tt lai
vi nhau th con chu chng s tt hn so vi hai c th ti hn lai vi nhau. Chng ti
dng php chn lc giao u (tournament selection). Theo cch ny, c mi cp ngu nhin
2 c th, s chn ra c th tt hn ca cp tham gia lai ghp.
Ton t lai ghp c vai tr sng cn trong xc nh hnh vi ca cc gii thut tin ha (EAs).
Thng thng, hai c th c la chn v cc c tnh ca chng c kt hp sinh ra
hai c th con (offspring). Ghi ch, cc c ch tng t thng xy ra trong t nhin, trong
lai ghp cho php th h tip theo tha hng cc c tnh t cha m. Tuy nhin, t gc
99
Chuyn san Cng ngh thng tin v Truyn thng - S 02 (4-2013)
tm kim v ti u, ton t ny cung cp kh nng thm him khng gian xung quanh v
tr ca cc c th cha m.
Trong thit k ny, chng ti s dng k thut lai hai im ct (two-point crossover) tng
t nh trong biu din nh phn. Vi mi mt ln thc hin ton t lai ghp, cn la chn 2
im ct, sau hon i ni dung gia hai im ct.
Cng nh lai ghp, ton t t bin l mt thnh phn quan trng trong thit k gii thut
tin ha. Khi thc hin t bin, mt s gi tr gen ca nhim sc th s thay i ngu nhin.
Ton t ny h tr vic to ra mt s c tnh gen mt trong qu trnh tin ha. Mi c
th, chng ti chn ngu nhin mt on gen thc hin ton t t bin s nguyn. i
vi qu trnh tm kim v ti u, ton t ny tng cng kh nng khai thc vng tm kim
mi ca thut ton. Trong thit k ny, cc gi tr gen c thay i theo phn b u.
4.4. Chin lc tm kim
Qun th c tin ha qua nhiu th h. Phn t tt nht ca th h cui cng c chn
lm phng n ca bi ton. Ngi dng vn c th thc hin qu trnh tin ha tip theo
chn phng n ph hp hn. Qua mi ln tin ha, cc c th u t nht nhm gi li
nhng thuc tnh tt ca tng th h.
5. Thc nghim
5.1. Chun b d liu
D liu th nghim c thu thp ti Bnh vin Mt Trung ng. D liu bao gm:
+ Danh sch cc cn b, nhn vin.
+ Danh sch cc b phn chuyn mn.
+ Danh sch cc phng khm ca vin.
Chun b d liu lp lch:
+ Danh sch cc ngy ngh, ngy l, tt.
+ Cc thng tin cho tng b phn chuyn mn, phng khm (trc na ngy, c ngy, c tun,
trc c th 7- ch nht hay khng).
+ Chuyn mn cho tng cn b.
+ Thng tin phng khm cho tng cn b (theo tng khong thi gian).
+ K hoch ngh php, cng tc, ngh hu ca cn b.
+ Lch khm cha bnh ngoi gi, lch trc ngy l - tt d kin theo ng k ca cc cn b.
5.2. Kch bn test
Chng ti tin hnh thit lp b d liu, chy th nghim cc ln khc nhau so snh
k qu thu c bi gii thut di truyn (GA) do chng ti thit k vi kt qu ca gii thut
100
Tp ch Khoa hc v K thut - Hc vin KTQS s 153 (4-2013)
Bng 1. So snh gii thut di truyn v leo i trong xp lch chuyn mn
Ln chy
Thi gian
(ms)
Gi tr hm mc
tiu
GA HC GA HC
1 1811 1726 293 323
2 1765 1803 346 360
3 1753 1792 320 357
4 1748 1758 319 335
5 1738 1763 294 326
6 1739 1752 307 315
Trung bnh
1759 1766 313 336
leo i (HC). Phng php di chuyn c s dng trong gii thut leo i l di chuyn
sang trng thi tt nht. Mi ln lp, chng ti to ra c th mi bng ton t t bin. C
th mi s c la chn nu tt hn c th c.
K hoch chy th nghim nh sau:
+ Gii thut di truyn: S c th 200, s th h 150. iu ny c ngha l thc hin 30.000
ln nh gi c th. Xc xut lai ghp v t bin ln lt l 0.9 v 0.01.
+ Gii thut leo i: m bo cng iu kin th nghim, chng ti thc hin gii thut
leo i vi s ln lp l 30.000.
+ Chy th nghim 6 ln, mi ln khi to qun th v c th mt cch ngu nhin. Qua cc
ln chy cho thy gii thut di truyn nhanh hi t n li gii tt nht nhanh hn.
5.3. Kt qu v Phn tch
5.3.1. Phn tch mc hiu qu: : Chng ti ghi li thng tin v cc gii php tt nht
trong cc ln chy tm hiu mc hiu qu ca thut ton trn bi ton. C th thy
trong tt c cc ln chy, th nghim ca chng ti u tm thy cc gii php m tha mn
mi rng buc cng. Cc kt qu trn cho thy gii thut tin ha cho kt qu tt vi bi
ton lp lch ny.
thy r hn kt qu ca gii thut tin ha, chng ti ghi nhn v so snh vi s liu th
nghim ca thut ton leo i. C th, kt qu thu c c so snh vi gii thut leo i
thng qua gi tr hm mc tiu ca gii php tt nht (xem Bng 1 v Bng 2).
C th nhn thy t hai bng kt qu ca c 2 lch chuyn mn v phng khm, Gii thut
di truyn thu c kt qu tt hn hn gii thut leo i trong tt c cc ln chy th
nghim; trong khi thi gian th kh tng ng. R rng, nguyn l tin ha t nhin gip
cho gii thut di truyn tm ra gii php mt cch hiu qu hn.
101
Chuyn san Cng ngh thng tin v Truyn thng - S 02 (4-2013)
Bng 2. So snh gii thut di truyn v leo i trong xp lch phng khm
Ln chy
Thi gian
(ms)
Gi tr hm mc
tiu
GA HC GA HC
1 642 626 104 125
2 580 569 123 112
3 579 570 110 239
4 580 564 104 154
5 585 569 104 139
6 581 566 119 128
Trung
bnh
591 577 111 150
5.3.2. Phn tch tnh ng: Vic phn tch hnh vi ca thut ton khng ch da vo kt
qu cui cng m cn da vo kt qu trong qu trnh chy. lm iu ny, chng ti ghi
li cc gi tr hm mc tiu ca cc gii php tt nht qua cc th h. Vi c hai trng hp
lch chuyn mn v lch phng khm, gii thut di truyn u hi tu rt nhanh; c th ch
sau 50 th h, gi tr hm mc tiu u thu c xung quanh 250, trong khi vi gii thut
leo i th xung quanh 1000.
thy r hn, chng ti ghi li c vic vi phm rng buc cng theo thi gian. Kt qu cho
thy l ch sau khong 50 th h, gii thut di truyn u tm ra cc gii php m khng vi
phm cc rng buc cng, gii thut leo i th kh chm trong vic tm ra gii php khng
vi phm (xem v d Hnh 1).
Hnh 1. th minh ha s ln vi phm rng buc cng ca gii thut di truyn (tri) v leo i (phi) theo
thi gian (i vi Lch phng khm)
6. Kt lun
Trong bi bo ny, chng ti a ra vn xp lch cng tc ti Bnh vin Mt Trung
ng. y va l mt bi ton lp nhiu k hoch cng tc c lin quan n nhau, va l
bi ton cp pht ti nguyn. gii quyt vn ny, chng ti m hnh ha ton hc
bi ton. T dng gii thut di truyn vi biu din nhim sc th s nguyn xy dng
102
Tp ch Khoa hc v K thut - Hc vin KTQS s 153 (4-2013)
phn mm h tr ra quyt nh. D liu th nghim v kim tra ly trc tip Bnh vin Mt
Trung ng.
7. Ph lc
Hnh 2. Mn hnh hin th Lch chuyn mn
Ti liu tham kho
[1] Burke, E. K., Kingston, J. H., & de Werra, D. (2004d). Applications to timetabling. In J. Gross & J. Yellen
(Eds.), The handbook of graph theory (pp. 445474). London: Chapman Hall/CRC.
[2] E. K. Burke, D. G. Elliman, P. H. Ford, and R. F. Weare, Examination timetabling in british universities
a survey, in The Practice and Theory of Automated Timetabling: Selected Papers from the 1st International
Conference (Lecture Notes in Computer Science 1153), E. Burke and P. Ross, Eds. Berlin, Germany: Springer-
Verlag, 1996, pp. 7690.
[3] Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of
Operational Research, 140(2), 266280.
[4] Burke, E. K., Elliman, D. G., & Weare, R. F. (1994). A genetic algorithm for university timetabling. In
Proceedings of the AISB workshop on evolutionary computing, University of Leeds, UK, 1113 April 1994.
[5] Colijn, A. W., & Layfield, C. (1995b). Interactive improvement of examination schedules. In E. K. Burke & P.
Ross (Eds.), Proceedings of the 1st international conference on the practice and theory of automated timetabling
(pp. 112121), 30 August1 September 1995. Edinburgh: Napier University.
[6] Corne, D., Ross, P., & Fang, H. (1994). Evolutionary timetabling: Practice, prospects and work in progress. In
P. Prosser (Ed.), Proceedings of UK planning and scheduling SIG workshop.
[7] A. Konar, Computational Intelligence: Principles, Techniques and Applications, Springer, 2005.
[8] Ross, P., Hart, E., & Corne, D. (1998). Some observations about GAbased exam timetabling. In E. K. Burke &
M. W. Carter (Eds.), Lecture notes in computer science: Vol. 1408. Practice and theory of automated timetabling
II: selected papers from the 2nd international conference (pp. 115129). Berlin: Springer.
103
Chuyn san Cng ngh thng tin v Truyn thng - S 02 (4-2013)
Hnh 3. Mn hnh hin th Lch phng khm
[9] White, G. M., & Xie, B. S. (2001). Examination timetables and tabu search with longer-term memory. In E.
K. Burke & W. Erben (Eds.), Lecture notes in computer science: Vol. 2079. Practice and theory of automated
timetabling III: selected papers from the 3rd international conference (pp. 85103). Berlin: Springer.
Ngy nhn bi 16-01-2012; ngy gi phn bin 21-01-2012.
Ngy chp nhn ng 5-6-2013.

Bi Thu Lm Nhn bng tin s khoa hc my tnh ti i hc New South Wales, Kensington,
Australia, nm 2007. o to sau tin s ti i hc New South Wales t nm 2007 n 2009. c
phong Ph gio s nm 2012. Hin nay, l Ph Gio s v Ph Ch nhim khoa Cng ngh Thng
tin, i hc K thut L Qu n. Ni cng tc hin nay: Khoa Cng ngh Thng tin, i hc K
thut L Qu n. Hng nghin cu chnh: tnh ton tin ha v ti u a mc tiu.
Email: lam.bui@mta.edu.vn
Phan Vit Anh Sinh ngy 19/05/1984 ti Ph Th. Tt nghip Hc vin K thut Qun s nm 2008.
Nhn bng thc s Khoa hc my tnh ti Hc vin K thut Qun s nm 2013. Ni cng tc: Khoa
Cng ngh Thng tin - Hc vin K thut Qun s. Hng nghin cu chnh: H qun tr C s d
liu. Lp lch v lp k hoch.
Email: anhpv@mta.edu.vn
104