S dng thut ton DE gii bi ton ti u

cn bng thi gian v chi ph trong qun l d n xy dng

(The use of Differential Evolution algorithm in solving time-cost trade-off optimization
problem in structure project management)
TS Nguyn Qun Thng, TS Bi c Nng, KS Nguyn Thi Tuyt Mai

TOM TT
Thi gian va chi phi la hai i tng quan trong cn kim soat trong quan ly d an va co quan h ch t
che vi nhau. a co nhiu nghin cu tim li giai cho bai toan ti u cn bng thi gian - chi phi, cac k thut
c ng dng gm phng phap tim kim, phng phap quy hoach toan hoc va cac thu t toan ti u da trn nn
tang cua s tin hoa (thu t giai di truyn - GA, ti u an kin - CAO). Trong bai bao nay trinh bay vic xy dng

m hinh tinh cho dang bai toan nu trn, trn c s ap dng thut toan tin hoa vi phn (DE) kt hp vi phng
phap trong s thich ng cai tin (WAWA). Thng qua mt vi d c th minh hoa kha nng cua m hinh tinh
mi va so sanh kt qua khi ng dng cac thut toan khac nhau a c cac tac gia khac cng b trc y.

ABSTRACT
Time and cost are two important and controllable ojectives in structure project management which are
considerably dependent on each other. There have been many studies to find solutions to time-cost trade-off
optimization problems, which apply techniques including the heuristic method, mathematical approach and
evolutionary-based optimization algorithms (Genetic Algorithm - GA, Ant Colony Optimization - ACO). In this
paper the flight crystal building models for the above problem types, on the basis of applying the Differential
Evolution algorithm (DE) in combination with the Modified Adaptive Weight Approach (WAWA). An example
was analyzed to illustrate the capabilities of the proposed model and to compare against GA-based TCO and
CAO-based TCO models.

Bi c Nng - The Military Technical Academy

Mobile: 0904.274.476
Email: nanghvktqs@gmail.com
1. t vn
Ngoai nhng yu cu v cht lng, cac thng s thi gian va chi phi la hai ch tiu rt quan
trong trong qua trinh thc hin cac d an xy dng. Chng la nhng iu khoan khng th thiu trong
cac hp ng va u c nha thu cng nh chu u t quan tm. Khi ap dng cac bin phap k
thut va t chc thi cng khac nhau co th hoan thanh cng trinh vi tng thi gian - chi phi rt khac
nhau. Trong thc t thi hai ch tiu nay quan h vi nhau rt cht che va thng co xung t. Do vy
vic xy dng mt phng an thi cng sao cho tng thi gian va chi phi ti u (bai toan TCO-Time
and Cost Optimization) hay hp ly nht cho mt d an xy dng la rt cn thit [1]. Vn nay c
cac nha nghin cu cng nh cac can b trc tip quan ly d an giai quyt tng bc bng cac phng
phap va thut toan khac nhau. Cho n nay, phng phap giai bai toan TCO co th chia thanh ba
nhom: Cac phng phap tim kim (heuristic methods) in hinh la cac phng phap cua Fondahl,
Prager, Siemens; Cac phng phap quy hoach toan hoc in hinh la phng phap quy hoach tuyn
tinh (Linear Programming - LP) va phng phap quy hoach nguyn (Integer Programming - IP)
Tuy nhin i vi nhng d an xy dng ln, phc tap i hi phai co cng c u manh, tin
cy gip ngi quan ly a ra nhng quyt nh chinh xac thi cac thut toan k trn cn nhiu han
ch. Do vy, trong nhiu nm gn y mt s cng trinh nghin cu a cng b kha nng ap dng
nhng thut toan tin hoa mi giai nhng bai toan nay. in hinh la Zheng va c ng s [5], Sultana
Parveen va Surajit Kumar Saha [6], Li-hui Zhang va c n g s [7] a dng thut toan di truyn (Genetic
Algorithm - GA); Pham Hng Lun va Dng Thanh Nhn [2], Rajesh Shrivastava [8] s dng thut
toan ti u an kin (Ant Colony Optimization - ACO) Trong bai bao nay se trinh bay kt qua
nghin cu khi ap dng thut toan tin hoa vi phn (Differential Evolution - DE) giai bai toan TCO
cho nhng d an khng lp lai (Non-repetitive Projects). Thng qua kt qua khi giai mt bai toan c
th tin hanh so sanh hiu qua cua thut toan DE vi cac thut toan tin hoa khac.
2. Xy dng bi ton TCO (Time - Cost Optimization)
Mt d an co th chia thanh N cng vic khac nhau, mi cng vic Ni co khi lng cng
vic la Qi. Trong qua trinh tin hanh cac cng vic thc hin theo mt logic nht nh (ct 4 bang 1).

