TP CH PHT TRIN KH&CN, TP 13, S Q1 - 2010

NGHIN CU NG DNG THUT TON ACO (ANT COLONY OPTIMIZATION)

TI U THI GIAN V CHI PH CHO D N XY DNG
Phm Hng Lun (1), Dng Thnh Nhn(2)
(1) Trng i hc Bch Khoa, HQG-HCM
(2) Cng ty CP Ti tr v Pht trin a c R.C
(Bi nhn ngy 30 thng 09 nm 2009, hon chnh sa cha ngy 24 thng 12 nm 2009)

TM TT: Bi ton ti u thi gian - chi ph l mt trong nhng kha cnh quan trng nht ca
qun l d n xy dng. cc i ha li nhun, cc nh lp k hoch xy dng phi c gng tm
cch ti u ng thi thi gian v chi ph. Trong nhiu nm qua, nhiu nghin cu c thc hin
nhm nghin cu mi quan h thi gian - chi ph, cc k thut c ng dng t phng php tm kim,
phng php ton hc cho n thut gii di truyn. Trong bi bo ny, mt thut ton ti u da trn
nn tng ca s tin ha, vi tn gi ti u n kin (ACO) c ng dng gii quyt bi ton ti u
a mc tiu thi gian - chi ph. Bng cch kt hp vi phng php trng s thch ng sa i (MAWA),
m hnh s tm ra cc li gii ti u. M hnh ACO-TCO s c php trin bng mt chng trnh
my tnh trn nn Visual Basic. Mt v d s c phn tch minh ha kh nng ca m hnh cng
nh so snh vi cc phng php trc y. Kt qu ch ra rng phng php ny c kh nng tm ra
nhng kt qu tt hn m khng cn s dng qu nhiu n my in ton, t cung cp mt phng
tin hu hiu h tr cc nh lp k hoch v qun l trong vic la chn nhng quyt nh v thi
gian chi ph mt cch hiu qu.
T kha: Ant colony optimization (ACO), genetic algorithm, GA, MAWA, ACO-TCO.
1. GII THIU

dng u phi hon thnh khng nhng ng

thi gian tin m phi vt tin ra .

Vi s ra i ca cc sng kin cng nh

cc k thut xy dng hiu qu, cc sng kin
trong qun l v cc phng php phn pht,
thi gian xy dng c ci thin mt cch
r rt trong vng vi thp k gn y. Trn
quan im ca ch u t, mt d n kt thc
sm s gip gim bt khon n v ti chnh v
cho php h thu li ngun vn u t sm hn.
Mt khc, cc nh thu s tit kim c chi
ph gin tip v gim thiu c nguy c lm
pht cng nh s lng nhn cng nu thi
gian ca d n c th c rt ngn. Trn c s
ny, cc nh lp k hoch v qun l d n u
c gng bo m rng tt c cc hot ng xy

Bi ton ti u thi gian chi ph (timecost optimization TCO) l mt trong nhng

bi ton quan trng nht ca vic lp v qun
l d n. Cc nh qun l d n phi la chn
nhng ngun ti nguyn thch hp, bao gm:
kch c t i, vt t thit b, my mc cng
nh phng php v k thut thi cng thc
hin cc cng tc ca d n. Ni chung, c mt
mi quan h tng quan gia thi gian v chi
ph hon thnh mt cng tc; chi ph thp th
thi gian thc hin cng tc s ko di, v
ngc li. Nhng bi ton loi ny thng rt
kh gii quyt bi v chng khng c mt p

Trang 17

Science & Technology Development, Vol 13, No.Q1- 2010

n duy nht. V vy, nhim v ca cc nh

nh nhc im ring trong vic gii quyt bi

qun l d n l phi xem xt, nh gi mt

ton TCO. Tuy nhin, i vi cc d n ln vi

cch k lng nhiu phng php khc nhau

s mng ln, th c phng php tm kim

nhm t c mt kt qu cn bng ti u

cng nh phng php quy hoch ton hc u

gia thi gian v chi ph.

khng th t c li gii ti u mt cch

Cc phng php gii quyt bi ton

hiu qu. Vi mc tiu t c li gii ti u

TCO hin ti c th c chia thnh ba nhm:

cho bi ton TCO, nhiu nh nghin cu bt

phng php tm kim (heuristic methods),

u khm ph kh nng s dng cc phng

phng

php

php

quy

hoch

ton

