B GIO DC & O TO VIN KH & CN VIT NAM

VIN CNG NGH THNG TIN

PHAN TH HOI PHNG
MT GII THUT DI TRUYN
GII BI TON CT VT T MT CHIU
VI NHIU KCH C VT LIU TH
LUN N TIN S TON HC
H Ni 2011
B GIO DC & O TO VIN KH & CN VIT NAM
VIN CNG NGH THNG TIN
PHAN TH HOI PHNG
MT GII THUT DI TRUYN
GII BI TON CT VT T MT CHIU
VI NHIU KCH C VT LIU TH
Chuyn ngnh: m bo ton hc cho my tnh
v h thng tnh ton
M s: 62 46 35 01
LUN N TIN S TON HC
NGI HNG DN KHOA HC:
1. PGS.TS. LNG CHI MAI
2. TS. NGUYN VN HNG
H Ni 2011
LI CAM OAN
Ti xin cam oan y l cng trnh nghin cu ca ring ti. Cc kt qu c vit
chung vi cc tc gi khc c s nht tr ca ng tc gi khi a vo lun n.
Cc kt qu nu trong lun n l trung thc v cha tng c ai cng b trong
bt k
cng trnh no.
Tc gi
Phan Th Hoi Phng
LI CMN
Lun n c thc hin v hon thnh di s hng dn ca PGS.TS Lng Chi
Mai v TS. Nguyn Vn Hng. Tr c ht, ti xin by t lng bit n su sc n c
Lng Chi Mai v thy Nguyn Vn Hng, nhng ng
i thy tn tnh
hng dn,
ch bo, gip ti hc tp v nghin cu.
Xin trn trng cm n Ban lnh o Vin Cng ngh thng tin v b phn qun l
nghin cu sinh nhit tnh gip v to iu kin thun li ti hon thnh lun
n ny.
Ti xin trn trng cmn Ban lnh o Hc Vin Cng ngh Bu chnh vin thng
to iu kin cho ti hc tp, nghin cu v thc hin lun n.
Ti cng xin cmn B phn k thut Nh my ng thp Vit -c cho php ti
thu thp s liu v trin khai m hnh th nghim ng dng gii bi ton ct vt t.
Cui cng ti xin dnh tng lun n ny cho nhng ngi thn yu: b m, chng,
con gi v con trai ca ti nh mun ni mt li cm n chn thnh nht v s gip
, s ng vi
n khng gii hn i vi ti. H chnh l ni khi ngun v cng l
ch hng ti trong hc tp v nghin cu ca ti.
i
MC LC
MU
........................................................................................................................1
Chng 1. CC KIN THC C S LIN QUAN ...............................................9
1.1. Bi ton ct vt t mt chiu vi mt loi vt liu th v thut gii
..............9
1.1.1. M hnh Gilmore-Gomory.....................................................................10
1.1.2. M hnh Arc-flow ca Valerio de Carvalho ..........................................13
1.2. Gii thut di truyn........................................................................................19
1.3. Kt lun .........................................................................................................25
Chng 2. BI TON CT VT T MT CHIU VI NHIU KCH THC
VT LIU TH: M HNH V GII PHP ...........................................................26
2.1. Pht biu bi ton ct vt t mt chiu vi nhiu kch thc vt liu th theo
Gilmore v Gomory..................................................................................................26
2.2. Pht biu mi ca bi ton OneDCSP_M.....................................................28
2.3. Gii thut di truyn lai ghp gii bi ton OneDCSP_M..............................32
2.4. Kt qu tnh ton ...........................................................................................40
2.5. Kt lun .........................................................................................................50
Chng 3. H THNG A TC T GMAS
-OneDCSP_M GII BI TON
OneDCSP_M . .........................................................................................................52
3.1. Yu cu ca h thng GMAS-OneDCSP_M................................................54
3.2. Thit k h thng GMAS-OneDCSP_M.......................................................55
3.2.1. Kin trc h thng GMAS-OneDCSP_M.............................................55
3.2.2. Thit k chi tit h thng GMAS-OneDCSP_M...................................58
3.3. nh gi tnh hiu qu ca h thng GMAS-OneDCSP_M.........................65
3.4. Kt lun .........................................................................................................67
KT LUN V HNG NGHIN CU TIP THEO
............................................68
DANH MC CC CNG TRNH CA TC GI...................................................70
TI LIU THAM KHO............................................................................................71
PH LC.....................................................................................................................78
ii
DANH MC THUT NG
Thut ng ting Vit Thut ng ting Anh
Bi ton ch Master Problem MP
Bi ton ch gii hn Restricted Master Problem RMP
Bi ton con nh gi Subproblem pricing problem
im cc Extreme point
Gii thut di truyn Genetic Algorithm GA
Gi suy gim Reduced cost
Lp trnh tin ha Evolutionary Programming-EP
Ni lng tuyn tnh lin tc Linear continuous relaxation
Ni lng tuyn tnh lin tc mnh Strong linear continuous relaxation
Ni lng tuyn tnh lin tc yu Weak linear continuous relaxation
Phng php nhnh cn Branch and Bound B&B
Phng php phn nhnh v nh gi Branch and Price B&P
Phng php phn nhnh, nh gi v
ct
Branch and Price and Cut
Phng php to sinh ct Column Generation
Tia cc Extreme ray
Tnh cht lm trn nguyn Integer Round-Up Property IRUP
Tnh cht lm trn nguyn ci bin Modified Integer Round-Up Property
MIRUP
Tnh ton tin ha Evolutionary Computation
Thut ton tin ha Evolutionary Algorithm- EA
iii
DANH MC CC K HIU, CM T VIT TT
K hiu Thut ng
AF Thut ton da trn m hnh lung cung (Arc-Flow model) ca
Carvalho gii bi ton OneDCSP_S
A-Team Asynchronous Team- Kin trc khng ng b s dng trong h
a tc t
C&P Cutting and Packing Ct vt t v ng hng
CSP Cutting Stock Problem -Bi ton ct vt t
FIPA Foundation for Intelligent Physical Agents
GA-AF Genetic Algorithm- Arc-Flow Model Thut ton lai ghp gii
thut di truyn v thut ton AF
GMAS-
OneDCSP_M
Genetic Multi Agent System- H thng gen a tc t gii bi ton
OneDCSP_M
JADE Java Agent DEvelopment Framework
LP Linear Programming Quy hoch tuyn tnh
OneDCSP One Dimension Cutting Stock Problem-Bi ton ct vt t mt
chiu
OneDCSP_M One Dimensional Cutting Stock Problem with Multiple Stock
Sizes -Bi ton ct vt t mt chiu vi nhiu kch thc vt liu
th
OneDCSP_M-
Solver
Tc t gii bi ton OneDCSP_M
OneDCSP_S One Dimensional Cutting Stock Problem with Single Stock Sizes
-Bi ton ct vt t mt chiu vi mt loi kch thc vt liu th
OneDCSP_S
LP
Ni lng tuyn tnh ca bi ton OneDCSP_S
OneDCSP_S-
Solver
Tc t gii bi ton OneDCSP_S
iv
DANH MC CC BNG BIU
Bng 2.1 Tng kt cht lng nghim so vi kt qu ca Belov
-Scheithauer ............ 44
Bng 2.2 Kt qu tnh ton ca Silvio A. Araujo v ng s ...................................... 45
Bng 2.3 Phn b chnh lch nghim so vi kt qu ca Belov
-Scheithauer ........ 46
Bng 2.4 Thng k thi gian tnh ton......................................................................... 48
Bng 2.5 Thng k phn b thi gian tnh ton ........................................................... 49
v
DANH MC CC HNH V
Hnh 0.1 S cc cch tip cn gii bi ton ct vt t mt chiu
. 6
Hnh 1-1 Cc phng n ct trong bi ton OneDCSP_S ........................................... 10
Hnh 1-2 V d v mng li v phng n ct vi L=9 v cc l
i
e{4,3,2} ............... 13
Hnh 1-3 Mt th h mi c hnh thnh qua pha chn lc v pha ti t hp.
......... 22
Hnh 2-1 Cc phng n ct trong bi ton OneDCSP_M.......................................... 27
Hnh 2-2 Biu thng k chnh lch so vi kt qu ca Belov
-Scheithauer....... 47
Hnh 2-3 Biu thng k phn b thi gian tnh ton ............................................... 50
Hnh 3-1 Kin trc ca A-Team................................................................................... 53
Hnh 3-2 Biu tng tc gia ngi dng v h thng GMAS -OneDCSP_M....... 55
Hnh 3-3 Kin trc h thng GMAS-OneDCSP_M..................................................... 56
Hnh 3-4 Cu trc b nh chung tng ng vi mi bi ton OneDCSP_M.............. 59
Hnh 3-5 Biu Use Case ca h thng GMAS-OneDCSP_M................................ 63
1
MU
Dn s th gii tng nhanh v i sng vt cht ca con ngi khng ngng
nng cao. iu dn ti nhu cu v ti nguyn thin nhin ngy cng ln. Chng
ta v ang chng kin s cn kit ca ti nguyn thin nhin, nht l nhng
ngun ti nguyn khng ti to c
nh khong sn. pht trin bn vng, vic
s dng ti nguyn mt cch hiu qu lun l vn thi s ca ton nhn loi.
Trong cc ngnh kinh t nh ch to my, xy dng, dt may vic s dng hiu
qu ti nguyn th hin bi vic s dng hiu qu cc loi vt liu th phc v cho
mc ch
kinh t.
Lnh vc ct vt t v ng hng (Cutting & Packing-C&P) bao gm nhiu bi
ton t hp, hnh hc, cc m hnh v thut ton l thuyt cng nh thc tin lin
kt vi nhau. Mc tiu chnh ca lnh vc ny l sp xp mt cch hiu qu cc i
tng c m t bng ngn ng hnh hc trong mt min ln hn. Cc bi ton
sau y l cc bi ton in hnh cho ch ny: Ct vt t v bi ton ph thi, xp
thng (bin packing), bi ton sp ba l (knapsack), cn bng lung (line balancing),
bi ton phn phi b nh v lp lch cho b a x l (
memory allocation and
multiprocessor scheduling problem) Cc bi ton ct vt t v ng hng c
pht biu v x l trong nhiu ngnh khoa hc khc nhau nh khoa hc qun
l,
khoa hc k thut, khoa hc my tnh v cng ngh thng tin, ton hc v vn tr
hc. Chng l cc bi ton thc t t ra cho cc ngnh cng nghip nh cng
nghip knh, thp, giy, da, may mc, vn ti v hu cn.
T gia th k trc c nhiu c
ch tip cn gii cc bi ton ct vt t v
ng hng c xut. Cng trnh khi ngun cho ch ny do
L.V.Kantorovich a ra nm 1939 khi ng xut p dng cc m hnh ton hc
2
t chc v lp k hoch sn xut. Cc m hnh ny c pht biu d i dng cc
bi ton Quy hoch nguyn v c ch ra thuc lp cc bi ton NP-hard. M hnh
c mt s nhc im nh c ni lng lin tc yu v tnh i xng nn vic p
dng n trong cc bi ton thc tin t ra khng hiu qu.
khc phc nhc im ca m hnh trn, mt m hnh khc cng vi k thut
gii hiu qu bi ton ct vt t mt chiu c Gilmore v Gomory xut vo
nhng nm 60 th k trc. Trong k thut ny, cc tc gi s dng cng c quy
hoch tuyn tnh gii bi ton ni lng lin tc dn xut t bi ton quy hoch
nguyn. Nghim ca bi ton quy hoch nguyn ban u s nhn c bng cc k
thut lm trn nghim ca bi ton ni lng lin tc khi bi ton m bo tnh cht
lm trn nguyn (Integer Round-Up Property-IRUP). xut ca Gilmore v
Gomory c bit hiu qu khi gii cc bi ton ct vt t nh k thut to sinh ct
vi vic gii Bi ton xp ba l nh mt bi ton con. Sau ny k thut to sinh ct
tr thnh k thut c a chung nht khi ngi ta cp ti vic gii cc bi ton
quy hoch c ln.
Do tnh khoa hc cng nh thc tin cao ca ch c t vt t v ng hng nn
vo nm 1988 H. Dyckhoff v G. Waescher thnh lp Special Interest Group on
Cutting and Packing (SICUP), bc quan trng h tr nghin cu quc t v ch
ny. Mt trong nhng ng gp
ni bt ca H.Dyckhoff vo nm 1990 cho vic
pht trin cc nghin cu l thuyt cng nh ng dng trong lnh vc ny l vic
a ra phn loi (Typology) cc bi ton ct vt t v ng hng da trn iu t
ra
cc c tnh ca cu trc hnh hc, cu trc logic v ng cnh xut hin ca chng
trong thc t. S phn loi ny c G.
Waescher v cc ng nghip tip tc hon
thin vo nm 2007. Vic phn loi c thc hin da trn bn tiu ch:
3
1. S chiu ca bi ton: c th l 1, 2, 3 hoc ln hn
2. Kiu gn (Kind of assignment): C hai kiu gn l cc i ha u ra
(Output Maximization) hoc cc tiu ha u vo (Input Minimization)
3. Phn loi cc i tng
nh (Assortment of small items): ng nht, tng
i khng thun nht (weakly heterogeneous assortment), hon ton khng
thun nht (Strongly heterogeneous assortment)
4. Phn loi cc i tng ln (Assortment of large objects):
- Mt i tng ln (c th c xem xt chi tit hn ph thuc vo cc
chiu ca i tng c c nh hay c th bin i )
- Mt s i tng ln vi cc chiu c nh. Trng hp ny c th c
chia thnh cc bi ton vi cc i tng ln ng nht , tng i ng
nht v hon ton khng ng nht.
Trong cc kiu bi ton ct vt t th Bi ton ct vt t mt chiu (One
Dimensional Cutting Stock Problem OneDCSP) gi mt v tr quan trng v
chim gn mt na tng s cng trnh c cng b v ch ny. C nhiu l
do gii thch v mi quan tm ca cng ng nghin cu dnh cho bi ton ny
trong c th dn ra nhn xt ca Gilmore v Gomory khi ni rng, nhiu bi ton
ct vt t nhiu chiu c th c x l bng mt quy trnh nhiu cng on da
trn nn tng bi ton ct vt t mt chiu. T cng trnh khi u ca Gilmor
e v
Gomory, hng lot cc bin th khc nhau ca bi ton OneDCSP c pht biu
v gii quyt bng cc cch tip cn khc nhau.
Bi ton ct vt t mt chiu vi nhiu kch thc vt liu th (One -Dimensional
Cutting Stock Problem with Multiple Stock sizes OneDCSP_M) l m rng t
nhin ca bi ton ct vt t mt chiu vi mt loi vt t OneDCSP. Cho n nay
c rt t cng trnh nghin cu v bi ton ny c cng b. Theo phn loi ca
Waescher, bi ton OneDCSP_M c chia thnh hai lp con: lp khng rng buc
s lng ca tng loi vt t u vo v lp c rng buc ny.
4
C th thy hu ht cc cng trnh lin quan n bi ton OneDCSP_M u
hng ti gii cc bi ton thuc lp th hai . Chng ta c th khi qut cc cch
tip cn c xu t gii bi ton ny nh sau.
Bi ton ct vt t
OneDCSP_M l bi ton quy hoch nguyn v thuc lp NP-
kh v vy khng tn ti thut ton bo m cho nghim ti u trong thi gian a
thc. Cho n nay cc phng php gii chnh xc bi ton quy hoch
nguyn ny
v cc bin th ca n u c xy dng theo lc phn nhnh v nh gi
(Branch and Price B&P) da trn ni lng tuyn tnh lin tc ca m hnh do
Gilmore-Gomory xut vo nm 1963 [26,27] v sau ny l m hnh arc-flow ca
Valerio de Carvalho [55]. Gn y, Belov [11], Carvalho v ng nghip [56]
a vo s dng cc lt ct trong lc trn to nn lc phn nhnh nh
gi v ct nhm ci thin tc tnh ton khi gii bi ton. Vic ci bin cc lc
trn p dng gii cc bin th khc nhau ca bi ton cng c xut
[12,13,14,30,44,58].
Do cc phng php chnh xc gii bi ton ct vt t i hi chi ph thi gian
kh tn km i vi cc bi ton c kch thc trung bnh hoc ln nn nhiu tc
gi xut
cc gii thut heuristic khc nhau nhm tm kim nghim c cht
lng tt trong khong thi gian chp nhn c. Cc gii thut heuristic khng s
dng ni lng tuyn tnh lin tc ca bi ton m da vo cu trc ca bi ton
iu khin qu trnh tm kim.
Cc gii thut heuristic u tin c xut gii cc bi ton ct vt t
thng da trn cc phng php tm kim cc b nh First -Fit, Next-Fit, Best-Fit
v Worst-Fit Decreasing xy dng cc phng n ct
[52]. tng chnh ca
nhng phng php ny l sau khi sp xp danh sch cc thnh phm theo th t
kch thc gim dn, cc phng n ct c
xy dng theo cc chin lc khc
nhau. Phng php First-Fit Decreasing tm thnh phm ph hp xp vo
phng n ct, cn phng php Next-Fit tm ch trng trn cc phng n ct
t thnh phm. Phng php Best-Fit hn ch phn d tha ca mi phng n ct
5
bng cch tm khng gian nh nht c th t cc thnh phm, trong khi phng
php Worst-Fit th li t thnh phm vo khng g
ian ln nht tmc nhm li
nguyn liu nhiu nht cho cc bc lp tip theo.
Mt vn ny sinh l cc phng php da trn tm kim cc b nh vy
thng rt nhanh chng ri vo cc cc tr a phng. hn ch kh nng khng
mong mun ny, mt s tc gi xut p dng cc Metaheuristic vo vic gii bi
ton. Yang dng gii thut tham lam trong s dng mt hm mc tiu ph thuc
vo mt s lng nh cc iu ki n ct h tr pht hin nghim tt nht trong
qu trnh tm kim cc b ti tng bc ca qu trnh gii bi ton [60]. Trong [20],
Eshghi v cng s s dng gii thut n kin vi cc quy tc xc sut nh ngha
trc da trn n kin c th la chn cc phng n ct tm ra phng n
ct tt nht. Gii thut ti luyn m phng c s dng trong cc cng trnh
[33,32].
Mt lp c bit cc gii thut metaheuristic gii bi ton ct vt t l lp cc
gii thut di truyn (Genetic Algorithm-GA). Cc gii thut ny c xy dng
theo
hai cch tip cn: cch tip cn n hng v cch tip cn da trn nhm.
Trong cch tip cn n hng, cc thnh phm c s dng mt cch c lp
khi to ra cc phng n ct. Cch tip cn ny kh gn gi vi nh ngha ca bi
ton nhng t c p dng trong thc tin v cc gen m ha nghim ca bi ton
thng b ph v di tc ng ca cc ton t lai ghp. Toyoda v ng nghip
[51,53] xut cc ton t lai ghp khc nhau trong gii thut di truyn ca mnh
gii bi ton ct vt t. Falkenauer xut m hnh da trn nhm [21], trong
cc phng n ct c xy dng da trn cc nhm thnh phm c phn
chia nhm khc phc s nh hng ca cc ton t di truyn n cu trc nghim.
Yakawa v ng nghip cng a ra
ton t lai ghp c bit gn vo m hnh gii
thut di truyn da trn nhm do Falkenauer xut [ 59].
Mt xut s dng tng lp trnh tin ha (Evolutionary Programming-EP)
gii bi ton ct vt t cng c xut [39]. Trong lp trnh tin ha, php tm
kim c thc hin nh cc ton t t bin m khng s dng ton t lai ghp.
6
Liang a ra hai ton t t bin mi v ch ra tnh u vit ca cc ton t ny.
Khc vi lp trnh tin ha, gii thut di truyn s dng c ton t lai ghp trong
qu trnh tm kim. Raymond Chiong v ng nghip [43] tin hnh so snh hai
cch tip cn EP v GA v kt hp tnh u vit ca c hai cch tip cn xy dng
mt gii thut di truyn cho bi ton ct vt t. Trong [48], Araujo v ng nghip
s dng gii thut heuistic First-Fit decreasing xy dng cc phng n ct to ra
cc c th (nghim chp nhn c) mc thp. mc cao, cc tc gi xut
thut ton tin ha (Evolutionary Algorithm-EA) vi ton t la chn tham lam
ngu nhin. Vic to ra cc c th mi c thc hin nh qu trnh trao i cc
phng n ct gia cc c th trong mt pha c t tn l co -operation.
Mi y, vic lai ghp gii thut di truyn vi cc phng php s dng ni lng
tuyn tnh lin tc cng c tc gi lun n xut trong [1,2].
Cc cch tip cn gii bi ton ct vt t c th m t theo s sau.
Hnh 0.1 S cc cch tip cn gii bi ton ct vt t mt chiu
Cc cch tip cn gii bi
ton OneDCSP
Cch tip cn chnh
xc
Da trn m hnh ni
lng lin tc
K thut B&P
Cch tip cn heuristic
Cch tip cn lai ghp
Da trn Metaheuristic
v tip cn chnh xc
Pure-heuristic
Da trn tm
kim cc b
Metaheuristic
S dng cng c
ton hc hn ch
cc tr a phng
- Phng php to
sinh ct ca
Gilmore&Gomory
- M hnh arc-flow
ca Carvalho
- Cc thut ton ci
bin (Belov,)
- First-Fit
Decreasing
- Next-Fit
Decreasing
- Best-Fit
Decreasing
- Worst-Fit
Decreasing
- Gii thut di truyn
- Lp trnh tin ha
- Thut ton tin ha
- Gii thut n kin
- M phng ti luyn
- Tabu Search
Thut ton
GA-AF
7
Theo hiu bit ca tc gi, cho n nay cha c mt cng trnh no lin quan n
gii bi ton OneDCSP_M thuc lp th nht (khng c hn ch v s lng vt
liu th) c cng b. Bi ton ny cng chnh l i tng nghin cu t ra cho
bn lun n ny.
Lun n ny nhm ng gp mt phng php hiu qu gii bi ton
OneDCSP_M xut pht t m hnh ca Gilmore v Gomory, vi iu kin
ngun
nguyn liu khng b gii hn. Nhng ng gp chnh ca tc gi trong lun n ny
bao gm:
- Tin hnh phn tch mi lin quan ng ngha ca bi ton OneDCSP_M vi
bi ton ct trn mt loi vt liu th (One Dimensional Cutting Stock
Problem with Single Stock Sizes - OneDCSP_S). T a ra mt cch
pht biu mi ca bi ton ct vt t vi nhiu kch c vt liu th
OneDCSP_M
- Trn c s pht biu mi ca bi ton OneDCSP_M v nhng mi lin quan
ng ngha vi bi ton OneDCSP_S, xut lai ghp gii thut di truyn
vi k thut phn nhnh v nh gi theo m hnh Arc-Flow to nn thut
ton GA-AF gii hiu qu bi ton OneDCSP_M. Tnh ng n ca thut
ton c chng minh bng l thuyt. Tnh hiu qu c kim chng trn
mt s lng tng i ln cc bi ton
mu.
- nng cao hiu qu khi gii cc bi ton thc t, thut ton GA-AF c
ci t di dng mt h thng a tc t
thc hin cc tnh ton song song
v phn tn nhm tn dng ti nguyn tnh ton ca mng cc b (LAN).
Tnh ng n ca h thng c chng minh cht ch.
Tnh hiu qu ca
h thng c phn tch bng ton hc cng nh trong mi trng trin
khai thc tin.
Cc kt qu c chnh c trnh by trong 4 cng trnh cng b trn tp ch
chuyn ngnh v hi tho quc t.
Cu trc ca Lun n nh sau:
8
Ngoi phn M u v Kt lun chung, lun n c chia lm 3 chng.
Chng 1 trnh by cc cng c ton hc c s nhm gii quyt bi ton t ra
chng sau. Phn th nht ca chng trnh by cc m hnh v thut gii chnh
xc cho bi ton ct vt t vi mt loi vt liu th. Phn th hai
trnh by tm tt
mt s vn c bn ca gii thut di truyn.
Trong chng 2, tc gi phn tch mi lin quan ng ngha gia bi ton
OneDCSP_M v bi ton OneDCSP_S. Kt qu cho thy vic ct vt t vi nhiu
kch thc vt liu th s mang li hiu qu hn so vi trng hp ch c mt loi
vt liu th v t xut mt m hnh mi cho bi ton OneDCSP_M. Cc phn
tch cng lm c s cho vic lai ghp gii thut di truyn (GA) vi thut ton
phn nhnh v nh gi theo m hnh Arc-Flow (AF) ca Carvalho to nn thut
ton mi GA-AF gii bi ton OneDCSP_M. Tnh ng n ca thut ton GA-AF
c chng minh cht ch. Tnh hiu qu ca thut ton cng c kim chng trn
tp cc bi ton mu do Belov [11] a ra.
Pht biu mi ca bi ton OneDCSP_M trong chng 2 phn r bi ton
thnh nhiu bi ton con c th gii quyt mt cch c lp bng thut ton phn
nhnh v nh gi theo m hnh AF. T
, trong chng 3, tc gi ci t thut
ton di dng mt h thng a tc t GMAS-OneDCSP_M nhm nng cao hiu
qu trong ng dng thc tin. Tnh ng n ca h thng c chng minh
; hiu
qu ca n c phn tch cht ch v c kim chng bng vic trin khai th
nghim trong mi trng cng nghip.
9
Chng 1. CC KIN THC C S LIN QUAN
Chng ny trnh by tm tt nhng cng c ton hc lin quan lm c s cho
vic xy dng gii php cho bi ton OneDCSP_M c a ra trong cc Chng
tip theo. Phn th nht gii thiu bi ton ct vt t mt chiu vi mt loi vt liu
th OneDCSP_S vi hai m hnh gii bi ton: m hnh ca Gilmore-Gomory v
m hnh Arc-Flow ca Carvalho. Phn tip theo ca chng cp nhng ni dung
c bn ca thut ton di truyn.
1.1. Bi ton ct vt t mt chiu vi mt loi vt liu th v thut gii
Bi ton ct vt t mt chiu kinh in (bi ton ct vt t mt chiu vi mt loi
vt liu th One Dimensional Cutting Stock Problem with Single Stock Length
OneDCSP_S) c xc nh bi cc d liu sau:
(m,L,l=(l
1
,,l
m
),b=(b
1
,,b
m
)),
trong :
- m l s dng vt liu thnh phmc ct t vt liu th
- L l b rng ca tm vt liu th
- i vi mi dng vt liu thnh phm j :
+ l
j
l b rng
+ b
j
l n hng cho loi vt liu thnh phm.
Bi ton t ra l tm cch ct sao cho s lng tm vt liu th s dng l t nht
m vn p ng c yu cu ca n hng.
y, cc khi nim vt liu th, vt t, nguyn liu u vo ca bi ton c
hiu vi ngha tng ng. Tng t, hai thut ng thnh phm v sn phm cng
mang ngha tng
ng.
10
Hnh 1-1 Cc phng n ct trong bi ton OneDCSP_S
Bi ton OneDCSP ln u tin c Kantorovich [35] pht biu di dng bi
ton quy hoch nguyn v c chng minh thuc lp bi ton NP
-Hard. Sau
nhiu tc gi xy dng cc m hnh khc nh m hnh ca Gilmore -Gomory
[26], m hnh Arc-flow ca Valerio de Carvalho [55], m hnh Node-flow ca
Belov [14]nhm khc phc tnh ni lng lin tc yu cng nh tnh i xng ca
m hnh Kantorovich, ng thi tn dng cc thng tin cu trc ca khng gian
nghim nhm xy dng cc thut ton gii chnh xc cho bi ton. Sau y l hai
m hnh gc thng c s dng khi nghin cu bi ton.
1.1.1. M hnh Gilmore-Gomory
nh ngha 1.1 Mt phng n ct l mt vc t ct
,
1
,...,
j m
j mj
a a a
+
= e , j=1,,n
vi a
ij
l s ln thnh phm th i c ct theo phng n ct j t tm vt
liu th. Phng n ct gi l chp nhn
c nu n tha mn i
u kin:

=
s
m
i
ij i
L a l
1
(1.1)
Gi s n j x
j
,..., 1 , = l s ln phng n ct chp nhn c th j c s dng
trong nghim. Khi m hnh
bi ton ct vt t mt chiu vi mt loi vt liu th
ca Gilmore v Gomory c pht biu nh sau:
x x b l L m S OneDCSP
n
j
j
min min ) , , , ( _
1
= =

=
(1.2)
L
l
i
Phng n ct j
a
ij
L
l
i
a
i1
. . . . . .
Phng n ct 1
11
trn min rng buc:
1
n
ij j i
j
a x b
=
>

i=1,,m (1.3)
j
x
+
e , j=1,,n (1.4)
M hnh (1.1)-(1.4) l bi ton quy hoch nguyn vi s lng bin
n tng theo
hm m ca m. M hnh ny khc phc c tnh i xng ca m hnh
Kantorovich v c ni lng lin tc mnh vi d o
n v tnh cht lm trn nguyn
ci bin (Modified Integer Round-Up Property MIRUP) nh sau:
S sai khc gia gi tr ti u ca bi ton
) , , , ( _ b l L m S OneDCSP v gi tr ti
u ca bi ton ni lng lin tc ca n lun lun nh hn 2
Trong thc t ngi ta cha ch ra c cc v d c s sai khc ln hn 7/6 [44].
Hn na, nhng v d c sai khc nh hn 1 chim a s. Nhng bi ton nh vy
c gi l cc bi ton c tnh cht lm trn nguyn (Integer Round-Up Property
IRUP). Nhng bi ton c sai khc ln hn hoc bng 1 c gi l nhng bi ton
non-IRUP.
Trn c s d on , Gilmore v Gomory xut cch tip cn gii bi ton
(1.1)-(1.4) gm 2 bc: 1/ gii bi ton ni lng lin tc ca (1.1)-(1.4); 2/ Lm
trn s nghim ti u ca bi
ton ni lng lin tc nhn c nghim ca bi
ton (1.1)-(1.4).
gii bi ton ni lng lin tc ca (1.1)-(1.4) vi s lng bin
n rt ln,
Gilmore v Gomory ln u tin xut s dng k thut to sinh ct , trong mi
bin ch c sinh ra khi n thc s cn thit cho vic ci thin nghim tm c
trc . Sau khi thm vo cc bin ph (slacks) ta c th a bi ton (1.1)-(1.4)
v dng chun:
, ;
_ ( , , , ) min : ,
n
OneDCSP S m L l b x Ax b x
+
= = e (1.5)
12
Ni lng lin tc ca (1.5) nhn c bng cch loi b rng buc nguyn trn
cc bin v c gi l bi ton ch (Master Problem
- MP) s c dng:
, ;
_ ( , , , ) min : ,
LP n
OneDCSP S m L l b x Ax b x
+
= = e (1.6)
Xut pht, k thut to sinh ct s lm vic vi mt tp con cc ct ca A c
gi l bi ton ch hn ch (Restricted Master Problem - RMP). RMP c th c
khi to d dng, v d bi c s kin thit ban u ca phng php n hnh. Gi
s A l cc ct trong A c la chn. Khi RMP c dng:
, ;
_ ( , , , ) min : ' ,
LP n
OneDCSP S m L l b x A x b x
+
= = e (1.7)
Nhn xt rng gi suy gim ca mt bin ng vi phng n ct chp nhn c
a trong (1.7) c xc nh bi cng thc
ua 1 , vi
m
u
+
e l cc gi tr bin i
ngu ti u ca (1.7). Do vy vic tm kim ct c th ng gp ci thin gi tr
hm mc tiu chnh l vic tm nghim ti u ca bi ton con nh gi ( hay l bi
ton xp ba l):
, ;
max : ,
m
ua al L a
+
s e (1.8)
Nghim ti u ca (1.8) s ln lt c thm vo RMP nu gi tr ti u tng
ng ca (1.8) ln hn 1. Nu (1.8) khng c nghim ti u nh vy th nghim ti
u ca bi ton RMP (1.7) chnh l nghim ti u ca bi ton MP (1.6).
Trn c s tn
g va trnh by, phng php to sinh ct gii bi ton quy
hoch tuyn tnh c ln c Gilmore-Gomory nhng vo lc nhnh cn
(Brand and Bound) to nn lc phn nhnh v nh gi
(Branch and Price)
cho vic gii bi ton quy hoch nguyn OneDCSP_S. c nhiu chin lc phn
nhnh heuristic khc nhau c xut. Mt s chin lc c th tra cu trong
[44,58].
13
1.1.2. M hnh Arc-flow ca Valerio de Carvalho
Valerio de Carvalho [55] ln u tin xut pht biu li bi ton
(1.1)-(1.4)
di dng mt m hnh da trn mng li (network-based model) rt sng sa vi
tn gi Arc-Flow Model nh sau.
Chng ta xy dng mt mng li khng chu trnh G=(N,A)
Trong :
- N={0,1,,L} l tp cc nt;
- , ; , ; , ; L N u v u m i l u v N N v u A
i
\ / ) , ( ,.., 1 , / ) , ( e = = e = l tp cc cung.
Cc cung ni mi cp nt lin tip t 0 ti L khng ph bt c mt thnh phm
no. Mt sn phm th i c biu din mt s ln trn mng li bi cc cung c
di v-u=l
i
, i=1,,m.
Ta k hiu cc bin quyt nh x
uv
l s lng cc cung thnh phm c kch
thc v-u c ct t bt c tm vt liu th no ti nt cch bin tri ca tm vt
t u n v.
Mt ng i t nt khi u 0 ti nt kt thc
L cha t nht mt cung c
di
l
i
(i=1,,m) s m ha mt phng n ct chp nhn c.
Hnh 1-2 V d v mng li v phng n ct vi
L=9 v cc l
i
{4,3,2}
0 1 2 3 4 5 6 7 8 9
4 2 2
14
Vi cch xc nh mng li nh vy , bi ton OneDCSP_S s c phc tp
tnh ton gi a thc (Pseudo
-polynomial) O(mL) v tr thnh bi ton tm lung
cc tiu sau:
Min z (1.9)
trn min rng buc:
i
A l u u
l u u
b x
i
i
>

e +
+
) , (
,
vi i e{1,,m} (1.10)
z x
A v o
v
=

e ) , (
, 0
(1.11)
0
) , ( ) , (
=

e e A t v
vt
A v u
uv
x x v e{1,,L-1} (1.12)
z x
A L u
uL
=

e ) , (
(1.13)
uv
x
+
e (u,v)eA (1.14)
Nu ta p dng phn r Dantzig-Wolfe (biu din mt im trong a din bng t
hp li ca cc im cc cng vi mt t hp tuyn tnh khng m ca cc tia cc)
vo bi ton (1.9)-(1.14) v gi rng buc (1.10) trong bi ton ch th bi ton con
xc nh bi (1.11)-(1.14) l bi ton lung vi khng gian nghim tng ng vi
cc lung chp nhn c gia nt khi u 0 v nt kt thc L. Bi ton con ny
th hin rng buc bo ton lung (flow conservation constrain) vi lng cung cp
vt t cha bit z t im khi u v p ng yu cu ti im kt thc. Cho cc
nhn t i ngu
i
, i=1,,m gn vi rng buc (1.10), bi ton con nh gi tr
thnh:

e +
+

A l u u
l u u i
i
i
x z Min
) , (
,
(1.15)
trn min rng buc (1.11)-(1.14)
Thc cht, bin z c th c coi nh cung phn hi t nt kt thc L ti nt
khi u 0 (cng c th k hiu l x
w0
) v cc nghim ca bi ton con nh l lung
15
chu trnh c to nn bi ng i t nt khi u 0 ti nt kt thc L v cung x
w0
.
Nh vy c mt tng ng 1
-1 gia cc chu trnh v cc ng i. Nu chng ta coi
cc nghim ca bi ton con nh cc chu trnh, cc rng buc ca bi ton con xc
nh mt h thun nht v khng gii ni. Do , a din tng ng c mt im
cc duy nht l nghim 0 v mt s hu hn cc tia cc l cc chu trnh c hng,
mi chu trnh tng ng vi mt phng n ct chp nhn c. Bi ton con ch
sinh ra cc tia cc v vic thay th chng vo (1.9) v (1.10) s to nn m hnh
Gilmore-Gomory (1.2)-(1.4) gm t hp tuyn tnh khng m ca cc phng n
ct v khng c rng buc li. Do hai m hnh l tng ng nn cc cn di ca
cc ni lng tuyn tnh lin tc ca chng l bng nhau, tc l m hnh arc flow
cng c ni lng tuyn tnh mnh sau khi p dng phn r Dantzig-Wolfe.
Bi ton con nh gi (1.15) vi min rng buc (1.11)-(1.14) l bi ton tm
ng i ngn nht trn mt mng li c kch thc gi a thc v c th c
gii bi thut ton quy hoch ng v nghim ti u ca n cng l nghim ti u
ca bi ton xp ba l (1.8) [55].
u im ca m hnh ny l hon ton khng lm thay i cu trc ca bi ton
ch v cc bi ton con khi to ni lng tuyn tnh lin tc cng nh trong qu
trnh
thc hin chin lc phn nhnh v nh gi.
Ta nhn thy rng, m hnh trn c nhc im l tnh i xng. loi b iu
, Valerio de Carvalho xut cc thnh phm c ct theo chiu gim ca kch
thc, tc l cc cung tng ng vi cc t
hnh phm c kch thc ln hn s c
xp gn nt 0 hn v ph thi c dn v pha nt L.
T , Valerio de Carvalho xut thut ton gii chnh xc bi ton
OneDCSP_S vi tng chnh nh sau:
Chin lc phn nhnh:
Gi s x
pq
l mt bin lung trong m hnh arc flow. Nh vy, mt phng n ct
trong m hnh Gilmore-Gomory tng ng s ng gp cho bin lung x
pq
nu n
c mt thnh phm kch thc q-p c ct t im bt u l p. Nu ta k hiu
16
A(p,q) l tp tt c cc phng n ct trong m hnh ca Gilmore-Gomory cha
thnh phm c di
q-p ti im c khong cch
p t bin tri ca vt liu v cc
x
j
l cc bin quyt nh ca m hnh ny, ta c th xc nh gi tr ca bin lung
x
pq
nh sau:

e
= =
) , ( q p A j
j pq
x x (1.16)
Nu o khng nguyn, ta to 2 nhnh tng ng vi cc bt ng thc x
pq
o
v x
pq
o( i vi mt cung n ti v tr ( p,q). Ni cch khc cc rng buc phn
nhnh ch tc ng t
i cc phng n ct c cung ti v tr (p,q). Khi ta c bi
ton OneDCSP_S trn nt w bt k c dng sau:

eJ j
j
x Min (1.17)
trn min rng buc:

e
>
J j
i j ij
b x a , i=1,,m (1.18)

e
e s
J j
w l
ij j
l
j
G l x x , (1.19)
(
e
e >
J j
w l
ij j
l
j
H l x x , (1.20)
x
j
0, jeJ (1.21)
y G
w
v H
w
l cc tp hp ch s ca cc rng buc phn nhnh c dng v
tng ng;
l
ij
x l cc gi tr khng nguyn ca lung 0<
l
ij
x <b
i
;
l
j
=1 nu cung
(i,i+l
i
) thuc phng n ct j v bng 0 nu ngc li; J l tp tt c cc phng n
ct chp nhn c. Ta thy (1.17)
-(1.18) chnh l m hnh ca Gilmore-Gomory;
(1.19)-(1.20) l cc rng buc phn nhnh.
Nh vy, mi nt ca cy s tng ng vi cng mt m hnh Gilmore
-Gomory
(phn r Dantzig-Wolfe ca m hnh Arc flow) (1.17)-(1.18) vi vic b sung cc
rng buc phn nhnh da trn cc bin lung (1.19)-(1.20).
17
Gi s
d
, d=1,,m, l cc bin i ngu ca (1.17)
-(1.18); v l cc vc t
cc bin i ngu tng ng cc rng buc r nhnh (1.19)
-(1.20);
w w
j i
G G _
) , (
v
w w
j i
H H _
) , (
l tp cc rng buc r nhnh p t cho mt cung xc nh (
i,j) ti nt
w cho trc trn cy phn nhnh v nh gi. Khi gi suy gim ca bin x
ij
ti
nt w c tnh bng cng thc:

e e
+ =
w
j i
w
j i
H l
l
G l
l d
ij c
) , ( ) , (
(1.22)
vi d l thnh phm tng ng vi cung ( i,j).
Ta nhn thy rng ch c gi ca cc bin l thay i cn cu trc ca bi ton
con c gi nguyn. Bi ton con ny c th gii bng phng php quy hoch
ng ging nh gii bi ton xp ba l v ch cho cc phng n ct chp nhn
c vi cc thnh phm c xp theo th t kch thc gim. Cc phng trnh
quy c cho nh sau:
0 ) 0 (
0
= F
, ) ( max ) (
1
0
, ) 1 (
1
0 :
max
)
`

+ =

=
+

s s
l
k
kw x w k x
d d
l l l valid
d d d
d
c lw x F x F
x=0,1,,L, d=1,,m
vi

) / , min(
max
d d d
l L b l = l cn trn ca s lng thnh phm
d trong mt
phng n ct gii hn bi k hoch sn xut ca thnh phm v kch thc ca
vt liu th.
a ra gi m thut ton phn nhnh v nh gi AF (theo m hnh Arc-Flow)
gii chnh xc bi ton OneDCSP_S theo xut ca Carvalho, chng ta s dng
nhng k hiu sau:
- W: tp cc nt trn cy phn nhnh. Mi nt c th c k hiu l w
- A
w
l tp cc cung ca m hnh arc-flow ti nt w
18
- G
w
l tp ch s cc bt ng thc r nhnh c du s i vi cc bin lung ti
nt w
- H
w
l tp ch s cc bt ng thc r nhnh c du > i vi cc bin lung ti
nt w
Nh vy, mi nt trn cy phn nhnh s c c trng bi b ba w=(A
w
,G
w
,H
w
).
T ta c th pht biu thut ton
AF nh sau:
THUT TON AF:
Start: Khi to tp cc nt W ban u ch cha mt nt gc w=(A
w
,G
w
,H
w
) vi A
w
l mt tp cc cung tng ng vi nghim chp nhn c ty ch
n X
*
vi
gi tr hm mc tiu l z
*
;
G
w
=H
w
=C;
w*w; // (Bi ton ch hn ch RMP)
while W= C do
Chn mt nt w trong W
Tm nghim ti u X
LP
v gi tr ti u ca hm mc tiu tng ng z
LP
cho ni
lng tuyn tnh ca RMP nhn c t phn r Dantzig -Wolfe ca w.
Gii bi ton nh gi vi cc nghim i ngu ti u tng ng ca w
if C cung mi (u,v) nm trong ng i tng ng vi ct c gi m
then
A
w
=A
w
, , ;
, u v // (B sung ct)
else
if z
LP
z
*
then W=W \{w}
else
if Nghim nhn c X
LP
l nguyn
then Cp nht nghim ti u mi: X
*
X
LP
, z
*
z
LP
, w*w
else Phn nhnh: Gi x x
ij
= khng nguyn.
W=W{w,w} trong
19
w=(A
w
,G
w
,H
w
)
w=(A
w
,G
w
,H
w
)
G
w
=G
w
, ;
ij
x s 1

H
w
=H
w
, ;
ij
x > (
1
end while
Return (X*, nt cha n w* )
1.2. Gii thut di truyn
tng p dng cc nguyn l ca Darwin t ng gii bi ton xut hin t
nhng nm 40 ca th k 20, rt lu trc khi my tnh ra i
[22]. T nhng nm
Turing xut php tm kim tin ha hay tm kim gen (Genetical or
evolutionary search). Trong nhng nm 1960, ba khuynh hng pht trin ca
tng c s ny din ra cc ni khc nhau. Ti M, Fogel, Owens v Walsh
xut hng nghin cu lp trnh tin ha (Evolutionary programming) [23,24] cng
thi im vi phng php ca Holland c tn gi l gii thut di truyn (Genetic
Algorithm) [17,28,29]. Trong khi ti c, Rechenberg v Schwefel t nn
mng cho chin lc tin ha (Evolution Strategies) [ 47]. Trong khong 15 nm sau
, cc hng nghin cu ny c pht trin mt cch ring bit. Cho n nhng
nm 1990, cc hng nghin cu ny c nhn nhn li nh nhng th hin khc
nhau ca mt cng ngh chung l tnh ton tin ha (Evolutionary Computing) [4,
5, 6, 18, 40]. Cng trong thi i
m ny, mt nhnh th t da trn tng chung ra
i vi tn gi lp trnh gen (genetic programming) do Koza i tin phong
[7,37,38]. Trong thut ng hin i, ton b lnh vc nghin cu ny c coi l
ngnh tnh ton tin ha, cc thut ton trong c gi l cc thut ton tin ha.
Lp trnh tin ha, chin lc tin ha, gii thut di truyn v lp trnh gen
c
xem nh cc lnh vc nh thuc v cc bin th ca thut ton tng ng.
20
Gii thut di truyn l mt h cc m hnh tnh ton da trn tng tin ha.
Cc gii thut ny m ha nghim tim nng ca mt bi ton c th bng mt cu
trc d liu ging nh cc nhim sc th (chromosome) v p dng cc ton t ti
t hp (recombination operators) ln cc cu trc d liu sao cho c th g
i c
cc thng tin chnh. Gii thut di truyn thng c xem nh nhng b ti u hm
s mc d chng c th c p dng vo nhiu lnh vc rng hn.
Mt ci t ca gii thut di truyn bt u vi mt qun th cc nhim sc th
(thng c to ngu nhin). Ngi ta nh gi cc cu trc ny v phn b c hi
ti sinh cho chng theo cch nhng nhim sc th biu din nghim tt hn ca bi
ton s c u tin hn cc nhim sc th khc ti sinh. Mc tt ca mt
nghim thng c xc nh t ng ng vi qun th hin thi.
M t ca gii thut di truyn nh trn l kh tru tng v c hai cch hiu v
thut ng gii thut di truyn. Theo ngha cht, gii thut di truyn c coi l
mt m hnh tnh ton do Holland xut v nghin cu t nm 1975. Hu ht cc
l thuyt v gii thut di truyn ang tn ti cho n hin nay u dng thut ng
theo ngha ny v khi m hnh c gi l gii thut di truyn chnh tc.
Theo ngha rng hn, gii thut di truyn c coi l bt c mt m hnh
no da
trn qun th (population-based model) no c s dng cc ton t ti t hp v la
chn sinh ra cc im mu mi trong khng gian tm kim. Nhiu m hnh gii
thut di truyn c cc nh nghin cu thc nghim a ra trn quan im
hng ng dng v xem gii thut di truyn nh cng c ti u ha.
Trong mc ny, chng ta s trnh by nhng khi nim c bn lin quan ti gii
thut di truyn.
Trong hu ht cc gii thut di truyn thng thng c hai thnh phn ph thuc
vo bi ton: m ha bi ton v hm nh gi.
Bc u tin trong bt k mt gii thut di truyn no l bc to sinh qun th
xut pht. Trong gii thut di truyn chnh tc, mi thnh vin ca qun th ny l
mt chui nh phn di l tng ng vi m ha nghim ca bi ton. Mi chui
21
nh vy c xem nh mt nhim sc th. Trong hu ht cc trng hp, qun th
ny c sinh ra mt cch ngu nhin. Sau khi sinh ra qun th xut pht, mi c
th ca qun th c nh gi v c gn cho mt gi tr thch nghi (fitness
value).
Khi nimnh gi (evaluation) v thch nghi (fitness) i khi c s dng nh
cp t ng ngha. Tuy nhin, ngi ta
thng phn bit gia hm nh gi
(evaluation function) v hm thch nghi (fitness function) c s dng trong cc
gii thut di truyn. Trong mc ny, hmnh gi (hay hm mc tiu) cung cp
o hiu qu ca vic thit lp gi tr cc tham s c th. Hm thch nghi bin i
o hiu qu ny thnh vic phn b c hi ti to cho cc c th. Vic nh gi mt
chui biu din tp cc tham s l hon ton c lp vi vic nh gi cc chui
khc. Tuy nhin, mc thch nghi (fitness) ca mt chui lun lun c xc nh
trong mi tng quan vi cc thnh vin khc trong qun th hin ti.
Trong gii thut di truyn, mc thch nghi c th c xc nh bng /
i
f f
vi
i
f l nh gi ca chui i v f l nh gi trung bnh ca tt c cc chui trong
qun th. Mc thch nghi cng c th c gn da trn
th hng ca c th
trong qun th hoc bng cc phng php ly mu nh phng php la chn theo
u loi.
Vic thc hin gii thut di truyn c th c xem nh mt qu trnh hai giai
on. Thut ton bt u vi qun th hin thi. Vic la chn c
p dng vo
qun th ny to ra mt qun th trung gian. Sau vic lai ghp v t bin
c p dng cho qun th trung gian to nn qun th tip theo. Qu trnh
chuyn t qun th hin thi ti qun th tip theo to nn mt th h trong tin
trnh thc hin gii thut di truyn. Cch thc hin nh vy c gi l ci t ca
gii thut di truyn n gin (Simple Genetic Algorithm SGA). Hnh 1.3 minh
ha vic hnh thnh mt th h mi theo hai pha: pha chn lc v pha ti t hp.
Vic t bin c th thc hin ngay sau lai ghp.
22
Hnh 1-3 Mt th h mi c hnh thnh
qua pha chn lc v pha ti t hp.
u tin chng ta xem xt vic xy dng qun th trung gian t qun th hin
thi. Trong th h u tin, qun th hin thi cng ng thi l qun th xut pht.
Sau khi tnh /
i
f f cho tt c cc chui trong qun th hin thi, chng ta thc hin
vic la chn. Trong gii thut di truyn chnh tc, xc sut mt chui trong
qun th hin thi c sao chp li v c a vo th h trung gian t l thun
vi mc thch nghi ca chng.
C nhiu cch thc hin vic la chn. Chng ta c th nh x qun th ln mt
bnh xe roulette, mi c th chim mt khng gian t l thun vi mc thch
nghi ca n trn bnh xe. Qun th trung gian c to nn nh vic quay lin tip
bnh xe chn ra cc c th theo c ch ly mu ngu nhin c thay th
(stochastic sampling with replacement). C ch la chn nh vy c gi l la
chn t l (proportional selection) v xc sut mt phn t b c la chn xc
nh bi cng thc sau:

=
> =
n
i
i
b f b f b p
1
0 )) ( / ) ( ( ) (
Ti t hp
(Lai ghp, t bin)
Chn lc
(Nhn i)
Chui 1
Chui 2
Chui 3
Chui 4

Th h hin ti
t
Chui 1
Chui 2
Chui 2
Chui 4

Th h trung gian
t
Con-A (1 x 2)
Con-B (2 x 1)
Con-A (2 x 4)
Con-B (2 x 4)

Th h tip theo
t+1
23
vi b v cc
i
b l cc c th nm trong qun th hin ti.
Qu trnh la chn cng c th thc hin bng c ch remainder stochastic
sampling. Khi mi chui i vi /
i
f f ln hn 1 s c sao chp vo qun th
trung gian vi s ln bng phn nguyn ca /
i
f f . Sau tt c cc chui (k c
cc chui c /
i
f f nh hn 1) s c sao chp thm vo qun th trung gian vi
xc sut t l thun vi phn thp phn ca chng.
Sau khi la chn, vic ti t hp c thc hin trn qun th trung gian. Vic
ny c th
c coi nh vic to ra qun th tip theo t qun th trung gian. Vic
lai ghp (crossover) c p dng cho cc chui c ghp cp mt cch ngu
nhin vi xc sut p
c
: Ly ra mt cp chui; ti t hp hai chui ny vi xc sut p
c
to nn hai chui mi v t chng vo qun th tip theo.
Bc tip theo l vic p dng ton t t bin (mutation operator). Mi bit trong
qun th c th chu hin tng t bin vi xc sut p
m
. Thng thng, tn xut
t bin c thc hin vi xc sut nh hn 1%. Trong mt s trng hp, t
bin c gii thch nh vic to ngu nhin mt bit mi. Trong cc trng hp
khc, t bin c xem l php lt bit. S khc nhau gia hai cch gii thch thc
cht ch l chi tit ci t v mi kiu t bin u c th chuyn i nhn c
kiu cn li.
Khi qu trnh la chn, ti t hp v t bin hon thnh, qun th tip theo li
c a vo chu trnh lp vi cc bc nh trn. Nh vy mt th h mi c
sinh ra khi thc hin gii thut di truyn.
Gii thut di truyn nh m t trn c th c vit di dng gi m nh sau:
24
GII THUT DI TRUYN
Khi to qun th ban u
, ;
1
,...,
k
X x x =
While (iu kin kt thc cha tha mn) do
nh gi mc thch nghi ca cc c th trong X (evaluation)
La chn mt s cp nghim (gi l cha-m)
2
P X e da trn mc
thch nghi ca chng (Parent selection)
T hp cc cp c la chn sinh ra cc c th mi (crossover)
Bin i ngu nhin mt s c th (mutation)
To qun th mi bng vic thay th mt s hoc ton b c th ca X
bi cc c th mi c sinh ra da trn mc thch nghi ca chng
(population selection)
End while
c nhiu cng trnh nghin cu nhm m hnh ha ton hc gii thut di
truyn, cc nh hng ca cc ton t di truyn ln hnh vi ca gii thut, c bit
l hnh vi hi t ti nghim ti u. Cc kt qu l thuyt c ngha nht theo
hng ny c tng kt mt cch c ng trong cng trnh ca Rudolph [ 45]: Vic
m hnh ha gii thut di truyn bng mt xch Markov hu hn trn khng gian
cc trng thi l tp tt c cc qun th c th c sinh ra trong qu trnh thc hin
ca gii thut v cc ton t di truyn l cc ma trn chuyn trng thi c xc
nh bi cc tham s nh xc xut t bin
p
m
, xc sut la chn cha-m p
c
Trn
c s m hnh ha gii thut di truyn nh vy, ngi ta tin hnh phn tch
hnh vi ca gii thut bng vic ch ra rng vi xc sut t bin
p
m
>0 gii thut di
truyn chnh tc l mt xch Markov ergodic v v vy phn phi xc sut ti hn
ca mi trng thi trong khng gian trng thi l dng cht. iu c ngha rng
,
xut pht t mt trng thi ban u bt k, ti mi thi im, gii thut c th ri
vo trng thi tng ng vi qun th khng cha nghim ti u vi
mt xc sut
dng. Ni cch khc, gii thut khng hi t hon ton. khc phc nhc im
25
trn ca gii thut di truyn chnh tc, ngi ta ci bin gii thut bng cch
thm vo mt ton t sao chp (copy operator) cho php c th c thch nghi
cao
nht ca tng qun th c gi li cho qun th tip theo. Phin bn ci bin nh
vy c gi l gii thut di truyn chnh tc vi phn t tinh hoa v c chng
minh l hi t hon ton. Cc kt qu chi tit nghin cu v tnh hi t ca thut
ton di truyn c th tham kho ti [41,45,46].
1.3. Kt lun
Chng ny tp trung gii thiu hai vn chnh lm c s cho vic trnh by
cc ni dung ca Chng 2
.
1. Bi ton ct vt t mt chiu vi mt loi nguyn liu OneDCSP_S v hai
m hnh cng gii thut gii chnh xc cho bi ton: m hnh ca Gilmore
Gomory v m hnh Arc-Flow ca Carvalho. Cc gii thut u c xy
dng da trn vic nhng k thut to sinh ct vo lc nhnh cn B&B
to nn lc phn nhnh v nh gi B&P, y l mt phng php
hiu qu gii cc bi ton quy hoch nguyn c ln.
2. Phn tip theo ca chng dnh cho vic trnh by nhng khi nim c bn
v gii thut di truyn: m ha nghim ca bi ton, cc ton t di truyn v
cc s thut ton di truyn. Tnh hi t ca gii thut di truyn chnh tc
v bin th ca n c tm tt cui chng da trn kt qu nghin cu
ca Ruldoph [45].
26
Chng 2. BI TON CT VT T MT CHIU VI NHIU KCH
THC VT LIU TH: M HNH V GII PHP
Chng ny trnh by ni dung lin quan n bi ton OneDCSP_M. Phn u
ca chng gii thiu pht biu bi ton
OneDCSP_M ca Gilmore v Gomory.
Trn c s phn tch mi lin quan gia bi ton OneDCSP_S v bi ton
OneDCSP_M, tc gi a ra pht biu mi ca bi ton
OneDCSP_M trong phn
th hai. Gii thut di truyn lai ghp vi k thut phn nhnh v nh gi to nn
thut ton GA-AF gii quyt bi ton. V mt l thuyt, thut ton GA-AF c
chng minh m bo tnh hi t hu chc chn. Nhng ni dung ny c cp
trong phn ba ca chng. Phn th t trnh by hiu qu thc nghim ca thut
ton.
2.1. Pht biu bi ton ct vt t mt chiu vi nhiu kch thc vt
liu th theo Gilmore v Gomory
Bi ton ct vt t mt chiu vi nhiu kch thc vt liu th (
One-Dimensional
Cutting Stock Problem with Multiple Stock Sizes OneDCSP_M) l m rng t
nhin ca bi ton OneDCSP, trong cc tm vt liu th c th c kch thc
khc nhau. Bi ton OneDCSP_M c th c biu din bng cc d liu sau:
(m,M,l=(l
1
,,l
m
), b=(b
1
,,b
m
),L=(L
1
,,L
M
), c=(c
1
,,c
M
))
trong :
- m l s dng vt liu thnh phm,
- M l s cc loi vt liu th s c s dng,
- Vi mi dng vt liu thnh phm j:
- l
j
l chiu rng thnh phm
- b
j
l n hng cho loi vt liu thnh phm th j
- Vc t L=( L
1
,,L
M
), vi L
i
l b rng loi vt liu th th i,
27
- c
i
l n gi ca vt liu th th i, i=1,,M.
Trong bi ny ta gi thit rng n gi ca vt liu th t l thun vi chiu
rng ca vt liu.
Hnh 2.1 minh ha cc lt ct trong mi phng n ct vi nhng loi vt liu
th khc nhau ca bi ton OneDCSP_M.
Hnh 2-1 Cc phng n ct trong bi ton OneDCSP_M
M hnh ca bi ton trn (Machine Balance Model) c Gilmore v Gomory
xy dng trong [27]. M hnh c th c pht biu nh sau:
t m=m+M. Mt vc t
,
'
1 '
,...,
m
m
a a a
+
= e l biu din ca mt phng n ct
nu
1 1
m M
j j j j m
j j
l a L a
+
= =
s

v
1
1
M
j m
j
a
+
=
=

(2.1)
Cc thnh phn a
j
, j=1,,m ca vc t
a xc nh c bao nhiu vt t thnh
phm loi j c ct. Thnh phn
m k
a
+
s bng 1 nu loi vt liu th th k c s
dng cn cc thnh phn a
j+m
vi j{1,,M}\k bng 0.
L
i
l
i
Phng n ct j
a
ij
L
1
l
i
L
M
. . .
. . .
. . .
28
Gi n l s lng tt c cc phng n ct. Gi s a
i
vi i=1,,n l tt c cc
phng n ct v mi thnh phn x
i
ca vc t
x=(x
1
,,x
n
) l s ln s dng
phng n ct a
i
. Ta nhn xt rng, n c th rt ln. Ta xy dng mt vc t n chiu
c t c theo cch sau. Nu phng n ct
a
i
c thc hin trn tm vt liu loi k
th
k i
c c =
'
, i=1,,n v k=1,,M. Khi ta c m hnh:
OneDCSP_M(m,M,l,b,L,c) = min cx (2.2)
trn min rng buc:
j i
n
i
ij
b x a >

=1
, j=1,,m (2.3)
) (
1 1
m j i
M
j
j
m
j
ij j
a L a l
+
= =

s i=1,,n (2.4)
1
1
) (
=

=
+
M
j
m j i
a i=1,,n (2.5)
n
x
+
e (2.6)
' m
i
a
+
e i=1,,n (2.7)
Trong m hnh trn, a
ij
(i=1,,n; j=1,,m) l s lng thnh phm th j c ct
theo phng n th i.
2.2. Pht biu mi ca bi ton OneDCSP_M
Trong mc ny chng ta s tin hnh phn tch mi quan h ng ngha gia hai
bi ton OneDCSP_S v OneDCSP_M v a ra mt cch pht biu mi cho bi
ton OneDCSP_M.
nh l 2.1. [2] OneDCSP_M(m,M,l,b,L,c) OneDCSP_S(m,L
k
,l,b)c
k
vi mi
ke{1,,M}. Ni cch khc, bi ton ct vt t vi nhiu kch thc vt liu
th s tt hn vic ct ch trn mt loi vt liu.
Chng minh
29
Do gi thit gi ca vt t t l thun vi b rng ca nguyn liu nn
gi tr hm mc tiu ch ph thuc vo cc phng n ct. Cc phng n ct
ti u cho (1.2) -(1.4) tha mn (1.1) i vi ch s k no th cng tha
mn (2.4) v do vy chng tr thnh phng n chp nhn c
ca (2.2)-
(2.7). iu ny chng minh khng nh ca nh l.
nh l 2.1 khng nh ngha ca vic xy dng cc gii php cho bi ton ct
vt t vi nhiu kch thc vt liu th.
Gi s x* l nghim ti u ca (2.2)-(2.7). Ta k hiu:
- O(k), k=1,,M, l tp tt c cc phng n ct trn vt liu th th k c
s dng trong (2.2)-(2.7) tng ng x
*
;
- x
*
/O(k) l thu hp ca x
*
trn O(k);
- b
k
l vc t vt t thnh phm nhn c t (2.2)-(2.7) vi vic s dng s
ln ct theo cc phng n ct trong O(k) c xc nh bng cc thnh
phn tng ng ca x
*
/O(k).
nh l 2.2. [2] Nu x
*
l nghim ti u ca bi ton
OneDCSP_M(m,M,l,b,L,c)
(2.2)-(2.7) th x
*
/O(k) l nghim ti u ca bi ton
) , , , ( _
k
k
b l L m S OneDCSP
(1.1)-(1.4), k=1,,M.
Chng minh
Gi s x* l nghim ti u ca (2.2)-(2.7). R rng rng, nu ta khi to
bi ton (1.1)-(1.4) vi cc phng n ct c xc nh trong
) (k O th
) ( / * k x O chnh l mt nghim chp nhn c ca ) , , , ( _
k
k
b l L m S OneDCSP .
V vy ta c ) ( / * ) , , , ( _ k x b l L m S OneDCSP
k
k
O s . Ta cn ch ra trong
trng hp ny thc s xy ra du ng thc.
Gi s ) ( / * k x O khng phi l nghim ti u ca bi ton. Khi tn ti
x l nghim ca n v tha mn:
30
) ( / * ' ) , , , ( _ k x x b l L m S OneDCSP
k
k
O < =
V vic ct nguyn liu th th k hon ton c lp vi vic ct cc
nguyn liu th khc nn nu ta thay tp cc bin ca x
*
nm trong ) ( / * k x O
bng tp cc bin tng ng ca x nhn c tp bin mi x" v a cc
phng n ct to nn x trong bi ton ) , , , ( _
k
k
b l L m S OneDCSP vo (2.3)
v (2.4) th x" chnh l mt nghim chp nhn c ca (2.2)-(2.7). Tuy
nhin gi ca hm mc tiu ca bi ton (2.2)-(2.7) xc nh trn x" s nh
hn gi ca hm mc tiu xc nh trn x
*
. iu ny mu thun vi gi thit
x
*
l nghim ti u ca (2.2)-(2.7). Nh vy ) ( / * k x O l nghim ti u ca
bi ton ) , , , ( _
k
k
b l L m S OneDCSP . nh l c chng minh.
Trn c s ca nh l
2.2, chng ta c th m hnh ha bi ton OneDCSP_M
di dng pht biu mi bi nh l sau.
nh l 2.3. Bi ton OneDCSP_M(m,M,l,b,L,c) tng ng vi bi ton

=
M
k
k
k
k
c b l L m S OneDCSP
1
) , , , ( _ min (2.8)
trn min rng buc:
b b
M
k
k
>

=1
(2.9)
k m
b
+
e (2.10)
Chng minh.
Gi s nghim ti u ca bi ton
OneDCSP_M(m,M,l,b,L,c) l x
*
v cc
vc t nghim ti u ca bi ton (2.8) -(2.10) l b
**k
.
t b*
k
l vc t sn phmc ct trn loi vt liu th
k tng ng vi
) ( / * k x O . Khi ma trn B* c to thnh t cc vc t ct b*
k
s phi
tha mn (2.9)-(2.10) v theo nh l 2.2 ta c :
31
k
M
k
k
k
c b l L m S OneDCSP c L b l M m M OneDCSP ) , , , ( _ ) , , , , , ( _
1
*

=
=
Ni cch khc, nghim ca bi ton OneDCSP_M(m,M,l,b,L,c) l mt
nghim chp nhn c ca bi ton (2.8) -(2.10). T ta c bt ng thc:
k
M
k
k
k
c b l L m S OneDCSP c L b l M m M OneDCSP ) , , , ( _ ) , , , , , ( _
1
* *

=
>
Ngc li, cc vc t nghim ti u
b
**k
ca bi ton (2.8)-(2.10) bo
m p ng yu cu k hoch b. Tc l vic thc hin ct vt t theo
nghim ti u s l nghim chp nhn c ca bi ton
OneDCSP_M(m,M,l,b,L,c). T ta c :
k
M
k
k
k
c b l L m S OneDCSP c L b l M m M OneDCSP ) , , , ( _ ) , , , , , ( _
1
* *

=
s
Hai bt ng thc trn khng nh tnh ng n ca nh l.
nh l 2.4. [2] Nghim ti u ca bi ton (2.8)-(2.10) s xc nh trn tp cc vc
t b
k
tha mn b b
M
k
k
=

=1
. Tp cc vc t b
k
nh vy c gi l phn hoch
ca b. Ni cch khc nghim ti u ca (2.8)-(2.10) c xc nh trn tp
cc phn hoch ca vc t
b.
Chng minh
Gi s cc
k
b tha mn b b
M
k
k
>

=1
. Khi ta c th chn cc vc t
k m
t
+
e tha mn:
k k
b t s k=1,,M; b t
M
k
k
=

=1
. R rng rng nu x
*
l nghim
ti u ca
) , , , ( _
k
k
b l L m S OneDCSP th x* cng l mt nghim chp nhn
c ca bi ton ) , , , ( _
k
k
t l L m S OneDCSP . Do
) , , , ( _ ) , , , ( _
k
k
k
k
b l L m S OneDCSP t l L m S OneDCSP s k=1,,M. Thay cc bt
ng thc ny vo (2.8), nh l c chng minh
.
32
Cc kt qu trn cho php chng ta pht biu li m hnh bi ton OneDCSP_M
thng qua bi ton OneDCSP_S nh sau :
k
M
k
k
k
c b l L m S OneDCSP c L b l M m M OneDCSP ) , , , ( _ min ) , , , , , ( _
1

=
= (2.11)
trn min rng buc:
1
M
k
k
b b
=
=

(2.12)
k m
b
+
e (2.13)
2.3. Gii thut di truyn lai ghp gii bi ton OneDCSP_M
Cc nh l 2.2, 2.3, 2.4 v pht biu mi ca bi ton OneDCSP_M (2.11)-
(2.13) gi cho chng ta tng phn r bi ton
OneDCSP_M thnh cc bi ton
c s l bi ton ) , , , ( _
k
k
b l L m S OneDCSP c th p dng thut ton AF gii n.
Cc nghim ti u ca tng bi ton c s s c kt hp li to nn nghim
chp nhn c ca bi ton OneDCSP_M. Vic tm nghim ti u cho bi ton
OneDCSP_M s l vic tm kim trong khng gian cc phn hoch ca vc t n
hng (2.12)-(2.13) nhng phn hoch bo m ti u (2.11). tng trn l c s
xy dng mt thut ton lai ghp gia gii thut di truyn v thut ton AF
gii bi ton OneDCSP_M.
Sau y chng ta s ln lt hnh thc ha tng trn ngn ng ca gii
thut di truyn v thut ton AF.
Biu din bi ton. Chng ta s dng nhim sc th c cu trc (b
1
,...,b
M
),
k m
b
+
e biu din cc c th (cc im) trong khng gian tm k
im. Mi
qun th l mt tp bao gm mt s c nh cc c th.
o thch nghi. Vi mi c th s=(b
1
,...,b
M
) ta xc nh mc thch nghi
ca c th, f(s), bng cng thc sau:
33

=
=
M
k
k
k
k
c b l L m S OneDCSP
s f
1
) , , , ( _
1
) ( (2.14)
Ton t lai ghp. Gi s ,
M
b b s
1
1
1 1
,..., = v ,
M
b b s
2
1
2 2
,..., = l 2 c th bt k.
Chng ta a ra mt s dng ton t lai ghp sau y
:
Ton t Lai ghp mt im. Gi s k l mt s c la chn ngu nhin,
m k s < 1 . T hai c th trn ta to ra hai hu du
'
1
s v
'
2
s vi cc vc t ct
tng ng ca chng c xc nh nh sau:
j j ; 1 ,..., 1 ,
1
'
1
= = k i i b i b
j j
j j m k i i b i b
j j
,..., ,
2
'
1
= = ; j=1,,M (2.15)
j j 1 ,..., 1 ,
2
'
2
= = k i i b i b
j j
; j j ; ,..., ,
1
'
2
m k i i b i b
j j
= = j=1,,M (2.16)
Ton t lai ghp chn lc. Ton t ny nhm trao i cc thnh phn m ha
khc nhau nht trong biu din ca hai c th.
Chng ta tnh ton khong cch gia cc hng theo cng thc :
j j
1 2 1 2
1
( , )
M
i i
j
i
d s s b j b j
=
=

j=1,...,m (2.17)
Gi s t l tham s lm cc i (2.17), tc l
d
t
(s
1
,s
2
)= max
j=1,..,m
{d
j
(s
1
,s
2
)} (2.18)
Khi ta chn im lai ghp l t v to ra hai hu du
'
1
s v
'
2
s vi cc vc t
ct tng ng ca chng c xc nh nh sau:
j j
'
1 1
, 1,..., , ;
j j
b i b i i m i t = = = j j
'
1 2
,
j j
b t b t = j=1,,M (2.19)
j j
'
2 2
, 1,... ,
j j
b i b i i m i t = = = ; j j
'
2 1
,
j j
b t b t = j=1,,M (2.20)
Ta cng c th m rng ton t lai ghp (2.19)-(2.20) cho php nhiu thnh
phn m ha c trao i gia biu din ca hai c th t heo cch la chn r hng
34
c khong cch ln nht sau khi sp xp cc khong cch (2.18) theo th t gim
dn (1<r<m).
Ton t lai ghp ngu nhin. Ton t ny s la chn im lai ghp t mt cch
ngu nhin theo phn b xc sut c xc nh nh sau
:
,
,
1 2
1 2
1
,
( )
,
t
m
i
i
d s s
p t
d s s
=
=

, t=1,...,m (2.21)
Sau khi chn im lai ghp, ta thc hin vic lai ghp nh trong (2.19)
-
(2.20)
Ton t t bin. Cho c th ,
M
b b s ,...,
1
= .
Ton t t bin a phng . Chn ngu nhin mt b 3 cc s nguyn (p,q,r),
M q p s s , 1 v m r s s 1 , vi xc sut:
2 0
1
mM
p = (2.22)
Ton t t bin a phng tc ng ln c th ,
M
b b s ,...,
1
= to nn c th
,
M
b b s
1
1
1 1
,..., = vi b (p,q,r) chn nh sau:
i i
b b =
1
khi q i p i = = & i=1,,M (2.23)
j j j b j b
p p
=
1
, j j j b j b
q q
=
1
khi j=1,,m v r j = (2.24)
j j 1
1
= r b r b
p p
, j j 1
1
+ = r b r b
q q
nu j 0 > r b
p
(2.25)
j j r b r b
p p
=
1
, j j r b r b
q q
=
1
nu j 0 = r b
p
(2.26)
Ton t t bin phn phi u. Chn ngu nhin mt b 3 cc s nguyn
(p,q,r), M q p s s , 1 v m r s s 1 , vi xc sut c xc nh nh trong (2.22).
t
j j
p q
Q b r b r = + . Khi ta chn ngu nhin mt s t{0,1,...,Q}theo
phn phi u:
, ( ) 1/ 1 p t Q = + (2.27)
35
v ton t t bin phn phi u c xc nh bi cng thc:
j
p
b r t = ; j
q
b r Q t = (2.28)
Ton t chn lc. Ton t chn lc c xc nh theo lut t l thun vi mc
thch nghi:

e
=
G s
s
s f
s f
p
) (
) (
(2.29)
Trong s l c th v G l qun th ang xem xt c cha s.
nh l 2.5. [2] Gi s hai c th cha-m l cc phn hoch ca cng mt vc t.
Khi cc ton t lai ghp v ton t t bin xc nh nh trn s bo m
cc hu du cng l nhng phn hoch ca vc t .
Chng minh
Ta chng minh khng nh ny cho ton t lai
ghp (2.15)-(2.16) v ton
t t bin (2.23) -(2.26). i vi cc ton t khc vic chng minh hon
ton tng t.
Nu ta biu din cc c th di dng bng c kch thc m.M, trong
ct i ca bng cha vc t
b
i
ca c th, i=1,,M. Khi ton t lai ghp s
thc hin vic trao i M-k hng cui cng ca 2 bng tng ng vi 2 phn
t cha-m cho nhau to nn 2 hu du. Cn i vi ton t t bin, hu
du s hoc l bn sao ca cha-m theo (2.23),(2.24)-(2.26), hoc ch thay
i ti hng r theo (2.23),(2.24)-(2.25). V vy tng cc ct ca hu du lun
bng tng cc ct ca cha-m. nh l c chng minh.
Da trn cc nh l 2.1, 2.2, 2.3, 2.4, 2.5 chng ta c th xy dng thut ton lai
ghp nh sau:
THUT TON GA-AF
Input: m, M , l, L, b, c
36
Output: Nghim ti u ca bi ton
OneDCSP_M(m,M,l,b,L,c) v cc phng n
ct tng ng vi nghim ti u
Bc 0. Khi to qun th gm K c th , ;
0 0
1 0
,...,
K
s s G = . Vic khi to ny c th
thc hin d dng bng vic to ra K phn hoch khc nhau ca b, mi
phn hoch s tng ng vi mt i tng ca qun th. Cc c th
c biu din nh sau:
,
0 0
1
0
,...,
iM i i
b b s = ,
0 m
ij
b
+
e ,

=
=
M
j
ij
b b
1
0
, i=1,,K
Bc 1. Gii cc bi ton ) , , , ( _
t
ik k
b l L m S OneDCSP bng thut ton AF,
i=1,,K, k=1,,M, t l th t bc lp (th t ca qun th). Tnh
mc thch nghi
) (
t
i
s f cho tng c th ca G
t
theo (2.14).
Bc 2. La chn cc cha-m trong G
t
theo mc thch nghi ghp cp theo
ton t lai ghp (2.15)-(2.16) to nn tp cc hu th
'
t
G vi K
1
phn
t.
Bc 3. Tc ng ton t t bin (2.23)-(2.26) vo
'
t t
G G nhn c
' '
t
G .
Bc 4. Thc hin tnh ton ging nh trong Bc 1 cho cc c th ca
' '
t
G .
Bc 5. p dng ton t chn lc (2.29) ln
' '
t t
G G chn ra K c th c mc
thch nghi ln nht to qun th mi
1 + t
G .
Bc 6. Nu iu kin dng cha tha mn quay li Bc 2. Ngc li thut
ton dng v cho nghim ti u cng tp cc phng n ct tng ng
vi nghim ti u.
kho st tnh cht ca thut ton GA-AF vi gi thit gi ca vt liu th t l
thun vi chiu rng ca vt liu, ta c th ch ra mt s tnh cht sau.
B 2.6. [2] Nghim ti u ca bi ton OneDCSP_M nm trong khong sau:
37
, ; O b c c L b l M m M OneDCSP c o
m
j
j k k k k
=
)
`

< s =

=1
max ) , , , , , ( _ min (2.30)
V xc sut chn lc tr thnh c th thuc qun th tip theo ca tng c th s tha
mn:
0
/ ) 2 (
/ 1
1
1
> =
+
> p
o K K
O
p
s
(2.31)
Chng minh
Tht vy, trong (2.30) bt ng thc u tin xy ra do c t nht mt loi
vt liu th c a vo sn xut p ng n hng. ng thc s t
c trong trng hp ch cn dng 1 tm vt liu th nh nht l sn
xut. Ni cch khc nu k hiu , ;
k k
L L min
*
= th ng thc xy ra khi tha
mn:

=
>
m
j
j j
b l L
1
*
Bt ng thc th hai l hin nhin khi ta s dng mi vt liu th c
chiu rng ln nht ch ct 1 vt t thnh phm.
Bt ng thc
(2.31) c suy ra trc tip t (2.29), (2.30) v c ch hot
ng ca thut ton GA-AF.
Sau y chng ta s s dng cc k hiu sau:
Partition(b) l tp tt c cc phn hoch ca b thnh M phn hoch;
, ;
t t
G s s f F e = : ) ( max : mc thch nghi ln nht ca qun th
t
G ;
, ; ) ( : ) ( max
*
b Partition s s f F e = : mc thch nghi ln nht ca tt c khng
gian nghim. Mc thch
nghi ln nht ny chnh l nghch o ca
nghim ti u ton cc ca bi ton OneDCSP_M;
, ;
* *
) ( : ) ( F s f b Partition s S = e = : tp tt c cc c th tng ng vi nghim
ti u ton cc ca bi ton OneDCSP_M.
38
Ta nhn xt rng, mi khi
*
F F
t
= th qun th
t
G s cha mt c th biu din
nghim ti u ton cc ca bi ton OneDCSP_M.
nh ngha 2.1. K hiu bin ngu nhin , ;
*
: 0 min F F t F
t
= > = l ln u tin
trong qun th
t
G cha c th biu din nghim ti u ton cc ca bi ton
OneDCSP_M. Khi ta ni rng thut ton GA-AF hi t hu chc chn nu
n t c nghim ti u ton cc trong khong thi gian hu hn vi xc
sut P{F<}=1 khng ph thuc vo qun th khi u.
nh ngha 2.2. Gi s s v s l hai c th khc nhau trong Partition(b). C th s
c gi l c th t c t s nu tn ti mt dy hu hn cc c th
r
s s s ,..., ,
2 1
i mt khc nhau ca Partition(b) sao cho
1
s s = ,
r
s s = ' v
1 + i
s
nhn c t
i
s vi xc sut dng bng vic p dng ton t t bin vo
i
s , i=2,,r.
B 2.7. [2] Mi c th trong Partition(b) u c th t c t c th bt k ca
Partition(b).
Chng minh
Gi s s, s l hai c th khc nhau bt k trong Partition(b). Nu ta biu
din hai c th bng hai ma trn A v A kch thc m.M, ta c th nh
ngha khong cch gia hai c th ny l:

= =
=
m
i
M
j
ij ij
a a s s d
1 1
'
2
1
) ' , (
Do s v s l cc phn hoch khc nhau ca vc t b nn nu ti mt
dng r no ca ma trn A tn ti mt ch s p sao cho
'
rp rp
a a > th cng s
tn ti mt ch s q m ti tha mn
'
rq rq
a a < . Khi ta c th thc hin
php t bin trn b 3 (p,q,r) vi xc sut
0
p vo s nhn c c th mi
s cng l phn t ca Partition(b). Khi d(s,s)=d(s,s)-1. Thc hin ln
tip th tc ny d(s,s) ln ta s nhn c s.
39
Theo gi thit ban u, s v s l hai c th bt k nn B c ch ng
minh.
nh l 2.8. [2] Thut ton GA-AF l hi t hu chc chn.
Chng minh
Gi s s, s l hai c th ca Partition(b) sao cho
*
S s e v
* '
S s e . Theo
B 2.7 , s c th t c t s, tc l tn ti mt nhnh hu hn i t s
n s m mi c th trn nhn c bng vic tc ng ton t t bin
vo c th ng trc n. D dng ch ra rng di ca nhnh ngn nht i
t s ti s bng cc ton t t bin chnh l d(s,s). t
, ;
* ' '
: ) , ( max S s s s d k
s
e = v , ;
*
: max S s k k
s
e = .
Xt mt c th ty s ca mt qun th no . Theo thut ton GA
-AF,
Bc 3 bo m rng c th ny chc chn c tc ng bi ton t t
bin v xc sut nh ca n qua ton t t bin tr thnh im tip theo
trn ng i ngn nht t s n
*
S s khng nh hn
0
p . Theo (2.29) v
c lng (2.31), ta c xc sut mt c th bt k c la chn lm c
th thuc qun th th h sau khng nh hn
1
p . Nh vy xc sut nh
ca s qua php t bin ng thi l im tip theo trn ng i ngn nht
t s ti
*
S v c la chn lm c th ca qun th th h sau s khng nh
hn 0 .
1 0
> p p . Lp lin tip
s
k ln lp lun nh trn, ta thy xc sut chuyn
t
*
S s e vo thnh c th no thuc
*
S ti bc lp th
s
k s khng nh
hn 0 .
1
1 0
>

s s
k k
p p . V vy ta c th nh gi xc sut mt c th ti u ton
cc c xt n trong thut ton sau k vng lp s khng nh hn
0 .
1
1 0
>
k k
p p v khng ph thuc vo s khi u thc s ca
*
S s e . T y
suy ra rng, xc sut thut ton khng xt n bt k mt nghim ti u
no sau t vng lp s ln nht l
,

k t
k k
p p
/
1
1 0
. 1

(2.32)
40
D thy rng i lng trong (2.32) s hi t rt nhanh theo tc ly
tha ti 0 khi t . iu ny c ngha 1 ) ( = < F P (hay l nghim ti u
ton cc c thut ton xt n ln u tin sau hu hn bc lp vi xc
sut bng 1). Do s l c th ty nn nh l c chng minh.
Cc kt qu l thuyt trong mc ny s c dng lm c s cho vic xy dng
h thng a tc t vi tn gi GMAS-OneDCSP_M c trnh by trong Chng 3.
2.4. Kt qu tnh ton
Thut ton GA-AF c t
rin khai ti Nh my ng thp Vit-c. Vic
khai thc phn mm ph thuc vo nhng tc ng sau:
- K hoch sn xut ph thuc hon ton vo th trng tiu th. C nhng
thi im nh my hot ng ba ca, c nhng thi im ch hot ng hai
ca v thm ch hot ng cm chng. V vy k hoch lun thay i cho
ph hp vi bin ng ca th trng.
- Ngun vt liu th cng thng xuyn bin ng. iu ny cng nh
hng ti qu trnh khai thc phn mm. Mi khi c loi vt liu mi
c nhp v, mc d k hoch c (nghim c) cha thc hin xong th
phn tn ti c tnh vo d bo bin ng th trng c k hoch
mi v lp li vic khai thc phn mm vi cc tham s c thit lp ph
hp nn cc k hoch lun c s gi u v chng ln ln nhau. Chnh v
vy, vic thu thp d liu chnh xc nh gi hiu qu ca GA
-AF gp
nhiu kh khn (s giao nhau gia cc k hoch v tham s u vo ca
thut ton).
- Cng trong qu trnh quan st thc t sn xut tc gi c nhn thy rng,
cc loi sn phm p ng yu cu th trng ca nh my kh n nh (t
chng loi) nn d liu c c cng rt n iu, kh phn nh mt cch
khch quan cc kha cnh khc nhau ca thut ton.
41
Tuy nhin, kt qu phn nh chung nht t nh sn xut l t khi khai thc phn
mm ny, lng ph thi gim i mt cch ng k
[1]. Sau mt nm
s dng phn
mm, s liu thng k chung cho thy:
- Lng ph liu trn tng khi lng thp thnh phm gim t 3% xung
cn 1%.
- Tng sn phm tn kho tng k trn tng sn phm c sn xut t
heo k
hoch nh k gim t 9% xung cn 4%.
Vi nng lc sn xut ca nh my ti thi im trin khai th nghim l
70.000 tn/nm, khi lng vt t tit kim c khong hn 1000 tn.
Theo phn loi ca Waescher [57], cc bi ton OneDCSP_M c phn lm hai
lp. Lp u tin chnh l bi ton t ra cho Lun n v c gi l lp
OneDCSP_M vi s lng vt liu th khng hn ch (unlimited stock quantity).
Lp th hai l lp cc bi ton nhn c t lp th nht vi vic b sung rng
buc v s lng vt liu th ca mi loi v c gi l lp bi ton OneDCSP_M
vi s lng vt liu th hn ch (limited stock quantity).
Theo s hiu bit ca tc gi, cho ti thi im hin ti cha c cng trnh
nghin cu thc nghim no v bi ton ca lp th nht c cng b [
14].
i vi lp bi ton th hai cng c rt t cng trnh cp n. Belov v
Scheithauer [11] m rng thut ton mt phng ct cho trng hp mt loi vt
liu th gii bi ton OneDCSP_M vi s lng vt liu th hn ch. Alves v
Carvalho [56] xy dng m hnh Arc-flow gii quyt chnh xc bi ton thuc
lp hai. Mi y nht, Silvio A. Araujo v ng s [ 48] xut gii php heuristic
trn c s thut ton tin ha (Evolutionary Algorithm) cho lp bi ton ny ng
thi tin hnh nghin cu so snh cc kt qu t c vi kt qu ca Belov v
Scheithauer [11].
Nh phn tch trn, bi ton t ra trong Lun n c im khc bit vi cc
bi ton do cc tc gi trn gii quyt bi s c mt hoc khng c mt ca rng
42
buc v s lng vt liu th. Do vic nghin cu so snh gia xut ca tc
gi Lun n vi nhng kt qu trn s khng phn nh c y cc u, nhc
im gia cc gii php.
Tuy nhin, c mt nh gi ban u v hiu qu ca phng php
c
xut trong Lun n, tc gi tin hnh la chn cc tham s chung gia hai bi
ton v th nghim phng php ca mnh trn cc d liu c lc ra theo cc
tham s ny t cc bi ton c Belov v Scheithauer cng b ti a ch:
http://www.math.tu-dresden.de/~capad
D liu ny gm 3100 bi ton c to sinh mt cch ngu nhin v chia lm
31 nhm, mi nhm 100 bi ton. Sau khi loi b cc rng buc v s lng vt liu
th, cc bi ton tr thnh cc bi ton thuc lp th nht vi cc tham s c trng
sau y:
- S loi vt liu th M=5
- S loi sn phm m=40
- Kch thc tng loi vt liu th: L
1
=10000, L
i
thuc tp
{5000,5100,,9900} i=2,5
- Gi ca tng loi vt liu th c
i
=L
i
, i=1,,5
- Kch thc sn phm l
i
c sinh ngu nhin v nm trong khong
[v
1
L
max
,v
2
L
max
], vi L
max
=max{L
i
}, i=1,,M; v
1
={0.001; 0.01; 0.15; 0.25}
v v
2
={0.2; 0.3;;0.9}
- Yu cu i vi mi loi sn phm: b
i
, i=1,,M c sinh ngu nhin v
nm trong khong [200,300]
Nhn xt. Vi cch to d liu mu nh vy, nghim ti u ca cc bi ton
nhn c l hon ton cha bit. Tuy nhin c mt nhn xt rng, cc nghim ti
u ca bi ton c Belov gii quyt lun l nghim chp nhn c ca bi ton
tng ng t ra trong Lun n. Bi vy, ta hon ton c th coi nghim ti u ca
43
Belov l nghim tt nht c bit ti cho n thi im hin ti i vi cc bi
ton tng ng ca Lun n. T c th nh gi cht lng ca gii thut,
chng ta s tin hnh s dng n gii cc bi ton trn b d tham s chung gia
hai bi ton v so snh cc kt qu nhn c vi cc nghim tt nht ca
Belov-Scheithauer [11] v kt qu xp x ca Silvio A. Araujo v ng s.
c th nh gi cht lng nghim cng nh hi
u qu v thi gian ca thut
ton GA-AF, tc gi tin hnh chy th nghim trn ton b s liu c lc ra
t 31 lp vi cc tham s c la chn nh sau:
- Kch thc qun th: 10
- Tiu chun dng: sau 1500 vng lp hoc c 10 vng lp lin tip cho gi
tr hm mc tiu nh nhau
- Hm mc tiu: chnh l hm mc tiu ca bi ton OneDCSP_M()
Cc tiu ch nh gi bao gm:
- Cht lng nghim c tnh bng lch ca nghim t thut ton GA -
AF v nghim ca Belov v Scheithauer theo cng thc do Silvio A.
Araujo v ng s a ra:
( _ ) ( & )
100
&
GA AF solution Belov Scheithauer solution
GAP
Belov Scheithauer solution

=
- Thi gian: thi gian ti thiu, thi gian trung bnh v thi gian ti a
gii tng lp bi ton.
V cht lng nghim:
- Cht lng nghim ca thut ton GA-AF c tng kt trong bng 2.1
[42] v bng 2.3. Bng 2.1 m t lch trung bnh, nh nht v ln nht
ca tng lp bi ton v lch trung bnh chung, lch nh nht v ln
nht ca 31 lp. lch trung bnh chung ca 31 lp bi ton l
-0.06%,
lch ti a l 2.05% v ti thiu l -6.18% [42]. Trong rt nhiu bi
ton thuc cc lp bi ton nh lp bi ton C7, C14, C16, C22
-C25,
44
C26-C31 nghim nhn c ca Lun n tt hn nghim ca Belov -
Scheithauer v nh vy cng tt hn nghim ca Silvio A. Araujo v ng
s. iu ny khng nh nhn xt ca chng ta trn l nghim ca
Belov-Scheithauer lun l nghim chp nhn c ca bi ton tng ng
thuc lp th nht. Cng ti cc lp ny nghim ca cc bi ton cn li
cng rt gn vi nghim ca Belov-Scheithauer v tt hn hn nghim
ca Silvio A. Araujo v ng s.
GAP GAP
Lp v1 v2
Trung
bnh
Nh
nht
Ln
nht
Lp v1 v2
Trung
bnh
Nh
nht
Ln
nht
C1 0.001 0.2 1.18 0.70 1.88 C17 0.15 0.2 0.35 0.14 0.60
C2 0.001 0.3 0.61 0.23 1.04 C18 0.15 0.3 0.25 0.10 0.40
C3 0.001 0.4 0.35 0.10 0.62 C19 0.15 0.4 0.14 0.07 0.27
C4 0.001 0.5 0.17 0.05 0.43 C20 0.15 0.5 0.10 -0.23 0.19
C5 0.001 0.6 0.10 -2.02 0.37 C21 0.15 0.6 0.05 -0.17 0.16
C6 0.001 0.7 0.08 -0.07 0.29 C22 0.15 0.7 -0.07 -2.60 0.15
C7 0.001 0.8 -0.01 -6.00 0.14 C23 0.15 0.8 -0.23 -3.18 0.07
C8 0.001 0.9 0.04 -1.76 0.20 C24 0.15 0.9 -0.32 -2.76 0.10
C9 0.01 0.2 1.14 0.73 2.05 C25 0.25 0.3 -0.96 -5.80 0.48
C10 0.01 0.3 0.59 0.30 1.04 C26 0.25 0.4 0.01 -3.08 0.18
C11 0.01 0.4 0.32 0.10 0.64 C27 0.25 0.5 -0.03 -5.15 0.22
C12 0.01 0.5 0.18 0.06 0.45 C28 0.25 0.6 -0.11 -1.85 0.16
C13 0.01 0.6 0.12 0.02 0.32 C29 0.25 0.7 -0.36 -1.98 0.05
C14 0.01 0.7 -0.02 -5.01 0.41 C30 0.25 0.8 -0.48 -3.45 0.05
C15 0.01 0.8 0.03 -1.22 0.27 C31 0.25 0.9 -0.82 -6.18 0.02
C16 0.01 0.9 -0.14 -5.74 0.15 -0.06 -6.18 2.05
Bng 2.1 Tng kt cht lng nghim so vi kt qu ca Belov
-Scheithauer[42]
45
- Ti cc lp cn li kt qu t c cng rt gn vi kt qu ca Belov
-
Scheithauer vi lnh nh nht xp x 0.01% v lch ln nht xp x
2.05%. Kt qu ny tt hn hn nghim ca Silvio A. Araujo v ng s
vi cc lch tng ng l 0.17% v 2.37%.
Bng 2.2 trch dn kt qu tnh ton so snh ca Silvio A. Araujo v ng s vi
kt qu tnh ca Belov theo [48].
GAP GAP
Lp v2 v2
1500
vng lp
3000
vng lp
Lp v1 v2
1500
vng lp
3000
vng lp
C1 0.001 0.2 0.175285 0.162389 C17 1.5 0.2 1.660874 1.647265
C2 0.001 0.3 0.338222 0.334772 C18 1.5 0.3 1.204246 1.157270
C3 0.001 0.4 0.501230 0.485200 C19 1.5 0.4 1.157579 1.145566
C4 0.001 0.5 0.785177 0.723195 C20 1.5 0.5 1.481326 1.351702
C5 0.001 0.6 0.986865 0.888302 C21 1.5 0.6 1.431382 1.365700
C6 0.001 0.7 1.330716 1.163220 C22 1.5 0.7 1.684004 1.513348
C7 0.001 0.8 1.843849 1.640934 C23 1.5 0.8 2.254709 1.799656
C8 0.001 0.9 1.362868 1.003978 C24 1.5 0.9 1.904421 1.660200
C9 0.01 0.2 0.221194 0.220295 C25 2.5 0.3 1.213631 1.162781
C10 0.01 0.3 0.366215 0.356794 C26 2.5 0.4 2.375498 2.220528
C11 0.01 0.4 0.553312 0.541084 C27 2.5 0.5 2.164348 2.013975
C12 0.01 0.5 0.779770 0.758054 C28 2.5 0.6 1.535495 1.373492
C13 0.01 0.6 1.044311 0.938163 C29 2.5 0.7 2.044762 1.730710
C14 0.01 0.7 1.317463 1.192335 C30 2.5 0.8 2.138915 0.735370
C15 0.01 0.8 1.869427 1.598234 C31 2.5 0.9 1.553659 1.314085
C16 0.01 0.9 1.283639 1.019884 Trung bnh ------------ 1.308529 1.13608
Bng 2.2 Kt qu tnh ton ca Silvio A. Araujo v ng s
- Bng 2.3 thng k trn mi lp s lng bi ton c chnh lch so vi
nghim ca Belov v Scheithauer l nh hn 0%, t 0% n 1%, t 1%
n 2%, t 2%n 3% v ln hn 3%. Kt qu cho thy s lng bi ton
c nghim tt hn ( lch m) l hn 17%, trong s cc bi ton c
lch dng, s lng tp trung nhiu nht trong khong t 1% n 2%
(chim hn 77%). Ch c 1 bi ton nghim c lch ln hn 2%.
46
Lp <0% 0%-1% 1%-2% 2%-3% >3%
C1 0 21 79 0 0
C2 0 99 1 0 0
C3 0 100 0 0 0
C4 0 100 0 0 0
C5 1 99 0 0 0
C6 5 95 0 0 0
C7 7 93 0 0 0
C8 9 91 0 0 0
C9 0 28 71 1 0
C10 0 98 2 0 0
C11 0 100 0 0 0
C12 0 100 0 0 0
C13 0 100 0 0 0
C14 10 90 0 0 0
C15 12 88 0 0 0
C16 12 88 0 0 0
C17 0 100 0 0 0
C18 0 100 0 0 0
C19 0 100 0 0 0
C20 1 99 0 0 0
C21 12 88 0 0 0
C22 27 73 0 0 0
C23 53 47 0 0 0
C24 57 43 0 0 0
C25 67 33 0 0 0
C26 12 88 0 0 0
C27 13 87 0 0 0
C28 26 74 0 0 0
C29 65 35 0 0 0
C30 74 26 0 0 0
C31 74 26 0 0 0
Tng 537 2409 153 1 0
Trung bnh 17.32% 77.71% 4.94% 0.03% 0.00%
Bng 2.3 Phn b chnh lch nghim so vi kt qu ca Belov-Scheithauer
47
<0%
0%-1%
1%-2%
<0%
0%-1%
1%-2%
17,32%
77,71%
4,94%
Hnh 2-2 Biu thng k chnh lch so vi kt qu ca Belov -Scheithauer
V thi gian:
Thut ton GA-AF ca tc gi c ci t chy trn my tnh Core 2 Duo
(1.5GHz/1.5GHz) v 1GB RAM.
Bng 2.4 v bng 2.5 tng hp thi gian tnh ton trn 31 lp bi ton. Thng k
kt qu t c trong Lun n cho thy:
- Khong 45% tng s bi ton c gii trong vng 30 giy.
- Thi gian ti thiu: 1 giy
- Thi gian trung bnh: 1 pht 6 giy
- Thi gian ti a:
6 pht 39 giy
48
Thi gian Thi gian
Lp
Trung
bnh
Nh
nht
Ln
nht
Lp
Trung
bnh
Nh
nht
Ln
nht
C1 00:01:17 00:00:33 00:03:18 C17 00:00:29 00:00:13 00:01:03
C2 00:01:50 00:00:43 00:06:06 C18 00:00:31 00:00:19 00:01:25
C3 00:02:08 00:00:47 00:06:25 C19 00:00:35 00:00:18 00:01:24
C4 00:02:17 00:00:41 00:06:37 C20 00:00:28 00:00:13 00:00:59
C5 00:01:42 00:00:24 00:06:35 C21 00:00:21 00:00:11 00:01:34
C6 00:01:25 00:00:14 00:05:32 C22 00:00:13 00:00:07 00:00:24
C7 00:01:04 00:00:04 00:06:39 C23 00:00:10 00:00:05 00:00:21
C8 00:00:52 00:00:08 00:02:01 C24 00:00:12 00:00:04 00:02:01
C9 00:02:03 00:01:07 00:03:54 C25 00:00:18 00:00:01 00:00:52
C10 00:02:53 00:01:15 00:06:24 C26 00:00:36 00:00:13 00:01:30
C11 00:03:25 00:01:19 00:06:06 C27 00:00:21 00:00:07 00:00:44
C12 00:03:34 00:01:53 00:06:18 C28 00:00:19 00:00:09 00:00:33
C13 00:01:24 00:00:27 00:04:36 C29 00:00:12 00:00:06 00:00:18
C14 00:01:02 00:00:21 00:04:16 C30 00:00:10 00:00:06 00:00:15
C15 00:00:54 00:00:12 00:05:12 C31 00:00:08 00:00:04 00:00:12
C16 00:01:02 00:00:08 00:05:50 00:01:06 00:00:01 00:06:39
Bng 2.4 Thng k thi gian tnh ton
49
Lp <10s 11s-30s 31s-60s 1'-2' 2'-3' 3'-4' 4'-5' >5'
C1 0 0 44 43 12 1 0 0
C2 0 0 16 48 27 6 1 2
C3 0 0 6 50 23 17 2 2
C4 0 0 6 48 24 12 5 5
C5 1 3 24 46 15 5 2 4
C6 0 9 34 35 16 2 2 2
C7 1 22 39 26 7 1 2 2
C8 7 19 43 29 2 0 0 0
C9 0 0 0 54 38 8 0 0
C10 0 0 0 20 42 26 11 1
C11 0 0 0 10 25 37 20 8
C12 0 0 0 1 26 47 22 4
C13 0 1 27 59 9 3 1 0
C14 2 12 51 28 5 0 2 0
C15 1 37 32 21 8 0 0 1
C16 8 32 26 29 3 0 1 1
C17 0 73 25 2 0 0 0 0
C18 0 53 46 1 0 0 0 0
C19 0 34 65 1 0 0 0 0
C20 0 73 27 0 0 0 0 0
C21 0 94 5 1 0 0 0 0
C22 25 75 0 0 0 0 0 0
C23 56 44 0 0 0 0 0 0
C24 81 19 0 0 0 0 0 0
C25 28 57 15 0 0 0 0 0
C26 0 28 69 3 0 0 0 0
C27 2 93 5 0 0 0 0 0
C28 2 97 1 0 0 0 0 0
C29 22 78 0 0 0 0 0 0
C30 72 28 0 0 0 0 0 0
C31 93 7 0 0 0 0 0 0
Tng 401 988 606 555 282 165 71 32
Trung bnh 13% 32% 20% 18% 9% 5% 2% 1%
Bng 2.5 Thng k phn b thi gian tnh ton
50
<10s
11s-30s
31s-60s
1'-2'
3'-4'
4'-5'
>5'
2'-3'
<10s
11s-30s
31s-60s
1'-2'
2'-3'
3'-4'
4'-5'
>5'
18%
20%
32%
13%
9%
5%
Hnh 2-3 Biu thng k phn b thi gian tnh ton
Hiu qu v thi gian thc hin ca thut ton xut trong Lun n
nh vy l
chp nhn c.
Tuy nhin, ci thin tc tnh ton ca thut ton, chng ti xut ci t
thut ton di dng mt h a tc t c trnh by trong Chng tip theo.
2.5. Kt lun
Trong chng 2, tc gi ch ra tnh hiu qu ca vic ct trn nhiu loi vt t
so vi ct trn mt loi vt t. Mi lin quan ng ngha ca bi ton OneDCSP_M
so vi bi ton ct vt t kinh in
OneDCSP_S c ch ra trong cc nh l 2.1,
2.2, 2.3, 2.4. T bi ton OneDCSP_M c pht biu li theo cch m hnh ha
mi.
Trn c s mi quan h ng ngha gia hai bi ton OneDCSP_M v
OneDCSP_S, tc gi xut thut ton gii GA-AF trn c s lai ghp gia gii
thut di truyn vi thut ton AF gii bi ton OneDCSP_S ca Carvalho. Thut
ton a ra cch m ha nghim ca bi ton v xy dng cc ton t di truyn
51
ng trn phn hoch ca vc t k hoch sn phm. Tnh ng n ca thut ton
mi c trnh by trong cc nh l
2.5 v 2.8.
Thut ton GA-AF c ci t, chy th nghim v so snh vi cc kt qu ca
cc tc gi khc c xem nh nghim tt nht ca bi ton c c cho n nay
trn mt s lng ng k cc bi ton mu. Cc so snh bc u cho thy tnh
hiu qu ca thut ton.
52
Chng 3. H THNG A TC T GMAS-OneDCSP_M GII BI
TON OneDCSP_M .
T cui th k trc, cc nh nghin cu tr tu nhn to xut xy dng cc
h thng phn mm cng tc (collaborating software systems) da trn cch tip
cn chia tr. Trong mi h thng, mt s module nh c pht trin mt cch
c lp v kt hp vi nhau to nn ton b h thng.
Nhng nm gn y
xut hin mt s hng nghin cu cp n ti cc h thng phn mm cng tc
nh cc h thng bng en (Blackboard Systems) [
16, 19, 31], cc h thng a tc
t (Multi-agent Systems), lp trnh theo ngha rng (Programming in the large hay
Megaprogramming), cc h thng i tng phn tn (Dis
tributed-object Systems),
cng ngh phn mm da trn thnh phn (Component-based software
engineering).
Hin nay, hng nghin cu v h a tc t ang thu ht nhiu s quan tm
nhm gii quyt cc dng bi ton ti u phc tp khc nhau [ 8,15,36]. Cc tc t
c coi nh cc modul c mt s c trng ring nh tnh t tr (autonomy), tnh
x hi (social ability), tnh phn ng (reactivity), tnh ch ng (pro-activeness).
Cc tc t lm vic cng tc vi nhau gii bi ton. Nhng nghin cu v cc h
a tc t thng nhn mnh n vic gii quyt cc vn ny sinh t nhng tnh
cht c trng ca tc t nh vn tng tc (interaction), phi hp (cooperation),
iu khin phn tn (distributed control) gia cc tc t trong h thng. Cc gii
php c a ra thng m phng cc hnh vi ca m ng v c gi chung l
cc thut ton da trn qun th (Population-Based Algorithms).
gii quyt cc vn nu trn, Talukdar v cng s xut mt kin trc
c s cho php xy dng cc h thng trong mt nhm cc tc t t tr hot ng
mt cch song song, khng ng b trong khun kh cng tc vi nhau gii cc
bi ton ti u vi tn gi A-Teams (Asynchronous Teams) [49,50]. Trong kin
trc c s ny, mi tc t s m trch mt s k n
ng no trong vic gii quyt
53
bi ton ton cc v hot ng hon ton c lp vi cc tc t khc. Kin trc in
hnh ca A-Team c cho trong Hnh 3. 1.
Hnh 3-1 Kin trc ca A-Team
Mt trong nhng tin ch c s dng rng ri pht trin cc h a tc t l
JADE [9,10,54]. JADE c xy dng da hon ton vo cc c t ca FIPA
(Foundation for Intelligent Physical Agents), v vy bn thn JADE thng c
ng nht vi cc c t ny [25]. Kin trc A-Team da trn nn tng JADE l
cng c hiu qu ci t cc thut ton da trn qun th
[34].
Trong phn tip theo, h thng a tc t gen GMAS-OneDCSP_M s c xy
dng trn nn tng JADE vi kin trc A-Team nhm nng cao hiu qu ca thut
ton GA-AF gii bi ton OneDCSP_M. H GMAS-OneDCSP_M thit k cho php
s dng ti u
ti nguyn tnh ton ca h thng v chu c s c
.
Memory
A
7
A
3
A
1
A
5
A
6
A
8
A
4
A
2
54
3.1. Yu cu ca h thng GMAS-OneDCSP_M
GMAS-OneDCSP_M l h thng a tc t c thit k d ng gii quyt cc
bi ton ct vt t mt chiu c ci t bng ngn ng Java trn nn JADE v c
cc c trng sau y :
- H thng c th gii quyt nhiu bi ton ct vt t khc nhau ti cng mt
thi im.
- Qu trnh gii tng bi ton c th c
thc hin trn nhiu my tnh.
Ngi dng c th t do kt ni hoc loi b mt my tnh bt k khi h
thng. Trong trng hp ny
, h thng t thch nghi vi nhng thay i
bng vic ch th cho cc tc t ang lm vic trong h thng di tr ti ni
cho php.
- H thng thc hin vic gii cc bi ton theo m (batch mode). Cc bi
ton mi s c lu tr v gii quyt khi h thng c ti nguyn cho
php thc hin gii bi ton.
Cc nh l 2.2, 2.3 v 2.4 phn nh mi quan h ng ngha gia bi ton
OneDCSP_M(m,M,l,b,L,c) v bi ton ) , , , ( _
k
k
b l L m S OneDCSP . Vic gii bi ton
OneDCSP_M(m,M,l,b,L,c) theo thut ton GA-AF chnh l vic p dng gii thut
di truyn trn khng gian tm kim c to thnh t cc t hp nghim ca cc bi
ton ) , , , ( _
k
k
b l L m S OneDCSP vi cc b
k
tha mn rng buc b b
M
k
k
=

=1
. T quan st
ny, chng ta c th xy dng mt h thng a tc t di ng theo kin trc A-
Team gii bi ton OneDCSP_M(m,M,l,b,L,c) vi hai kiu tc t chnh. Kiu tc
t u tin thc hin thut ton GA-AF v ng vai tr khi to, qun l, la chn
nghim ca bi ton OneDCSP_M(m,M,l,b,L,c) trn c s nghim ca cc bi ton
thnh phn ) , , , ( _
k
k
b l L m S OneDCSP . Kiu tc t th hai nhn nhim v gii bi
ton ) , , , ( _
k
k
b l L m S OneDCSP bng thut ton AF. Ngoi ra, h thng cng bao
gm mt s tc t c bit cung cp cc dnh v khc nh qun l ti nguyn, qun
55
l v bo co cng vic... Cc tc t hot ng phn tn, song song, khng ng b
v c th di tr mt cch linh hot ph thuc vo ti nguyn c cp pht.
Vic tng tc gia ngi dng vi h thng trong qu trnh gii bi ton c
th hin bng biu trong Hnh 3.2.
Determine instances and other
paramenters
Manage resources
Search solution for the given
instances
Report solution
Delete resources
<<extend>>
Add resources
<<extend>>
User
<<include>>
<<include>> <<include>>
Hnh 3-2 Biu tng tc gia ngi dng v h thng GMAS-OneDCSP_M
3.2. Thit k h thng GMAS-OneDCSP_M
3.2.1. Kin trc h thng GMAS-OneDCSP_M
Kin trc ca h thng c xy dng da trn JADE platform nh minh ha
trong hnh 3.3. Mi platform bao gm nhiu container c ci t phn tn trn
mng. Cc tc t nm trn cc container, trong container l tin trnh Java, cung
cp mi trng chy JADE v tt c cc dch v cn thit cho vic lu tr (hosting)
v thc thi cc tc t. Main container l mt container c bit c khi to u
tin khi mt platformc thit lp. Tt c cc container khc u phi ng k vi
main container.
GMAS-OneDCSP_M
56
Hnh 3-3 Kin trc h thng GMAS-OneDCSP_M
Main container c nhim v:
- Qun l Bng Container (Container Table-CT), ni ng k cc tham chiu
i tng v a ch ca tt c cc container trong platform.
- Qun l Bng m t tc t ton cc (Global Agent Descriptor Table-
GADT), cha thng tin ca tt c cc tc t c mt trong platform cng vi
trng thi hin thi v v tr ca cc tc t.
JAVA JAVA
LADT
Main container
GADT CT
DF
AMS
Task
Manager
Resource
Manager
OneDCSP_M
Solver
OneDCSP_S
Solver
JAVA
LADT
Container-2
GADT
cache
LADT
Container-1
GADT
cache
OneDCSP_S
Solver
OneDCSP_S
Solver
PLATFORM
IMTP IMTP
57
- Hosting hai tc t c bit l AMS c nhim v qun l tc t, cung cp
dch v trang trng (white page service), v tc t DF cung cp dch v
trang vng (yellow page service) ca platform.
Trn mi container u c Bn
g m t tc t a phng (Local Agent Descriptor
Table-LADT). Cc container khc ngoi main container cn cha thm Bng lu
tr m t tc t ton cc (GADT cache) phc v cho vic tm kim ni nhn cc
thng ip.
Ngoi hai tc t ngm nh l AMS v DF, Main container ca h thng GMAS-
OneDCSP_M cn cha:
- Tc t TaskManager c nhim v khi to, qun l trng thi ca cc bi
ton v tr kt qu cho ngi dng khi bi ton c gii xong .
- Tc t ResourceManager c nhim v qun l platform.
- Cc tc t OneDCSP_M-Solver
Mi bi ton OneDCSP_M s do mt tc t OneDCSP_M-Solver chu trch
nhim x l. Tc t ny phi hp vi cc tc t OneDCSP_S-Solver thc hin
thut ton GA-AF gii cc bi ton ct vt t mt chiu vi nhiu kch thc
vt liu th.
- Cc tc t OneDCSP_S-Solver thc hin gii thut AF gii bi ton ct
vt t mt chiu vi mt loi vt liu th. Tp cc tc t
OneDCSP_S-
Solver c s dng chung v tham gia gii quyt mi bi ton c khi
to trong b nh.
Cc container khc (Container-1, Container-2) khng phi l Main container
cha cc tc t OneDCSP_S-Solver khi h thng c yu cu gii bi ton
OneDCSP_S.
Cc tc t ca h thng c phn b ng trn cc nt tnh ton ca mng LAN
v hot ng hon ton c lp vi nhau theo c ch khng ng b. S lng cc
58
tc t ca hai loi OneDCSP_M-Solver v OneDCSP_S-Solver c sinh ra ph
thuc s lng bi ton cn gii quyt v ti nguyn ca h thng.
3.2.2. Thit k chi tit h thng GMAS-OneDCSP_M
Chc nng chnh ca h thng GMAS-OneDCSP_M l t chc v thc hin vic
tm kim nghim cho bi ton ct vt t mt chiu vi nhiu kch thc vt liu th
vi cc bc nh sau:
i vi tng bi ton c th
- To sinh qun th nghim khi u v lu chng trong b nh chung
(common memory)
- Ci thin cht lng qun th nghim bng cc tc t c nhim v gii cc
bi ton ) , , , , , ( _ c L b l M m M OneDCSP , ) , , , ( _
k
k
b l L m S OneDCSP v lu tr
qun th nghim c ci thin vo b nh chung. Qu trnh ci thin
cht lng ny lp li cho ti khi iu kin dng c tha mn.
3.2.2.1. Cu trc b nh chung ca h thng GMAS-OneDCSP_M
Trong h thng, vic lu tr thng tin trong b nh chung c t chc nh sau.
Mi bi ton c th c xc nh bi mt nh danh duy nht do ngi dng t ra
v c cp pht mt vng nh trong b nh chung c cu trc gm 3 min.
Min u tin, Par, cha cc tham s c trng ca bi ton: m, M, l, b, L, c.
Min th hai, Feasible Solution FS, cha qun th nghim chp nhn c
gm K nghim (K phn hoch no ca vc t b, vi K l kch thc qun th
nghim trong GA-AF) ca bi ton ) , , , , , ( _ c L b l M m M OneDCSP . Mi nghim chp
nhn c c cu trc bao gm mt bin trng thi nghim, mt phn hoch ca
vc t k hoch b, mt vc t trng thi ca cc bi ton ) , , , ( _
k
k
b l L m S OneDCSP
tng ng vi tng lp ca phn hoch, cc vc t nghim ti u x v cc ma trn
phng n ct tng ng ca tng bi ton
) , , , ( _
k
k
b l L m S OneDCSP . Mi bin
trng thi c th nhn 3 gi tr: cha c x l (Np), ang x l (P) v hon thnh
59
(F) tng ng vi vic bi ton cha c xem xt, bi ton ang c x l v bi
ton c gii quyt xong. Ban u tt c cc bin trng thi u nhn gi tr Np.
Cc bin trng thi c mi quan h phn cp. Bin trng thi mc trn s c gi tr
Np nu tt c cc bin trng thi mc di u c gi tr Np; c gi tr P nu t
nht mt bin trng thi mc di c gi tr P hoc F v t nht mt trong cc bin
cn li khng c gi tr F; khi tt c cc bin trng thi mc di c gi tr F th
bin trng thi trc tip mc trn s c gn gi tr F.
Min th ba, Offspring, cha cc nghim chp nhn c ca bi ton
) , , , , , ( _ c L b l M m M OneDCSP c sinh ra t cc nghim chp nhn c trong
min FS bng tc ng ca cc ton t gen
(2.15)-(2.16), (2.23)-(2.26) v (2.29).
Ta c th m t phn b nh chung tng ng vi mi bi ton OneDCSP_M
trong hnh 3.4 sau.
Par FS Feasible Solution Offspring
K phn hoch vc t b Cc nghim sau lai ghp
Bin trng
thi 1
Phn
hoch 1
Nghim
ti u x
Phng
n ct

Cc nghim sau t bin

Cc nghim sau chn lc
m,
M,
l,
b,
L,
c
Bin
trng thi
chung
(Np,
P,
F)
Bin trng
thi K
Phn
hoch K
Nghim
ti u x
Phng
n ct

Cc tham
s c
trng ca
bi ton
Qun th nghim chp nhn c
ca OneDCSP_M
Cc nghim ca
OneDCSP_M sinh ra t
FS bng tc ng cc
ton t gen
Hnh 3-4 Cu trc b nh chung tng ng vi mi bi ton OneDCSP_M
3.2.2.2. Hot ng ca
h thng GMAS-OneDCSP_M
Hot ng ca h thng c th c m t tm tt nh sau.
60
Khi khi ng h thng, ngi dng thng qua TaskManager ch ra cc ti
nguyn c th s dng (cc nt tnh ton trn mng LAN). TaskManager truyn cc
thng tin ny cho ResourceManager. ResourceManager s khi to platform, t
chc mt b nh chung, to sinh mt s bn copy ca tc t OneDCSP_S-Solver
(s bn copy ph thuc vo ln ca cc container) ng thi phn b chng trn
cc container khc nhau.
Ban u, d liu ca bi ton c ngi dng son tho di nh dng XML
nh trn v c lu thnh cc file trong mt folder b nh ngoi. Ti mi thi
im bt u hot ng ca h thng, ngi dng s cung cp ng dn folder d
liu ny v tc t TaskManager s c cc tham s ca tng bi ton, tnh ton
khng gian nh cn thit lu tr d liu ca bi ton ti b nh chung v yu
cu tc t ResourceManager cung cp b nh c kch thc ph hp.
ResourceManager nhn yu cu t TaskManager, kim tra khng gian nh cn cha
s dng ca b nh chung. Nu khng gian nh cha s dng ca b nh chung
lu tr d liu ca bi ton mi, ResourceManager s thng bo hot ng thnh
cng, v cung cp a ch u ca khng gian nh cn cha s dng cho
TaskManager. TaskManager s lu cc d liu ca bi ton vo cc min tng ng
v gi thng bo yu cu ResourceManager to sinh mt bn copy tc t
OneDCSP_M-Solver dnh ring thc hin gii bi ton mi bng vic cung cp
cho tc t ny problemID ca bi ton do TaskManager khi to.
Trong trng hp h thng ang hot ng, nu TaskManager nhn c yu
cu dng t ngi dng n s thay cc i cc bin trng thi ang c gi tr P ca
cc bi ton ) , , , ( _
k
k
b l L m S OneDCSP thnh gi tr Np v chuyn i ton b d
liu trong b nh chung thnh nh dng XML nh trn v lu ra thit b ngoi vi.
Hnh vi trn ca TaskManager cng c t lch nh k (thi gian do ngi dng
la chn) nu khng c tc ng ca ngi dng. Cch t chc nh vy bo m
cho vic h thng c th khi phc li trng thi gii quyt bi ton gn nht khi c
s c xy ra.
61
Trong qu trnh h thng ang hot ng, ngi dng c th ch th thm hoc
bt ti nguyn. Khi TaskManager s yu cu Re
sourceManager phn b li cc
tc t ang hot ng ca h thng bng vic ch th cho cc tc t di tr t mt
container sang mt container khc (cc tc t trong h thng l cc tc t di ng
-
Mobile Agent) bo m h thng hot ng mt cch hiu qu.
Khi c thng bo thnh cng t tc t OneDCSP_M-Solver no ,
TaskManager tr kt qu bi ton tng ng cho ngi dng v thng bo yu cu
ResourceManager gii phng min nh trong b nh chung ng vi bi ton
c x l xong.
Ph thuc vo khng gian nh cha s dng trong b nh chung do mnh qun
l, ResourceManager c lng kh nng phn phi khng gian nh cho bi ton
mi. Nu khng gian nh cha s dng vt qua gi tr trung bnh khng gian nh
ca tt c cc bi ton ang lu tr trong b nh chung, ResourceManager gi
thng bo cho TaskManager. Trong trng hp ny, TaskManager kim tra folder
lu tr d liu ca ngi dng. Nu c bi ton cha c khi ng TaskManager
s hot ng nh ti thi im xut pht ca h thng.
Vic gii bi ton c thc hin ch yu nh hai lo
i tc t : OneDCSP_S-
Solver v OneDCSP_M-Solver.
Mi tc t loi OneDCSP_S-Solver c nhim v gii bi ton ct vt t mt
chiu vi mt loi vt liu th bng thut ton AF ca Carvalho. Cc tc t ny nh
k theo thi gian duyt ni dung cc min FS v Offspring ca b nh chung tm
cc th hin cha c x l ca bi ton
) , , , ( _
k
k
b l L m S OneDCSP thng qua nh
danh ca bi ton, s th t ca nghim chp nhn c, s th t ca bi ton
) , , , ( _
k
k
b l L m S OneDCSP trong thnh phn ca nghim chp nhn c v gi tr
ca bin trng thi gn vi n. Nu c bi ton cha c x l trong b nh chung
(gi tr bin trng thi l Np), OneDCSP_S-Solver s c d liu ca bi ton, gn
gi tr ca bin trng thi thnh P, gii bi ton v cp nht kt qu vo b nh
62
chung, ng thi gn gi tr bin trng thi ca bi ton thnh F. Qu trnh c lp
li khi cha nhn c cc ch th khc t TaskManager.
Mi tc t loi OneDCSP_M-Solver gii bi ton do mnh m trch theo cc
bc c th sau :
- To sinh qun th nghim chp nhn c ban u cho bi ton
OneDCSP_M theo Bc 0 ca thut ton GA-AF. Lu cc nghim chp
nhn c vo min FS ca b nh chung dnh cho bi ton v xa min
Offspring tng ng.
- i vi bi ton c th c giao m trch, nh k k im tra bin trng
thi ca cc nghim chp nhn c ca n. Nu mi nghim chp nhn
c trong min FS dnh cho bi ton c x l xong (bin trng thi
ca mi nghim chp nhn c c gi tr F (ng ngha vi vic tt c cc
bi ton ) , , , ( _
k
k
b l L m S OneDCSP trong mi nghim chp nhn c
c gii thnh cng bi cc tc t loi OneDCSP_S-Solver) v min
Offspring tng ng l rng, OneDCSP_M-Solver s thc hin cc Bc 2
v Bc 3 ca thut ton GA-AF nhn c tp nghim chp nhn c
' '
t
G v lu tp nghim ny vo min Offspring ca b nh chung ng thi
gn gi tr Np cho cc bin trng thi ca tng nghim cng nh ca cc bi
ton ) , , , ( _
k
k
b l L m S OneDCSP thnh phn. Trong trng hp tt c cc
nghim chp nhn c trong c hai min FS v Offspring u c gi tr
bin trng thi l F, OneDCSP_M-Solver s thc hin Bc 5 ca GA-AF
bng cch thay th cc nghim chp nhn c c thch nghi thp trong
FS bi cc nghim chp nhn c c thch nghi cao hn trong m
in
Offspring. Sau khi thc hin xong vic thay th, ni dung min nh
Offspring c xa. Qu trnh ny lp li ti khi iu kin kt thc ca bi
ton c tha mn v khi gn gi tr F cho bin trng thi ca bi ton.
Sau khi hon thnh vic gii bi ton, tc t ny thng bo thnh cng cho
63
TaskManager, ResourceManager v t hy. ResouceManager cp nht
thng tin platform.
Hot ng c bn ca h thng GMAS-OneDCSP_M c minh ha trong Hnh
3.5.
Print the result
Create the population of solutions
Read data and paramenters
TaskManager
<<include>>
ResourceManager
OneDCSP_S-Solver
Solve
Create agents
Read instance data OneDCSP_M-Solver
Manage the population of solutions
<<include>>
<<include>>
Hnh 3-5 Biu Use Case ca h thng GMAS-OneDCSP_M
Vi cc c t chc nng ca tng
loi tc t nh trn
, tnh ng n ca h
thng c pht biu trong nh l sau.
nh l 3.1. [3] Hnh vi ca cc tc t thuc hai loi OneDCSP_M-Solver v
OneDCSP_S-Solver trong h thng bo m cho kt qu ti u ca tng bi
ton ct vt t mt chiu vi nhiu kch thc vt liu th v h thng bo
m c kh nng gii quyt ng thi nhiu bi ton OneDCSP_M.
Chng minh
GMAS-OneDCSP_M
64
Tht vy, vi cc hnh vi v qu trnh tng tc ca cc loi tc t nh
c m t trn, chng ta d dng thy rng :
- Cc tc t hai loi TaskManager, ResourceManager khng tham gia
trc tip vo qu trnh gii cc bi ton ct vt t. Bi vy hot ng
ca chng ch c tc dng tng cng hiu qu ca h thng trong
vic qun l ti nguyn v cho php h thng c kh nng gii quyt
ng thi nhiu bi ton ct vt t khc nhau.
- Cc tc t OneDCSP_S-Solver thc hin vic gii cc bi ton
) , , , ( _
k
k
b l L m S OneDCSP nm trong Bc 1 v Bc 4 ca thut ton
GA-AF
- Cc tc t OneDCSP_M-Solver thc hin cc Bc 0, Bc 2, Bc
3, Bc 5 v Bc 6 ca thut ton GA-AF
- Nh cu trc min b nh chung ginh cho tng bi ton, s phi hp
ca hai loi tc t c ghi nhn bi vic cp cc bi
n trng thi tun
theo ng logic tnh ton ca thut ton GA-AF.
- Trong trng hp c s c xy ra, h thng c kh nng khi phc li
trng thi ca bi ton t thi im cui cng khi TaskManager thnh
cng trong vic chuyn i d liu ca b nh chung
thnh nh dng
XML v ghi vo thit b ngoi vi. Cc tc t s thc hin cng vic
tip tc t thi im ny.
T , tnh ng n ca h thng trong vic gii quyt tng bi ton n
l c suy ra trc tip t nh l 2.8. iu ny cng khng nh tnh ng
n ca ton b h thng khi gii quyt ng thi nhiu bi ton nh s phi
hp ca cc tc t TaskManager v ResouceManager vi cu trc min nh
dnh cho tng bi ton.
65
3.3. nh gi tnh hiu qu ca h thng GMAS-OneDCSP_M
Mi lin h ng ngha ca bi ton ct vt t 1 chiu cho nhiu loi vt t vi bi
ton ct vt t
mt chiu cho mt loi vt t c th hin trong cc
nh l 2.1,
2.2, 2.3 , 2.4 l nn tng l thuyt cho vic song song v phn tn ha thut ton
GA-AF tng tnh hiu qu v thi gian ca thut ton. Trong thc t ci t,
nhm tc gi ci t thut ton di dng mt h thng a tc t (Multi -agent
System) GMAS-OneDCSP_M. H thng gm 2 lp tc t chnh. Lp trn gm 1
agent thc hin thut ton di truyn c nhim v lp k hoch (to ra cc phn
hoch ca vc t k hoch), iu phi cc agent lp di v ng b ha kt qu
(tnh o thch nghi, thc hin cc ton t gen). Lp di gm c c agent thun
nht (cc agent thc hin thut ton AF gii bi ton ct vt t 1 chiu cho 1 loi
vt liu th). Cc agent ca lp di l cc agent di ng (Mobile agent) c agent
lp trn to sinh khi c nhu cu v c th khu tr ti nhng nt tnh ton bt k trn
mng cc b c ti nguyn. y cng l iu vt tri ca thut ton ca chng
ti so vi cc thut ton m cc tc gi khc xut. Vic ci t nh vy tn
dng c sc mnh tnh ton ca mng LAN v gp phn gim ng k thi gi an
gii bi ton. Nu b qua vn truyn thng trong mng LAN, s ci thin v tc
tnh ton ca h thng GMAS-OneDCSP_M so vi phin bn ci t tp trung
ca thut ton GA-AF c th hin bi nhng c lng sau:
Gi thi gian tnh ton ti a g ii bi ton ) , , , ( _ b l L m S OneDCSP bng thut
ton AF l
G
T . Ti mi vng lp ca thut ton GA-AF, xc nh thch nghi
ca 1 c th, chng ta cn gii M bi ton ) , , , ( _
k
k
b l L m S OneDCSP vi M l s
lng cc loi kch thc vt liu th. Nh vy, nu thut ton p ng c iu
kin dng sau N bc lp, c lng thi gian tnh ton ca GA
-AF s l:
NKMT
G
(3.1)
Vi K l s lng c th trong qun th
mi ln lp.
66
Gi s s lng cc tc t OneDCSP_S-Solver c th c to ra trong h thng
GMAS-OneDCSP_M l A. Khi trong mi vng lp ca OneDCSP_M-Solver,
MK bi ton ) , , , ( _
k
k
b l L m S OneDCSP s c
A tc t OneDCSP_S-Solver chia
nhau gii mt cch c lp bng thut ton AF. Nh vy thi gian nh gi
thch nghi ca mi c th trong OneDCSP_M-Solver c th xp x bi cng thc :
G
T
A
M

1
1
(

Nhn xt rng bo m tha mn iu kin dng, tc t

OneDCSP_M-Solver
ca h thng GMAS-OneDCSP_M cng c s bc lp ng nh s bc lp ca
GA-AF. Nh vy thi gian i hi ca h thng gii bi ton xp x l
:
G
T
A
M
K N
1
1
(

Trong thc t trin khai ti nh my ng thp Vit-c th s lng cc loi kch
thc vt liu th M thng t hn 20 v mng LAN ca nh my c b tr tp
trung ti ta nh iu hnh vi 15 nt mng. Mi nt mng c phn phi mt
container v c lin kt theo kin trc ca JADE. S lng cc tc t
OneDCSP_S-Solver trong mi container ph thuc cu hnh ca nt. Trn thc t
trin khai chng ti c th to ra mt s lng kh ln tc t. Bi vy s lng A
cc tc t OneDCSP_S-Solver trn h thng ln hn
M nhiu ln. Do :
G G
T K N T
A
M
K N =
1
1
(

(3.2)
So snh (3.1) vi (3.2), ta thy h thng GMAS-OneDCSP_M c th nhanh gp
M ln so vi phin bn tp trung ca GA-AF. Cc ghi nhn thc t cng cho thy
vic truyn thng ca h thng trn mng LAN lm tng khng qu 2% thi gian
c lng trong
(3.2). iu ny cho thy khi M cng ln th GMAS-OneDCSP_M
cng th hin tnh u vit so vi GA-AF.
H thng ny c trin khai phc v sn xut ti nh my ng thp
Vit-c. Kt qu cho thy trn thc t cha gp mt t sn xut no c lng
67
ph thi ln hn 3% chiu rng ca tm vt t c kch thc ln nht. iu ch
ra rng, thut ton GA-AF c thit k nh trn c tnh cht tng t nh tnh cht
IRUP bng chnh cc thm nh thc t, iu m cc tc gi khc khng cp ti.
3.4. Kt lun
T nhng kt qu l thuyt trong chng 2, tc gi thit k v ci t mt h
thng a tc t di ng GMAS-OneDCSP_M nhm nng cao hiu qu vic gii cc
bi ton ct vt t mt chiu vi n
hiu kch thc vt liu th. H thng c xy
dng theo kin trc A-Team v trin khai trn nn tng JADE v c ci t bng
ngn ng Java. Tnh ng n ca h thng GMAS-OneDCSP_M c khng
nh
bng nh l 3.1.
Ngoi ra, h thng GMAS-OneDCSP_M c xy dng c tnh m, n cho php
b sung thm bi ton mi cng vi cc tc t gii bi ton .
H thng c trin khai v khai thc th nghim ti nh my ng thp Vit-
c [3].
68
KT LUN V HNG NGHIN CU T
IP THEO
Lun n ny dnh cho vic nghin cu xy dng phng php gii bi ton ct
vt t mt chiu vi nhiu
loi kch thc vt liu th (OneDCSP_M) xut hin
trong nhiu lnh vc sn xut khc nhau. Bi ton ny thuc lp NP-hard nn vic
c mt gii thut hiu qu l mi quan tm ca nhiu tc gi.
Trong Lun n ny tc gi t mc tiu lai ghp gii thut di truyn vi k thut
phn nhnh v nh gi to nn mt thut ton lai ghp gii bi ton.
Vi mc tiu tc gi t c cc kt qu chnh nh sau:
1. Nghin cu ch ra tnh
u vit ca vic ct vt t mt chiu vi nhiu loi
kch thc vt liu th so vi ct vt t mt chiu vi mt loi vt liu th
OneDCSP_S (nh l 2.1), phn tch mi lin quan ng ngha gia hai bi
ton (Cc nh l 2.2 v nh l 2.4) a ra cch m hnh ha mi ca
bi ton ct vt t mt chiu vi nhiu kch thc vt liu th OneDCSP_M
(nh l 2.3).
2. Trn c s pht biu mi ca bi ton v cc kt qu l thuyt trn, tc gi
xut lai ghp gii thut di truyn vi phng php AF gii bi ton
OneDCSP_S bng k thut phn nhnh v nh gi trn m hnh Arc-Flow
ca Carvalho gii bi ton OneDCSP_M. lm vic , tc gi a
ra phng php m ha nghim chp nhn c ca bi ton, xy dng mt
lot cc ton t gen vi nhng tnh cht cn thit (nh l 2
.5) to nn
gii thut di truyn lai ghp GA-AF cho php gii chnh xc bi ton
OneDCSP_M. Tnh ng n ca thut ton c chng minh (nh l
2.8).
Thut ton GA-AF c ci t, chy th nghim v cho kt qu tt.
Cc kt qu trn c cng b trong [
1,2,42].
3. nng cao hiu qu ca thut ton GA-AF, tc gi xut ci t thut
ton di dng mt h a tc t di ng GMAS
-OneDCSP_M theo kin trc
69
A-Team trn nn tng JADE. Tnh ng n ca h thng c chng mi nh
(nh l 3.1). Tnh m ca h thng cho php b sung thm cc tc t gii
quyt bi ton mi.
H thng GMAS-OneDCSP_M c trin khai mt cch hiu qu trong
mi trng cng nghip.
Cc kt qu ny c cng b trong
[3]
Hng nghin cu tip theo:
1. Nghin cu ng dng phng php to sinh ct m rng gii cc bi ton c
cu trc phc tp.
2. Nghin cu phng php gii cc bin th vi nhng rng buc khc ca bi
ton ct vt t. Cc phng php gii cc bin th mi s c b sung vo
h thng GMAS-OneDCSP_M to nn sn phm c kh nng ng dng
cao trong thc t.
3. Nghin cu p dng gii thut di truyn gii quyt cc bi ton ti u t
ra cho mng vin thng.
70
DANH MC CC CNG TRNH CA TC GI
[1a]. Phan Th Hoi Phng, Nguyn Minh Hng (2006), M hnh kt hp
thut ton gen v phng php n hnh ng dng trong bi ton cc tiu ha
chi ph sn xut, Tp ch Tin hc v iu khin hc, 22(4), pp.319-324.
[2a]. Phan Th Hoi Phng, Lng Chi Mai, Nguyn Vn Hng (2009)
, Mt
thut ton lai ghp gii bi ton ct vt t mt chiu vi nhiu kch thc vt
liu th, Tp ch Tin hc v iu khin hc
, 25(3), pp.214-230.
[3a]. Phan Th Hoi Phng, Lng Chi Mai (2010), GMAS-1DMCSP: H
thng a tc t gen gii bi ton ct vt t mt chiu vi nhiu kch th
c vt
liu th , Tp ch Khoa hc v Cng ngh , 48(6), pp.37-58.
[4a]. Phan Thi Hoai Phuong (2011), Hybridization of genetic algorithm and
branch-and-price framework for solving The One Dimensional Cutting Stock
Problem with Multiple Stock Sizes, accepted for 2012 IEEE International
Conference on Research, Innovation and Vision for the Future in Computing
and Communications Technologies (RIVF), Ho Chi Minh City, Vietnam
(Long paper).
71
TI LIU THAM KHO
Ti liu ting Vit
[1] Phan Th Hoi Phng, Nguyn Minh Hng (2006), M hnh kt hp
thut ton gen v phng php n hnh ng dng trong bi ton cc tiu
ha chi ph sn xut, Tp ch Tin hc v iu khin hc , 22(4), pp.319-
324.
[2] Phan Th Hoi Phng, Lng Chi Mai, Nguyn Vn Hng (2009) ,
Mt thut ton lai ghp gii bi ton ct vt t mt chiu vi nhiu kch
thc vt liu th, Tp ch Tin hc v iu khin hc, 25(3), pp.214-
230.
[3] Phan Th Hoi Phng, Lng Chi Mai (2010), GMAS-1DMCSP: H
thng a tc t gen gii bi ton ct vt t mt chiu vi nh iu kch thc
vt liu th , Tp ch Khoa hc v Cng ngh, 48(6), pp.37-58.
Ti liu ting Anh
[4] Back T. (1996), Evolutionary Algorithms in Theory and Practice, Oxford
University Press, Oxford, UK.
[5] Back T. et all (2000), Eds. Evolutionary Computation 1: Basic
Algorithms and Operators, Institute of Phisics Publishing, Bristol.
[6] Back T. et all (2000), Eds. Evolutionary Computation 2: Advanced
Algorithms and Operators, Institute of Phisics Publishing, Bristol.
[7] Banzhaf W. et all (1998), Eds. Genetic Programming: An Introduction,
Morgan Kaufmann, San Francisco.
[8] Barbucha Dariusz and Jedrzejowicz Piotr (2007), An Agent-Based
Approach to Vehicle Routing Problem, World Academy of Science,
Engineering and Technology, 26.
[9] Bellifemine Fabio, Caire G., Greenwood D. (2007), Developing multi-
agent systems with JADE, Wiley Series in Agent Technology, ISBN 978-
0-470-05747-6.
72
[10] Bellifemine Fabio et all (2008), JADE: A software framework for
developing multi-agent applications. Lessons learned, Information and
Software Technology 50, pp.1021.
[11] Belov Gleb and Scheithauer G. (2002), A cutting plane algorithm for the
one-dimensional cutting stock problem with multiple stock lengths,
European Journal of Operational Research 141(2), pp.274294, Special
issue on cutting and packing.
[12] Belov Gleb and Scheithauer G. (2003), A branch-and-cut-and-price
algorithm for one-dimensional stock cutting and two-dimensional two-
stage cutting, Technical report, Dresden University, URL:
www.math.tu-dresden.de/capad.
[13] Belov Gleb and Scheithauer G. (2003), Setup and open stacks
minimization in one-dimensional stock cutting, Technical report,
Dresden University.
[14] Belov Gleb (2004), Problems, Models and Algorithms in One- and Two-
Dimensional Cutting, Dissertation, TU Dresden.
[15] Chira C., M. Pintea C., Dumitrescu D. (2008), An Agent-Based
Approach to Combinatorial Optimization, Int. J. of Computers,
Communications & Control, Vol. III, Suppl. issue: Proceedings of
ICCCC 2008, pp.212-217
[16] Corkill D. D. (1991), Blackboard systems, AI Expert, 6(9), pp.4047.
[17] De Jong K.A. (1975), An Analysis of a class of Genetic Adaptive Systems,
PhD thesis, University of Michigan.
[18] Eiben A.E. et all (1998), Eds. Evolutionary Computation, IOS Press.
[19] Engelmore R. S. and Morgan A. (1988), editors. Blackboard Systems.
Addison-Wesley.
[20] Eshghi K. , Javanshir H. (2005), An ACO algorithm for one-
dimensional cutting stock problem, Journal of Industrial Engineering
73
International, Islamic Azad University, Tehran South Branch, 1(1),
pp.10 9.
[21] Falkenauer E. (1996) A hybrid grouping genetic algorithm for bin
packing, Journal of Heuristics, 2(1), pp.5-30.
[22] Fogel D.B. (1998), Ed. Evolutionary Computation: the Fossil Record,
IEEE Press, Piscataway, NJ.
[23] Fogel L.J. et all (1965), Artificial Intelligence through a Simulation of
evolution, In: A. Callahan et all, Eds. Biophisics and Cybernetic
Systems, Spartan, Washington DC, pp.131-156.
[24] Fogel L.J. et all (1966), Artificial Intelligence through Simulated
Evolution, Wiley, Chichester, UK.
[25] Gawinecki Maciej, Frackowiak Grzegorz (2008), Multi-Agent Systems
with JADE: A Guide with Extensive Study, Distributed Systems Online,
IEEE, 9 (3).
[26] Gilmore, P. C., R. E. Gomory (1961), A linear programming approach
to the cutting-stock problem, Operational Research, 9, pp.849859.
[27] Gilmore, P. C., R. E. Gomory (1963), A linear programming approach
to the cutting stock problemPart II, Operational Research, 11 pp.863
888.
[28] Holland J.H. (1973), Genetic Algorithms and the optimal Allocation of
trials, SIAM J. of computing 2, pp.88-105.
[29] Holland J.H. (1992), Adaptation in Natural and Artificial Systems, MIT
Press, Cambridge, MA.
[30] Holthaus O. (2002), Decomposition approaches for solving the integer
one dimensional cutting stock problem with different types of standard
lengths, European Journal of Operational Research 141, pp.295312.
[31] Jagannathan V., Dodhiawala R., and Baum L. S. (1989), editors.
Blackboard Architectures and Applications, Academic Press.
74
[32] Jahromi M.H.M.A., Tavakkoli-Moghaddam R., Givaki E., Rezapour-Ziba
A. (2011), A simulated annealing approach for a standard one-
dimensional cutting stock problem, International Journal of Academic
Research, 3(1).
[33] Javanshir H. , Shadalooee M. (2007), The trim loss concentration in one-
dimensional cutting stock problem (1D-CSP) by defining a virtual cost,
Journal of Industrial Engineering International, Islamic Azad University,
South Tehran Branch, 3(4), pp.51-58.
[34] Jdrzejowicz Piotr and Wierzbowska Izabela (2006), JADE-Based A-
Team Environment, Lecture Notes in Computer Science, 3993/2006,
pp.719-726.
[35] Kantorovich L. (1960), Mathematical methods in the organization and
planning of production, Management Science, 6, pp.550-559
[36] Kazemi A. and Zarandi M.H. Fazel (2008), An Agent-Based Framework
for Building Decision Support System in Supply Chain Management,
Journal of Applied Sciences, 8(7), pp.1125-1137.
[37] Koza J.R., Genetic Programming (1992), MIT Press, Cambridge, MA.
[38] Koza J.R. Genetic Programming II (1994), MIT Press, Cambridge, MA.
[39] Liang K. H. , Yao X., Newton C. , Hoffman D. (2002), A new
evolutionary approach to cutting stock problems with and without
contiguity, Computers & Operations Research 29(12), pp.1641-59.
[40] Michalewicz Z. (1996), Genetic Algorithms+Data Structure=Evolution
Programs, Springer, Berlin, Heidenberg, New York, 3
rd
ed.
[41] Phan Thi Hoai Phuong (2008), The limit behavior and convergence of
genetic algorithm on a class of functions, 2008 IEEE International
Conference on Research, Innovation and Vision for the Future in
Computing and Communications Technologies (RIVF), Ho Chi Minh
City, Vietnam (Short paper), pp.76-79.
75
[42] Phan Thi Hoai Phuong (2011), Hybridization of genetic algorithm and
branch-and-price framework for solving The One Dimensional Cutting
Stock Problem with Multiple Stock Sizes, accepted for 2012 IEEE
International Conference on Research, Innovation and Vision for the
Future in Computing and Communications Technologies (RIVF), Ho Chi
Minh City, Vietnam (Long paper).
[43] Raymond Chiong, Ooi Koon Beng (2007), A Comparison between
Genetic Algorithms and Evolutionary Programming based on Cutting
Stock Problem, Engineering Letters, 14:1, EL_14_1_14 (Advance
online publication).
[44] Rietz J. and Dempe S. (2008), Large Gaps in One-dimensional Cutting
Stock Problems, Discrete Applied Mathematics, 156 (10).
[45] Rudolph Gunter (1994), Convergence Analysis of Canonical Genetic
Algorithms, IEEE Transactions on Neural Networks, 5(1), pp.96-101.
[46] Rudolph Gunter (1997), Convergence properties of evolutionary
algorithms, Hamburg, Gemany: Verlag Kovac, ISBN 3-86064-554-4.
[47] Schwefel H.P., Manner R. (1995), Eds. Evolution and Optimum Seeking,
Wiley, New York.
[48] Silvio A.Araujo, Ademir A. Constantino, Kelly C. Poldi (2011), An
evolutionary algorithm for the one-dimensional cutting stock problem,
International Transaction in Operation Research,18(1), pp.115-127.
[49] Talukdar S. (1993), Asynchronous Teams, Proceedings of The 4
th
International Symposium on Expert Systems Applications to Power
Systems, LaTrobe University, Melbourne, Australia.
[50] Talukdar S. et all (1996), Asynchronous Teams: Co-operation Schemas
for autonomous, Computer-Based agents, Technical Report EDRC 18-
59-96, Engineering Design Research Center, Carnegie Mellon University.
[51] Toyoda Johsuke , Takeyasu Kazuhiro (2007), Extended elitism method
for cutting stock problem of timber precutting, International Journal of
76
Information Systems for Logistics and Management (IJISLM), 3(1),
pp.47-59.
[52] Toyoda J. , Takeyasu K. (2008), A revised first fit algorithmfor timber
precutting, International Journal of Computational Science, 2(1), pp.92-
107.
[53] Toyoda Johsuke , Takeyasu Kazuhiro (2010),A Genetic Algorithm
Using Tournament Crossover Operation for Cutting Stock Problem,
International Journal of the Information Systems for Logistics and
Management (IJISLM), 5(2).
[54] Trappey Charles V. et all (2009), The design of a JADE-based
autonomous workflow management system for collaborative SoC
design, Expert Systems with Applications, 36, pp.26592669.
[55] Valrio de Carvalho J.M.(1999), "Exact solution of bin-packing problems
using column generation and branch-and-bound", Annals of Operations
Research, 86, pp. 629-659.
[56] Valrio de Carvalho J.M., Cludio Alves (2008), "A Stabilized Branch-
and-Price-and-Cut Algorithm for the Multiple Length Cutting Stock
Problem", Computers and Operations Research, 35 (4) pp. 1315-1328.
[57] Waescher G., Hauner H., and Schumann Holger (2007), An improved
topology of cutting and packing problems, European Journal of
Operational Research, 183, pp.1109-1130.
[58] Wongprakornkul Sirinat (2008), Round Down Technique for Solving an
Integer Linear Programming, KKU Science Journal, 36, pp.187-198.
[59] Yakawa Tetsuya, Iima Hitoshi, Sannomiya Nobuo (2005), Proposition
of Genetic Algorithm for Bin Packing Problems, Transactions of the
Society of Instrument and Control Engineers, 41(3), pp.274-282.
[60] Yang Chien-Tung, Sung Tso-Chung, Weng Wei-Chu (2006), An
improved tabu search approach with mixed objective function for one-
77
dimensional cutting stock problems, Advances in Engineering Software,
37(8), pp.502-513.
78
PH LC
Gi m c t chc nng ca tng l oi tc t trong h thng
GMAS-OneDCSP_M
A. Gi m c t chc nng ca tc t TaskManager
Start;
Receive Resource information from User;
Create ResourceManager;
Send Resource information to ResourceManager;
Wait for success platform preparation respond from ResourceManager;
If (respond=failure)
Then
{
Inform user about the failure;
Stop
};
Confirm New batch?;
If (New Batch=Esc)
Then
{
Receive link to immediate results of old batch;
Download immediate results of old batch to common memory;
Create OneDCSP_M-Solver corresponding to the unsolved problems
}
Else
Receive link to new batch;
Set Timer:=10;
While unsolved problem is available in the folder
Do
{
Send Request to allocate common memory space for new problem
to ResourceManager;
79
Wait for success allocation respond from Resource Manager;
If (respond=failure)
Then
While the common memory is not empty
Do
{
Repeat
Look for solved problem in the common memory
Until solved problem found;
Print The result of the solved problem;
Send Request to free the common memory space for the
solved problem to ResourceManager
}
Else
{
Create OneDCSP_M-Solver for New problem ;
Move New problem from the folder
} ;
If (Timer=0 or KeyboardHook= Shift )
Then
{
Store common memory content in secondary memory ;
Set Timer :=10
} ;
If (KeyboardHook= Ctrl )
Then
{
Receive New Resource information from user ;
Send request To instruct the agents to move to new
locations to ResourceManager
}
} ;
While (the common memory is not empty)
Do
80
{
Repeat
Look for solved problem in common memory
Until solved problem found;
Print The result of the solved problem
};
Send Request Stop Request to ResourceManager;
Stop
B. Gi m c t chc nng ca tc t ResourceManager
Start;
Wait for Resource information from TaskManager;
Create platform and common memory;
Send Respond Status of creating Platform and common memory
to TaskManager;
If (Status=failure) Then Stop;
Create OneDCSP_S-Solver ;
While (True)
Do
{
Wait for Request from TaskManager;
If(Request=to allocate common memory space for new
problem)
Then
{
Check free space in common memory ;
If (free space is enough for new problem)
Then
Send Respond success allocation respond to
TaskManager
Else
Send Respond failure allocation respond to
TaskManager;
} ;
81
If (Request=to free the common memory space for the
solved problem)
Then
{
Update common memory management data;
Remove OneDCSP_M-Solver corresponding to the solved
problem from platform
};
If(Request=Instruct the agents to move to new
locations)
Then
Reallocate OneDCSP_M-Solver and OneDCSP_S-Solver
to new resources ;
If (Request=Stop Request)
Then Stop
};
C. Gi m c t chc nng ca tc t
OneDCSP_M-Solver
Start ;
Initiate first feasible solution population in FS ;
While (Stop conditions are not satisfied)
Do
{
While (some feasible solutions Status Variable in FS
and Offspring is not equal to F)
Do
{
Check all Status variables of its OneDCSP_S
subproblems ;
If (all Status Variables of its OneDCSP_S
subproblems are F)
Then
Set feasible solutions Status Variable=F
} ;
If (Offspring is empty)
82
Then
{
Perform operations in Step 2 and Step 3 of GA-AF;
Store Results in Offspring ;
While (some feasible solutions Status Variable in
Offspring is not equal to F)
Do
{
Check all Status variables of its OneDCSP_S
subproblems;
If (all Status Variables of its OneDCSP_S
subproblems are F)
Then
Set feasible solutions Status Variable=F;
} ;
Perform Step 4 of GA-AF
}
Else
{
Peform Step 5 of GA-AF ;
Erase Offspring
}
} ;
Set Problems Status Variable=F ;
Stop
D. Gi m c t chc nng ca tc t OneDCSP_S-Solver
Start ;
While(TRUE)
Do
{
Find Unsolved OneDCSP_S subproblem in common memory;
If (Unsolved OneDCSP_S subproblem found)
Then
83
{
Set OneDCSP_S subproblems Status Variable=P ;
Perform Step 1 of GA-AF with unsolved OneDCSP_S
subproblem ;
Store Results in common memory ;
Set OneDCSP_S subproblems Status Variable=F
}
}
Stop