i vi mi dang cng vic co P ij phng an thc hin (ct 5) tng ng vi thi gian t ij (ct 6) va gia
thanh cij (ct 7).
Bang 1: M ta cac s liu c ban cua mt d an
Khi
Loai cng Logic thc Cac phng
Chi phi
Cng vic
Thi gian
Ghi ch
lng
vic
hin
an co th
trc tip
(1)
(2)
(3)
(4)
(5)
(6)
(7)
(9)
P1,1
t1,1
c1,1
P1,2
t1,2
c1,2
1
Q1

P1,n1
t1,n1
c1,n1
P2,1
t2,1
c2,1
P2,2
t2,2
c2,2
2
Q2
1

P2,n2
t2,n1
c2,n1

QN

(N-1)&
(N-3)

PN,1
PN,2

PN,nN

tN,1
tN,2

t1,nN

cN,1
cN,2

cN,nN

Ngoai chi phi trc tip cn chi phi gian tip c gt (ng/ .v thi gian); Khi quy nh thi gian
thc hin d an cn phai thm kinh phi thng phat ctp (ng / .v thi gian)
Nu ky hiu Fi la thi im kt thc tng cng vic thanh phn thi thi gian thc hin d an
Tobj se la thi im kt thc cng vic cui cng th N.

Tobj FN f t t1, j1 , t 2, j 2 ,..., t N , jN ;

C obj Tobj .c gt Ta Tobj .ctp ci , j ; j j1 ,.., j N ;

(1)

i 1

Trong cng thc (1) ch s j la cac kha nng la chon phng an thc hin cho tng bc
cng vic, iu o co ngha la: j1 1, n1 ; j 2 1, n 2 ; ..., j N 1, nN ; Mt khac ham tinh
thi gian thc hin d an Tobj f t t1, j1 , t 2 , j 2 ,..., t N , jN ; khng th biu din di dang giai tich
tng minh mt cach tng quat do ph thuc vao logic thc hin cng vic cng nh thi gian thc
hin chng. Nh th thi gian thc hin d an cng nh chi phi cn thit hoan toan ph thuc vao vic
la chon phng an thc hin tng cng vic va logic thc hin chng, biu thc (1) co th vit lai
nh sau:
Tobj FN f t P1, j1 , P2 , j 2 ,..., PN , jN ;
(2)
C obj Tobj .c gt Ta Tobj .ctp f c P1, j1 , P2, j 2 ,..., PN , jN ;

Cac phng an thi cng la chon Pij se nhn nhng gia tr nguyn trong tp xac nh. Tng
quat hn, nu ky hiu x1 P1, j1 ; x 2 P2, j 2 ;...; x N PN , jN ; thi biu thc (2) chuyn thanh:
Tobj FN f t x1 , x 2 ,..., x N ;
(3)
C obj Tobj .c gt Ta Tobj .ctp f c x1 , x 2 ,..., x N ;

Khi nay bai toan ti u thi gian thi cng va chi phi c phat biu nh sau:
Tm tp {x*}= {x1, x2, , xN} sao cho
Tobj & Cobj Ti u;
(4)
vi x1 {1,..,n1}; x2 {1,..,n2}; .; xN {1,..,nN};
Nh vy bai toan (4) thuc dang bai toan ti u a mc tiu vi cac bin nguyn, phng
phap giai se c trinh bay c th nhng ni dung tip sau.
3. Ti u a mc tiu (Multi-Objective Optimization)