hc

tin

tin,

nh

EOAs.

EOAs

(mathematical programming models) v cc

(evolutionary-based optimization algorithms) l

thut ton ti u da trn nn tng ca s tin

phng php nghin cu da trn vic m

ha

optimization

phng qu trnh tin ho ca th gii t nhin

algorithms_EOAs). Phng php tm kim l

hoc hnh vi x hi ca cc loi. Trong s cc

mt k thut tm kim da trn kin ch quan

EOAs, GAs (genetic algorithms) - thut gii di

ca ca ngi ra quyt nh. Cc phng php

truyn - c s dng rng ri nht nhm thu

tm kim tiu biu dng gii quyt bi ton

c li gii ti u cho cc bi ton ti u a

TCO gm : phng php Fondahl (1963),

mc tiu trong nhiu lnh. Chng hn, Feng v

phng php khung (Prager 1963), phng

cc cng s (1997) pht trin mt m hnh

php dc chi ph hiu qu (Siemens

GA m v c bn l s ci thin m hnh lai

1971), Phng php quy hoch ton hc s

ghp c pht minh bi Liu v cc cng s

dng cc chng trnh ton hc nh quy hoch

(1995). Feng v cc cng s (2000) pht trin

tuyn tnh (linear programming_LP), c gii

mt m hnh GA cho bi ton cn bng thi

thiu bi Kelly (1961), Hendrickson and Au

gian-chi ph trong xy dng. Bn cnh thut

(1989) v Pagnoni (1990) m hnh ha mi

gii di truyn, nhiu k thut EOA khc ly

quan h tuyn tnh gia thi gian chi ph.

cm hng t nhiu tin trnh khc nhau trong t

Ngoi ra, quy hoch s nguyn (integer

nhin cng c pht trin nh thut ton

programming_IP) c gii thiu bi Meyer &

memetic (Moscato 1989), ti u by n

Shaffer (1963) gii quyt c mi quan h

(Kenedy v Eberhart 1995)

(evolutionary-based

tuyn tnh v ri rc gia thi gian chi ph.

Vo u thp nin 90, mt thut ton vi

Gn y, Burns cng cc cng s (1996)

tn gi Ti u n kin (Ant Colony

pht trin mt m hnh lai ghp LP/IP nhm

Optimization_ACO) c xut nh l mt

thit lp p n chnh xc cho bt k khong

phng php mi trong vic tm kim li gii

thi gian mong mun no.

ti u cho nhng bi ton ti u a mc tiu.

C hai phng php tm kim v quy

hoch ton hc u c nhng im mnh cng

Trang 18

ACO ln tin c ng dng gii quyt bi

ton

ngi

thng

gia

TSP

(Traveling

TP CH PHT TRIN KH&CN, TP 13, S Q1 - 2010

Salesmen Problem), v gn y n c m

ch nh du ng i cho cc con theo sau.

rng v ci tin p dng cho nhiu bi ton

Vt mi ny s bay hi dn v mt i theo thi

ti u khc nhau.

gian, nhng n cng c th c cng c nu

Bi bo ny s i su nghin cu v ng

nhng con kin khc tip tc i trn con ng

dng thut ton ACO - l mt phng php tm

ln na. Dn dn, cc con kin theo sau s

kim nn cng l mt dng heuristic - gii

la chn ng i vi lng mi dy c hn,

quyt bi ton ti u a mc tiu TCO trong

v chng s lm gia tng hn na nng mi

mt d n xy dng. Vic pht trin mt

trn nhng ng i c yu thch hn. Cc

chng trnh my tnh da trn m hnh thut

ng i vi nng mi t hn rt cuc s b

ton c nghin cu, nhm kim tra kt qu

loi b v cui cng, tt c n kin s cng

da trn s liu ca mt d n xy dng thc t,

ko v mt ng i m c khuynh hng tr

cng nh so snh vi nhng phng php

thnh ng i ngn nht t t n ngun thc

trc y, cng s c xem xt trong bi bo

n ca chng (Dorigo v Gambardella 1996).

ny.

bt chc hnh vi ca cc con kin

thc, Dorigo xy dng cc con kin nhn to

2. THUT TON ACO

(artificial ants) cng c c trng sn sinh ra

ACO (Ant Colony Optimization Ti u

vt mi li trn ng i v kh nng ln vt

n kin) l mt phng php nghin cu ly

theo nng mi la chn con ng c

cm hng t vic m phng hnh vi ca n

nng mi cao hn i. Gn vi mi cnh

kin trong t nhin nhm mc tiu gii quyt

(i,j) nng vt mi ij v thng s heuristic

cc bi ton ti u phc tp.

ij trn cnh .

c gii thiu ln u tin vo nm 1991

Ban u, nng mi trn mi cnh (i,j)

bi A. Colorni v M. Dorigo, Gii thut kin

c khi to bng mt hng s c, hoc c

nhn c s ch rng ln nh vo kh

xc nh theo cng thc :

nng ti u ca n trong nhiu lnh vc khc

nhau. Khi nim ACO ly cm hng t vic
quan st hnh vi ca n kin trong qu trnh
chng tm kim ngun thc n. Ngi ta

ij = 0 =

m
, (i,j)
C nn

(1)

Trong :

khm ph ra rng, n kin lun tm c

ij: nng vt mi trn cnh i,j

ng i ngn nht t t ca chng n ngun

m : s lng kin

thc n. Phng tin truyn t tn hiu c

Cnn:

kin s dng thng bo cho nhng con khc

trong vic tm ng i hiu qu nht chnh l
mi ca chng (pheromone). Kin li vt

chiu di hnh trnh cho bi

phng php tm kim gn nht.

Ti nh i, mt con kin k s chn nh j
cha c i qua trong tp lng ging ca i

mi trn mt t khi chng di chuyn vi mc

Trang 19

Science & Technology Development, Vol 13, No.Q1- 2010

theo mt quy lut phn b xc sut c xc
nh theo cng thc sau:
k
ij

p =

nhin vi mt xc sut khng thay i trong

khong [0,1].

[ ij ] [ij ]
lNik

[ il ] [il ]

, j N

k
i

(2)

chn theo s phn b xc sut cho bi quy lut

k
ij

p : xc sut con kin k la chn cnh i,j

phn b xc sut theo cng thc (2).

Sau khi cng nh trong qu trnh cc con

: h s iu chnh nh hng ca ij

ij :

0qo1: l mt hng s cho trc.

J : l mt bin s ngu nhin c la

Trong :

q : gi tr c la chn mt cch ngu

thng tin heuristic gip nh gi

kin tm ng i, cc vt mi (i,j) trn mi

cnh s c cp nht li, v chng b bin i

chnh xc s la chn ca con kin khi quyt

do qu trnh bay hi cng nh qu trnh tch

nh i t nh i qua nh j ; c xc nh theo

ly mi khi cc con kin i trn cnh .

cng thc :

ij

Sau mi vng lp, vt mi trn mi cnh

= 1/dij

(3)

dij : khong cch gia nh i v nh j

c cp nht li theo cng thc sau:

ij(t+1) = (1-)ij(t) +

k =1

: h s iu chnh nh hng ca ij
k

Ni

0<1

Quy lut ny m phng hot ng ca mt

vng quay x s nn c gi l k thut bnh

c to ra mt cch ngu nhin. Con kin k

nh i s la chn nh j k tip i theo mt
quy tc la chn c m t bi cng thc
sau :

(t ) (i,j) (5)

: t l bay hi ca vt mi.

ij (t ) : lng mi m con kin k

k

li trn cnh ij, c xc nh nh sau :

xe x s.
Cho mt hng s 0q01 v mt s 0q1

k
ij

Trong :

: tp cc nh lng ging ca

i m con kin k cha i qua

Nu con kin k i
qua cnh (i,j)

ik, j = f (k )
0 Ngc li
Q

(6)

: l mt hng s.

f(k) : gi tr mc tiu trong mi vng lp.

arg max ( il ) ( il )
lN ik
j=

J
Trong :

Nu qq0
Ngc
li

(4)

3. TI U A MC TIU (MULTIOBJECTIVE OPTIMIZATION)

Bi ton TCO l mt bi ton ti u a
mc tiu. Khng ging nh nhng bi ton ti
u n mc tiu m li gii ti u tn ti mt

Trang 20

TP CH PHT TRIN KH&CN, TP 13, S Q1 - 2010

cch r rng, ti u a mc tiu thch hp i

Phng php c s dng c tn gi l

vi nhng bi ton c hn mt mc tiu i lp.

phng php trng s thch ng sa i

Bi ton TCO c m t bi mt chui li

(Modified

gii m ta khng d so snh, v rt kh nu

MAWA), c Zheng v cc cng s (2004)

khng mun ni l khng th thu c li gii

pht trin t phng php trng s thch ng

tt nht mt cch r rng cho tt c cc mc

(Adaptive Weight Approach AWA) xut

tiu. Mi mt hm mc tiu c th t c

bi Gen v Cheng (2000), v c s dng

iu kin ti u ca n ti nhng im khc

trong vic p dng thut gii di truyn cho bi

nhau nh vo s thiu ht tiu chun thng

ton TCO.

Adaptive

Weight

Approach

nht v s ti u. Do , cc nh lp k hoch

C th, trong phng php MAWA, cc

v qun l phi p dng s nh gi v mt k

trng s thch ng c tnh ton theo bn iu

thut ca h trong vic la chn p n tt nht

kin sau:

thu c t mt b cc p n ti u dc theo
bin Pareto (Zheng v cc cng s 2005).
c trnh by bi Vilfredo Pareto vo th
k 19, khi nim ti u Pareto l mt cng c
c chp nhn trong vic so snh gia hai p
n trong bi ton ti u a mc tiu m khng
c tiu chun thng nht v s ti u. Cc p
n nh th i hi phi hy sinh t nht mt mc
tiu khc khi mun ci thin bt k mt mc
tiu no (Gen v Cheng 2000). Mt p n (x*)
khng b tri bi mt p n (x) khc nu n c

max

(1) Nu Z t

Z cmin
c = max
Z c Z cmin

(7)

Z tmin
t = max
Z t Z tmin

(8)

= t + c

(9)

wt =

(10)

wc =

(11)

t nht mt tiu chun tt hn khi so snh vi

(x). Vng c nh ngha bi ti u Pareto
c gi l bin Pareto (Pareto front), v mc
tiu ca ti u a mc tiu l thit lp ton b
bin Pareto cho bi ton thay v ch c mt p
n n tt nht.
nh gi s ph hp ca li gii thu
c t m hnh, mt hm thch nghi (fitness
function) xem xt n yu t thi gian v chi
ph s c p dng cho bi ton ti u a mc
tiu TCO.

Z tmin v Z cmax Z cmin th :

max

(2) Nu Z t

= Z tmin v Z cmax = Z cmin th :

wt =wc = 0.5
max

(3) Nu Z t

(12)

= Z tmin v Z cmax Z cmin th :

wt = 0.9

(13)

wc = 0.1

(14)

max

(4) Nu Z t

Z tmin v Z cmax = Z cmin th :

Trang 21

Science & Technology Development, Vol 13, No.Q1- 2010

wt = 0.1

(15)

wc = 0.9

(16)

Trong :

min

Zc

: gi tr cc tiu theo mc tiu chi

ph trong tp hp cc p n Pareto thu c t

vng lp ca thut ton ACO.

: gi tr cc i theo mc tiu thi

: gi tr theo tiu chun v thi gian

gian trong tp hp cc p n Pareto thu c

: gi tr theo tiu chun v chi ph

: gi tr cho d n

max

Zt

t vng lp ca thut ton ACO.

min

Zt

: gi tr cc tiu theo mc tiu thi

gian trong tp hp cc p n Pareto thu c

t vng lp ca thut ton ACO.
Z

max
c

: gi tr cc i theo mc tiu chi

ph trong tp hp cc p n Pareto thu c t

vng lp ca thut ton ACO.

wc

: trng s thch ng theo tiu

chun v chi ph
wt

: trng s thch ng theo tiu chun

v thi gian
Sau khi tnh c cc trng s wt , wc tnh
hm kt hp thi gian & chi ph theo cng
thc :

ztmax zt +
zcmax zc +
f ( x) = wt max
+ wc max
zt ztmin +
zc zcmin +

(17)

Trong :
: hng s dng ngu nhin nm trong khong [0,1].

4. M HNH ACO CHO BI TON TCO

Vic p dng thut ton ACO gii quyt

bi ton TCO c th c minh ha nh sau :

4.1 M t bi ton

u tin, ta chuyn i bi ton TCO tr thnh

Bi ton ti u thi gian chi ph TCO

bi ton TSP. Sau , kt hp hai mc tiu thi

(time-cost optimization) l mt bi ton ti u

gian v chi ph thnh mt mc tiu nh vo

a mc tiu, trong cc p n l khng duy

phng php trng s thch ng sa i

nht. Bi ton TCO tp trung ch yu vo vic

MAWA. Cui cng, tm kim li gii ti u

la chn nhng phng n thch hp cho tng

da trn thut ton ACO.

cng tc nhm t c mc tiu v thi gian

v mc tiu v chi ph cho d n.

Trang 22

S biu din bi ton TCO di dng TSP

c m t trong hnh (1)

TP CH PHT TRIN KH&CN, TP 13, S Q1 - 2010

Cng tc 0

Cng tc i

Cng tc i+1

Cng tc num-act

Cng tc 1

.
.
.

.
.
.

k1

ki

.
.
.

ki+1

kn

Hnh 1. Biu din bi ton TCO di dng TSP

Mi nt trong hnh (1) biu th mt phng

n la chn thc hin cng tc. V d, nt
th j trn ct i (i=0,1,2,) cho bit rng cng
tc i thc hin theo phng n la chn j. Ct 0
l mt cng tc o i din cho im bt u
ca d n. Cc cnh trn hnh (1) c m t
bi mt ma trn vi 3 yu t, v d (i, j1, j2)

Trong :
(k )

ti

: thi gian thc hin cng tc th i

khi thc hin theo la chn th k.

(k )

xi

: bin s ca cng tc th i khi

(k )

thc hin theo la chn th k. Nu xi

= 1 th

miu t cng tc th i thc hin theo la chn

cng tc i thc hin theo la chn th k ; v

j1, trong khi cng tc i+1 thc hin theo la

ngc li nu xi

chn j2. Mi ng i t ct 0 n ct num-act

trnh by mt phng n thc hin ca d n.
Trn thc t, vic gii quyt bi ton TCO l
tp trung tm kim mt ng i c th lm
cho cc tiu tng thi gian cng nh tng chi

Tng thi gian v tng chi ph ca d n

c th c tnh ton ln lt theo cc cng

= 0.

Tng ca cc gi tr bin s ca tt c
cc la chn phi bng 1.
Lk

: chui cng tc trn ng

i th k ; Lk = {i1k, i2k, , ink}

ijk

ph ca d n.

: s ca cng tc j trn ng

i th k
L

: tp hp tt c cc ng i

ca s mng; L={Lkk=1,2,m}

thc (18) v (19) sau y :

(k ) (k )
T = max t i xi
iLk

(k )

m
(18)

: s ca cc ng i trong

s mng.

Trang 23

Science & Technology Development, Vol 13, No.Q1- 2010

C=

dc

(k ) (k )
i
i

i N

+ T ici

(k )

(19)

Trong :
(k )

dci

: chi ph trc tip ca cng tc

th i khi thc hin theo la chn th k, bng

vi s lng ca cc cng tc nhn vi n gi
ca chng.
ic

(k )
i

Bc 3 : Thit lp vng p n
(solution pool) v tm cc p n ti u
Pareto, t tn l E
Mc ch ca vic thit lp vng p n l
lm gim vic tnh ton lp li mt cch khng
cn thit trong sut qu trnh chy thut ton.
Khi to ra mt p n mi, trc tin s tm
kim trong vng p n. Nu p n ny

: chi ph gin tip ca cng tc

xut hin trong vng p n, th loi b n, nu

th i khi thc hin theo la chn th k, c th

khng th tnh ton gi tr theo cc cng

tnh ton bi cc chuyn gia bng cch c

thc (18) v (19). Ph hp vi nh ngha cc

lng hoc thu c t vic chia chi ph gin

p n ti u ca Pareto, xa i cc p n

tip ca ngn sch theo tng thi gian ca hp

khng tri t vng p n, phn cn li s to

ng.

thnh cc p n ti u Pareto E.

N : tp hp cc cng tc trong s
mng.
4.2 M hnh ACO-TCO
M hnh ACO-TCO c m t gm cc
bc chnh nh sau :
Bc 1 : Khi to cc p n ban u
Trc tin, tt c cc con kin nhn to
c t nt khi u. Tip theo, to ra mt

Bc 4 : Phn phi cc trng s cho

mc tiu thi gian v chi ph
max

Tm cc gi tr Z t

min

, Zt

max

, Zc

min

, Zc

trong E, sau phn phi cc trng s theo

mc tiu thi gian v chi ph da vo cc cng
thc t (7) n (16).
Bc 5 : Tnh ton gi tr kt hp ca
mc tiu thi gian v chi ph

cch ngu nhin mt ng i t nt khi u

Trong qu trnh chuyn i hai mc tiu

n nt kt thc cho mi con kin. iu ny

thi gian v chi ph thnh n mc tiu di

c ngha l mi con kin s chn la mt cch

dng trng s, ta s thu c gi tr kt hp ca

ngu nhin mt phng n thc hin cho mi

mc tiu thi gian v chi ph, gi tr ny c

cng tc to ra mt p n kh thi cho bi

s dng sa i cng mi trn ng i.

ton TCO.

Gi tr kt hp ca mc tiu thi gian v chi

Bc 2 : Tnh ton tng thi gian v

chi ph ca d n
Tnh ton tng thi gian hon thnh v

ph c tnh theo cng thc (17).

Bc 6 : Tnh ton gi tr cp nht ca
vt mi trn mi ng i sau mt vng lp

tng chi ph d n cho mi ng i c to

Sau mi vng lp, gi tr cp nht ca vt

ra bi mi con kin theo cc cng thc (18) v

mi trn mi cnh (i,j1,j2) c tnh ton theo

(19).

cng thc sau :

Trang 24

TP CH PHT TRIN KH&CN, TP 13, S Q1 - 2010

i , j1 , j2 =

Cui mi vng lp, cng ca vt mi

num _ ant

ik, j1 , j2

(20)

k =1

trn mi cnh c cp nht li theo quy tc

sau:

Trong :

i , j1 , j2 ( nc + 1) = . i , j1 , j2 ( nc ) + i , j1 , j2 (22)

num_ant : tng s lng kin

Trong :

i , j1 , j2 : gi tr cp nht ca vt mi

i , j1 , j2 : gi tr cp nht ca vt mi
k

m con kin th k li trn cnh (i,j1,j2), c

i , j1 , j2 (nc + 1) : vt mi trn cnh

(i,j1,j2) sau vng lp nc+1
[0,1] : l mt hng s, c trng

xc nh nh sau :

ik, j1 , j 2

vt mi trn cnh

(i,j1,j2) sau vng lp nc

trn cnh (i,j1,j2) sau mt vng lp

= f (k )
0

i , j1 , j2 (nc) :

Nu con kin k i
qua cnh (i,j1,j2)
Ngc li

cho t l tn ti ca vt mi trc ; nh vy
( 21)

1- c trng cho s bay hi ca vt mi.

Bc 8 : Tnh ton xc sut la chn

Q : l mt hng s, c trng cho lng

ng i trn mi cnh ca cc con kin

Kin la chn ng i da trn cng

mi m mt con kin li trn ng i.

f(k) : gi tr kt hp ca mc tiu thi
gian v chi ph ca p n th k, thu c t

mi v tm nhn ca mi cnh. Do , xc sut

la chn cho mi cnh c tnh theo cng
thc sau :

cng thc (17)

Bc 7 : Cp nht vt mi trn mi
cnh

pik, j1 , j 2 =

[ i , j1 , j 2 ] .[i , j1 , j 2 ]

u J k ( i )

i , j1 , u

] .[i , j1 ,u ]