Dang toan hoc cua bai toan ti u a mc tiu:

Tim tp
x = (x1, x2, , xD) ; vi x RD;
Sao cho cac ham
fk(x) Ti u; vi k = 1, 2, , K; (K 2)
(5)
Trong thc t cac ham mc tiu thng xung t nhau co ngha la tt ca K ham mc tiu
khng th at cc tr ng thi. Nh th mt nghim tt nht cho bai toan la khng d xac nh. Mt
li giai c cho la tt nht thng la mt s tha hip gia cac mc tiu va ph thuc vao ham mc
tiu c anh gia la quan trong nht. Nu mi ham mc tiu c gn thm trong s ch ra tm quan
trong cua no thi nghim bai toan se tr nn r rang hn.
Vic s dng trong s cho php chuyn bai toan ti u a mc tiu thanh bai toan ti u mt mc
tiu va co th giai c bng nhiu phng phap khac nhau. Bai toan chuyn i c vit nh sau:
Tim tp
x = (x1, x2, , xD) ; vi x RD;
K

f ' ( x ) w k f k ( x ); Ti u; (K 2)

Sao cho cac ham

(6)

k 1

Cac phng phap xy dng trong s cho bai toan ti u a mc tiu nh sau:
- Trong s u tin: c gan cho mi ham mc tiu da trn c s hiu bit cua chng ta v
vai tr cua tng mc tiu trong ca h thng.
- Trong s phat trin: Da trn c s thng tin thu c t tp cac nghim thu c khi giai
ma gia tr cua mi trong s se thay i.
- Trong s khng u tin: Trn c s mt tp nghim kha d a tim c, xac nh mt cach
khng tng minh mt tp cac trong s tng ng.
4. Phng php trng s cho bi ton TCO (MAWA)
Bai toan ti u thi gian - gia thanh cho d an xy dng (hoc thi cng mt cng trinh) la bai
toan hai mc tiu, trong no tn tai nhiu ni dung xung t nhau. giai bai toan nay nhiu tac gia a
s dng phng phap trong s. Phng phap trong s thich ng cai tin (Modified Adaptive Weight
Approach - MAWA) do Zheng va cng s xut nm 2004 [5] giai bai toan TCO trn c s thut
toan GA. Phng phap nay c cac tac gia Pham Hng Lun va Dng Thanh Nhn [2] ap dng giai
thanh cng m hinh tng t bng thut toan ACO. Ni dung cua phng phap MAWA co th tom tt
nh sau:
Vi ky hiu
Tobj - Gia tr ham mc tiu tng thi gian.
Cobj - Gia tr ham mc tiu tng chi phi.
max
min
max
min
min
max
min
C

C
Tobj
vc C obj
/ C obj
C obj
;
* Nu
:
obj
obj & Tobj

min
max
min
vt Tobj
/ Tobj
Tobj
;

v v c vt ;
wc v c / v ; wt vt / v ;
max
min
max
min
* Nu Cobj Cobj & Tobj Tobj :
max
obj

* Nu C

min
obj

max
obj

&T

min
obj

wc wt 0.5 ;
wc 0.1; wt 0.9 ;

&T
T :
wc 0.9 ; wt 0.1;
* Nu C C
Khi nay bai toan TCO c vit di dang:
max
mzx
Tobj
Tobj
Cobj
Cobj
f ( x ) wt max min
wc max
min
Tobj Tobj
Cobj Cobj

max
obj

min
obj

max
obj

min
obj

(7)

max
max
Cobj
; Tobj
- La gia tr cc ai cua ham gia thanh va thi gian trong tp cac phng an a
chon (qun th ang xt);
min
min
Cobj
; Tobj
- La gia tr cc tiu cua ham gia thanh va thi gian trong tp cac phng an a
chon (qun th ang xt);
wc ; wt - Trong s tng ng vi ham gia thanh va thi gian;
- S ngu nhin phn b u trong khoang (0, 1);

Cobj - Tng gia thanh ng vi mt nghim {x} nao o cua tp nghim ang xt;
Tobj - Tng thi gian ng vi mt nghim {x} nao o cua tp nghim ang xt;
f(x) - Gia tr mi cua ham cho mi ca th khi chuyn thanh mt mc tiu.
max
min
Trong qun th ang xt, khi ma C obj C obj thi gia tr Cobj cua mt ca th bt k se nm
trong pham vi cua hai gia tr Min va Max. Tinh trang cng tng t i vi gia tr T obj. Nu nh ca hai
ham mc tiu at c trang thai nh trn thi gia tr ham f(x) se tin ti 1 va {x} {x*} co ngha bai
toan (7) la tim gia tr cc ai cua ham f(x). Khi mt trong hai ham mc tiu khng at trang thai trn
thi ham f(x) khng th bng 1.
5. Thut ton tin ha vi phn (DE) v bi ton TCO
5.1. Ni dung thut ton DE
Trn c s y tng cua thut toan GA, nm 1995, Rainer Storn va Kenneth Price a xut
mt thut toan mi vi tn goi la Differential Evolusion - DE [9]. Mc d thut toan vn bao gm cac
toan t c ban nh GA nhng ni dung cua mi toan t a c thay i. Thut toan DE khng x ly
tng bit trn chui GEN nh GA, co ca th mi DE s dng thng tin cua nhiu ca th c chon
ngu nhin. iu khac bit na cua DE la lam vic ng thi trn hai qun th do o no khc phc
c nhiu nhc im cua GA va tao ra mt thut toan mi tin cy vi tc hi t cao hn. Phin
ban u tin thut toan DE [4][9] gm 5 bc nh th hi n trn hinh 1. Cho n nay ni dung cua
thut toan DE theo 5 bc trn la thut toan c s cho moi cai tin khac va c xem la DE tiu chun
(DE Standar).

2
Vng l p

Qun thban
u
[X]g c to ngu nhin,
cc qun thtip theo
[X]g+1 = [Y ]g

t bin

Qun th[V]g c to ra do
t bin cc c thtrong
qun th[X]g.

[X]g

[Y]g
[V]g
No

5
Kim tra iu

[X]g
[X]g

kin dng
Yes
dng

[Y]g

c hn l c

Qun th[Y]g l kt qu
chn lc cc c thtt trong
[X]g v [U]g

l ai ghp

[U]g

Qun th[U]g l kt qu lai

ghp gia hai qun th
[X]g v [V]g

Hinh 1. S nguyn ly hoat ng cua thut toan DE

5.2. p dng cho bi ton ti u thi gian v chi ph TCO
Khi a chuyn bai toan TCO dang (4) thanh dang (7) thi ta co th giai c bng nhiu thut
toan khac nhau nh: Thut toan di truyn (Genetic Algorithm - GA) [4][5][6], thut toan ti u an
kin (Ant Colony Optimization - ACO) [2][7]. Tng t cac thut toan tin hoa khac, DE co th giai
c bai toan trn. Ni dung ng dng thut toan DE cho bai toan TCO nh sau:
- Bc 1: Xy dng qun th ban u vi np ca th. Chon ngu nhin trong min cho php cac
gia tr x1, x2, , xN theo cng thc (8) vi bl(1)=1, bu(1)=n 1; ;bl(N)=1, bu(N)=nN. Tng ng se co
c thi gian va chi phi cho tng cng vic thanh phn. Tinh T obj & Cobj theo cac biu thc a cho.
max
max
Sau khi c np ca th ph hp ta a xy dng xong qun th [X]g. Xac nh Cobj & Tobj va
min
min
Cobj
& Tobj
cua qun th [X]g. Tinh gia tr trong s wc, wt va gia tr f(x) cho mi ca th. Chuyn sang

bc 2.