, nu jJk(i)

(23)

Ngc li, pi , j1 , j 2 = 0
Trong :
k

pi , j1 , j 2 : xc sut con kin k la

chn cnh (i,j1,j2) i
: thng s iu chnh nh hng ca
vt mi i , j1 , j2

: thng s iu chnh nh hng ca

i , j , j
1

Jk(i): tp hp cc nt m con kin k

nt i cha i qua

i, j , j
1

: nng ca vt mi trn cnh

(i,j1,j2)

Trang 25

Science & Technology Development, Vol 13, No.Q1- 2010

i , j , j

: thng tin heuristic (hay cn gi

l tm nhn) gip nh gi chnh xc s la

chn ca con kin khi quyt nh i trn cnh

i, j , j
1

(i,j1,j2), tng trng cho thng tin cc b c

xem xt trong qu trnh ; c xc nh theo
cng thc :

(k )
(k )
dc imax
t imax
+1 dc i +1 + r
+1 t i +1 + r
= wc
+ w t max
min
dc imax

dc
+
r
t i +1 t imin
+1
i +1
+1 + r

[(

Vi :
max

dci +1 : gi tr cc i chi ph trc tip

arg max
j = uJ k (i ) i , j1 ,u

) ( ) ]

(24)

i , j1 ,u

(25)

ca cng tc i+1 theo nhng la chn khc

Trong :

nhau.

q : gi tr c la chn mt cch ngu

min

dci +1 : gi tr cc tiu chi ph trc tip

ca cng tc i+1 theo nhng la chn khc

nhin vi mt xc sut khng thay i trong

khong [0,1].
0qo1: l mt tham s cho trc.

nhau.

t imax
+1 : gi tr cc i v thi gian thc

hin cng tc i+1 theo nhng la chn khc

nhau.

J : l mt bin s ngu nhin c la

chn theo s phn b xc sut cho bi cng
thc (23).
Bc 10 :

min

t i +1 : gi tr cc tiu v thi gian thc

Thm p n mi t qu trnh vo vng

hin cng tc i+1 theo nhng la chn khc

p n, v cp nht cc p n ti u Pareto E.

nhau.

Lp li qu trnh t Bc 4 n Bc 10 cho
(k )

dci +1 : chi ph trc tip ca cng tc i+1

khi thc hin theo la chn th k
t

(k )
i +1

Bc 9 : La chn ng i cho mi
con kin
la chn thc hin mt cng tc, con
kin s s dng thng tin heuristic biu th bi
1

(16), (17), (20), (22), (23), (24), (25) ) c

tha mn.

: thi gian thc hin ca cng tc