- Bc 2: Bng cng thc (9) xy dng qun th t bin [V]g t qun th [X]g. Tng ng vi
cac gia tr vij co c thi gian va chi phi cho tng cng vic. Tinh T obj & Cobj nh bc 1. Sau khi
max
max
min
min
c np ca th ph hp ta a xy dng xong qun th [V]g. Xac nh Cobj & Tobj va Cobj & Tobj cua
qun th [V]g. Tinh gia tr trong s wc, wt va gia tr f(x) cho mi ca th. Chuyn sang bc 3.
- Bc 3: S dng cng thc (10) tin hanh lai ghp gia qun th [X]g vi [V]g co [U]g.
Chuyn sang bc 4.
- Bc 4: La chon cac phn t ph hp - co gia tr f(x) ln trong hai qun th [ X]g vi [U]g
tao thanh [Y]g. Qun th [Y]g se bao gm nhiu ca th u t hn so vi vi [X]g va [U]g. Tip tc
chuyn sang bc 5.
- Bc 5: Kim tra iu kin dng theo cng thc 12. Nu iu kin dng tha man thi kt thc
tinh toan va in kt qua cui cng. Nu cha tha man thi quay lai bc 2.
Trn c s cac bc tinh toan nh trinh bay, cac tac gia lp trinh va tinh toan mt vi d c th
theo cac s liu cua bai toan a c Zheng va c ng s [5] giai nm 2002 bng thut toan di truyn
GA va gn y Pham Hng Lun va Dng Thanh Nhn [2] giai nm 2010 bng thut toan ACO.
6. V d minh ha
6.1. Nhng s liu ban u
Bang 2. S liu ban u cho vi d tinh
TT Cng
Logic thc
Cac
Thi gian Chi phi trc
Tn cng vic
Ghi ch
vic
hin
phng an
(ngay)
tip ($)
(1)
(2)
(3)
(4)
(5)
(6)
(7)
1
14
23000
1
Chun b mt bng
2
20
18000
3
24
12000
1
15
3000
2
18
2400
3
20
1800
2
Ch tao ct thp
1
4
23
1500
5
25
1000
1
15
4500
3
ao mong
1
2
22
4000
3
33
3200
1
12
45000
San xut dm b
4
1
2
16
35000
tng
3
20
30000
1
22
20000
2
24
17500
b tng mong va
5
2&3
ct
3
28
15000
4
30
10000
1
14
40000
Vn chuyn, phn
6
4
2
18
32000
b dm BT
3
24
18000
1
9
30000
7
Lp dng cac dm
5&7
2
15
24000
3
18
22000
Cac thng s khac gm: Thi gian cho d an khng vt qua 70 ngay; Thng, phat cho vic hoan
thanh d an sm hoc mun: ctp=$1000 /ngay; Chi phi gian tip cho d an: cgt =$1500/ngay.
6.2. Kt qu tnh
Kt qua giai bai toan theo thut toan DE va so sanh vi cac kt qua khac cho trn bang 3. Kt
qua chi tit cua m hinh DE-TCO trinh bay trn bang 4.
Bang 3. Kt qua giai bai toan theo GA, ACO va DE
Li
GA-base TCO model [4]
ACO-base TCO model [2]
DE-base TCO model

giai
1
2
3
4

Thi gian
67
63
63

Chi phi
222300
218500
220400

Thi gian
67
63
62
60

Chi phi
233000
225000
233000
233500

Thi gian
63
63
61
60

Chi phi
218500
220400
225000
223500

Ca ba m hinh u ch ra cac phng an co th la chon khac nhau, bai toan khng th co

nghim duy nht. Do c im cua bai toan va tinh cht cua bin (nguyn). M hinh GA-TCO khng
ch ra phng an 60 ngay, trong khi o vi thi han nh vy m hinh DE-TCO cho kt qua chi phi it
hn m hinh ACO-TCO cho thy vic chon phng an thi cng (P ij) trong m hinh DE-TCO hp ly
hn. Vi m hinh DE-TCO cac tac gia a tinh toan nhiu ln va thy rng xac sut cho nghim theo
li giai 1 la 15%, li giai 4 la 80%, cn lai la li giai 2&3.
Bang 4. Kt qua chi tit khi giai bai toan bng thut toan DE
Cng
Cac la
Cng
Cac la
B
Ngay Chi phi
A
Ngay
Chi phi
vic
chon
vic
chon
1
1
14
23000
1
1
14
23000
2
1
15
3000
2
1
15
3000
3
1
15
4500
3
1
15
4500
P/A
P/A
63 ng.
4
2
16
35000 60 ng.
4
1
12
45000
218500$
5
2
24
17500 223500$
5
1
22
20000
6
3
24
18000
6
3
24
18000
7
1
9
30000
7
1
9
30000
Hinh 2 trinh bay chi tit th t, thi im thc hin cac bc cng vic trong hai phng an
60 ngay va 63 ngay.
ph ng n A
Cv.6
Cv.4
Cv.3
Cv.2