i+1 khi thc hin theo la chn th k

i , j , j

n khi iu kin kt thc (phng trnh (7),

cng nh l thng tin v vt mi biu

th bi i , j1 , j 2 . Quy tc la chn c m t
bi cng thc sau y :

Trang 26

5. V D MINH HA
minh ha cho tnh hiu qu ca m
hnh xut, mt chng trnh my tnh ng
dng cc bc ca m hnh trn c thc
hin. Chng trnh c vit bng ngn ng
lp trnh Visual Basic 6.0. Vic thc hin m
hnh nhm c gng to ra mt chng trnh
thn thin v d s dng.

TP CH PHT TRIN KH&CN, TP 13, S Q1 - 2010

chng minh tnh chnh xc ca m hnh

D n bao gm 07 cng tc, vi quan h

da trn thut ton nghin cu, mt v d

gia cc cng tc, cc phng n thc hin

c xem xt gii quyt bng chng trnh ny.

cng vi thi gian v chi ph trc tip tng

V d ny c trch t ti liu [11]. V d

ng cho tng phng n c cho trong bng

(1) sau:

ny c gii thiu ln u tin bi Feng v

cc cng s (1997) v sau c gii li bi
Zheng v cc cng s (2004) bng phng
php GA.

Bng 1. Cc thng s ca d n
Cng tc

Cng tc trc

Phng n

Thi gian

Chi ph trc tip

(Task)

(Predecessor)

(Options)

(Duration)

(Direct cost)

14

23000

20

18000

24

12000

15

3000

18

2400

20

1800

23

1500

25

1000

15

4500

22

4000

33

3200

12

45000

16

35000

20

30000

22

20000

24

17500

28

15000

30

10000

14

40000

18

32000

24

18000

30000

15

24000

18

22000

2,3

5,6

Trang 27

Science & Technology Development, Vol 13, No.Q1- 2010

Trong , thi gian c n v l ngy cn
chi ph trc tip c n v l ($).

Ta gii bi ton vi cc thng s ca thut

ton ACO nhp vo chng trnh nh sau :

Ngoi ra, chi ph gin tip ca d n c

cho l 1500$ / ngy.
Bng 2 La chn cc thng s cho thut ton ACO
Thng s (Parameters)

Gi tr (Value)

S lng kin k

40

S vng lp

50

H s

H s

Thng s bay hi

0.9

q0

0.9

Nng mi ban u 0

Bng (3) trnh by so snh kt qu thu

c t chng trnh ACO-TCO vi kt qu

thu c ca phng php GA trong ti liu

[11].

Bng 3 So snh kt qu gia ACO v GA

GA-based TCO model

STT

ACO-TCO model

Time (day)

Cost($)

Time (day)

Cost($)

73

251,500

62

233,000

84

251,000

67

224,000

66

236,500

63

225,500

60

233,500

T kt qu so snh, ta thy li gii thu

c s dng thit lp nn m hnh

c t m hnh ACO-TCO l tt hn so vi

ACO-TCO, t c th ti u ng thi tng

kt qu thu c t [11], v c th ni ACO-

thi gian v tng chi ph ca d n. Bng cch

TCO la chn c nhng phng n thc

s dng phng php trng s thch ng sa

hin hp l cho bi ton.

i MAWA kt hp hai mc tiu ri rc thi

gian v chi ph thnh mt mc tiu, m hnh

6. KT LUN

xut tm ra cc tp hp li gii tt nht cho

Trong bi bo ny, mt thut ton ti u

bi ton ti u thi gian chi ph TCO. Li

c bit n vi tn gi ti u n kin ACO

gii cung cp cho cc nh lp k hoch v qun

Trang 28

TP CH PHT TRIN KH&CN, TP 13, S Q1 - 2010

l d n mt cng c hu hiu c th rt

c mt khong chi ph ng k cho d n.

ngn c tng tin cng nh tit kim

STUDY AND APPLY ACO ALGORITHM IN TIME-COST OPTIMIZATION OF

CONSTRUCTION PROJECT
Pham Hong Luan(1), Duong Thanh Nhan(2)
(1) University of Technology, VNU-HCM
(2) Real-estate and Finance Development Joint-stock Company
ABSTRACT: Time-cost optimization problem is one of the most important aspects of
construction project management. In order to maximize the return, construction planners would strive
to optimize the project duration and cost concurrently. Over the years, many researches have been
conducted to model the time-cost relationships; the modeling techniques range from the heuristic
method and mathematical approach to genetic algorithm. In this paper, an evolutionary-based
optimization algorithm known as ant colony optimization (ACO) is applied to solve the multi-objective
time-cost problem. By incorporating with the modified adaptive weight approach (MAWA), the
proposed model will find out the most feasible solutions. The concept of the ACO-TCO model is
developed by a computer program in the Visual Basic platforms. An example was analyzed to illustrate
the capabilities of the proposed model and to compare against GA-based TCO model. The results
indicate that ant colony system approach is able to generate better solutions without making the most of
computational resources which can provide a useful means to support construction planners and
managers in efficiently making better time-cost decisions.
Key words: Ant colony optimization (ACO), genetic algorithm, GA, MAWA, ACO-TCO
Discrete Optimization. Artificial Life

TI LIU THAM KHO

[1].

Alaya, I., Solnon, C. and Ghdira, K.

Ant Colony Optimization for Multi-

Journal, pp. 137-172, (1999).

[5].

colonies for the traveling salesman

objective Optimization Problems. IEEE

problem. BioSystems, 43, pp. 7381,

Computer Society, pp. 450-457, (2007).

[2].

Angus, D. J. Niching Ant Colony

Optimisation. Ph.D. thesis, Swinburne

(1997)
[6].

Approach to the Traveling Salesman

Australia, (2008).

Problem,

Dorigo, M. and Di Caro, G. Ant Colony

[4].

Dorigo,

M.,

Di

Caro,

G.

and

Gambardella, L. Ant Algorithms for

IEEE

Transactions

on

Evolutionary Computation, 1, pp. 5366,

Optimization: A New Meta-Heuristic.

IEEE Press, pp. 1470-1477, (1999).

Dorigo, M. and Gambardella, L., Ant

Colony System: A Cooperative Learning

University of Technology, Melburne,

[3].

Dorigo, M. and Gambardella, L. Ant

(1997)
[7].

Dorigo, M., Maniezzo, V. and Colorni,

A. , The Ant Systems: Optimization by a
colony of cooperating agents, IEEE

Trang 29

Science & Technology Development, Vol 13, No.Q1- 2010

Transactions on Systems, Man and
Cybernetics, Part B,

26(1):5366,

(1996)
[8].

[9].

System, Future Generation Computer

Systems, 16(8), 889-914, (2000)

Dorigo, M. and Sttzle, T. , The Ant

Colony

[10]. Sttzle, T. and Hoos, H., MAX-MIN Ant

Optimization

[11]. Zheng, D. X. M., Ng, S. T. and

Metaheuristic:

Kumaraswamy, M. M., Applying a

Algorithms, Applications and Advances.

Genetic Algorithm-Based Multiobjective

Technical Report, IRIDIA, (2000).

Approach for Time-Cost Optimization,

Dorigo, M. and Sttzle, T., Ant Colony

Journal of Construction Engineering

Optimization,

and Management, 130(2), pp. 168-176,

The

Cambridge, MA,(2004)

Trang 30

MIT

Press,

(2004).