Cv.1

10

15

20

Cv.7
Cv.5

25

30

35

40

45

50

55

60

55

60 63

ph ng n B

Cv.4
Cv.3
Cv.2

Cv.1

10

Cv.7

Cv.6
Cv.5

15

20

25

30

35

40

45

50

Hinh 2. Chi tit b tri cng vic theo hai phng an 60 va 63 ngay
7. Mt vi nhn xt v kt lun
Bng chng trinh tinh xy dng trn c s cac ly thuyt a trinh bay, bai toan TCO a c
giai mt cach hiu qua. Cac phng an ch ra theo m hinh DE-TCO ph hp va co phn hp ly hn
kt qua thu c t cac m hinh tin hoa khac cng nh khi giai bng s mang truyn thng.
Cac thut toan ti u tin hoa khng ch ph hp vi bai toan xy dng k hoach quan ly cac
d an xy dng noi ring ma cn co th ap dng cho cac d an chung thuc cac lnh vc khac. Trn c
s ly thuyt a nu trn co th xy dng nhng chng trinh tinh cho nhng trng hp phc tap hn
so vi vi d c a ra trong bai bao.
Cn tip tc nghin cu so sanh khng nh nhng u im cua m hinh DE-TCO va ap dng
cho cac d an co tinh lp lai (Repetitive Project) nh cac d an xy dng nha cao tng, cu, ng,
ng hm co xt n vic s dng lin tc ngun lc.

TI LIU THAM KHO

[1] Bi Trong Cu (2009). C s ti u hoa thi gian va chi phi trong thit k t chc thi cng, Tap
chi Cu ng Vi t Nam, s 3-2009.
[2] Pham Hng Lun, Dng Thanh Nhn (2010). Nghin cu ng dng thut toan ACO (Ant
Colony Optimization) ti u hoa thi gian va chi phi cho d an xy dng, Tap chi phat trin
KH&CN, tp 13 s Q1-2010, tr.17-30.
[3] Nguyn inh Tham (2001). T chc xy dng. Nha xut ban KHKT, Ha Ni.
[4] Nguyn Quan Thng, Bi c Nng (2013). So sanh thut toan GA, DE, PSO khi giai bai toan
ti u kt cu h dan, Tuyn tp Hi ngh khoa hoc toan quc C hoc vt rn bin dang ln th
11, TP HCM, 11/2013;
[5] Zheng, Daisy XM, T. S. T. Ng, and Mohan M. Kumaraswamy (2002). "Applying genetic
algorithms techniques for time-cost optimization." Proc., 18th Annual Conf. ARCOM. University
of Northumbria, Middleborough, UK.
[6] Sultana Parveen, Surajit Kumar Saha (2012). GA Base Multi-Objective Time-Cost Optimization
in a Project with Resources Consideration, International Journal of Modern Engineering
Research (IJMER), Vol.2, Issue.6, Nov-Dec. 2012, pp 4352-4359;
[7] Li-hui Zhang, Xin Zou and Zhi-xiong Su (2013). GA Optimization Model for Time/Cost Tradeoff Problem in Repetitive Considering Resource Continuity, Applied Mathematics &
Information Sciences; Published online 1 Mar. 2013;
[8] Rajesh Shrivastava, Shweta Singh and G.C. Dubey (2012). Multi Objective Optimization of
Time Cost Quality Quantity Using Multi Colony Ant Algorithm, Int. J. Contemp. Math.
Sciences, Vol. 7, 2012, No.16, pp 773-784;
[9] K. Price, R. Storm, J. A. Lampinen (2005). Differential Evolution: A Practical Approach to Global
Optimization. 1st ed. New York, Springer.