Tp ch Cu ng - Hi Cu ng Vit Nam, s 4/2008

1
Phng php Phn tch u tin ho trong H thng Qun l Mt ng:
Tng quan v Hng pht trin
(Methodologies of Prioritization used in Pavement Management System:
Comprehensive Overview and Prospective Development)

ThS. inh Vn Hip
Ging vin, B mn ng t v ng th,
Khoa Xy dng Cu ng, Trng i hc Xy dng
Email: dvhiep.huce@gmail.com

Tm tt: M hnh phn tch u tin ho cc phng n u t c mc d n v mc mng
li c xem l cu phn ct li cho cng tc thit lp h thng QLM nhm gip cho cng tc
QL&BT em li hiu qu cao v kinh t trong cc iu kin hn ch v ngun vn. Bi vit ny
tng qut cc phng php tip cn v cc m hnh phn tch u tin ho s dng trong h thng
QLM, a ra ci nhn ton din v nhng nh hng cho vic p dng v pht trin m hnh
phn tch cho hp l ng vi tng iu kin c th ca mng li ng v phm vi ca n v
qun l. Bn cnh , bi vit cp n nh hng pht trin m hnh ti u ho hp nht cho
vic qun l cc ti sn thuc mng li ng b khi xem xt ng thi nhiu h thng cng
trnh hoc cc phn khu qun l khc nhau.

Abstract: A major task of pavement management system (PMS) is to prioritize investment
alternatives at both network and project levels to obtain maximum benefit or minimum total cost
subject to budget constraint. The paper overviews comprehensively methodologies of prioritization
used in PMS and identifies appropriate applications according to the nature and situation of road
networks or road agencies. In addition, the paper presents future directions to develop a unified
optimization procedure for managing a road asset system, which consists of various structure
components or different road agencies.

1. Gii thiu
Mng li ng b hin nay v ang tng i hon thin rt nhiu nc, c bit l cc
nc pht trin. S tp trung vo vic xy dng cc tuyn mi v ang chuyn dn sang vic
qun l v bo tr (QL&BT) h thng mng li ng hin c. Trong , h thng mt ng
khng nhng cn ngun vn u t rt ln cho vic xy dng ban u (thng chim t 60 70 %
tng chi ph) m cn cn nhiu chi ph cho cc cng tc QL&BT sau ny. Do vy, h thng qun
l mt ng (QLM) c thit lp nhm gip cho cng tc QL&BT em li hiu qu cao v
kinh t v p ng mc phc v mong mun trong cc iu kin hn ch, thng l ngun vn
hn hp v rng buc v chnh sch cp vn. H thng qun l ny c hnh thnh u tin mt
s bang ca M t nhng nm 1960, sau c m rng v pht trin trong sut nhng thp
nin qua v em li nhiu li ch cho cng ng.
Ti Vit Nam trong nhng nm gn y, Chnh ph tp trung ngun vn u t ln vo pht
trin v hon thin mng li ng b. Bn cnh , cc nh qun l ang n lc xy dng h
thng QLM hiu qu c v mt kinh t v k thut thng qua mt s d n tiu biu, nh l D
n tng cng nng lc qun l mng li ng b (1), D n nng cp mng li ng b -
Hp phn xy dng th ch v qun l ng b (2), v D n nng cp ng b giai on 3 -
Thc thi pht trin chnh sch ngnh (3). Mt trong nhng cu phn chnh ca h thng qun l
ny l vic phn tch u tin ho d n u t c mc d n v mc mng li trong
nhng iu kin hn ch v ngun vn. Trong iu kin Vit Nam, y l vn cn mi v
nhng nghin cu tng hp cho vn ny vn cn hn ch. Do vy, mc ch ca bi vit s tng
qut cc phng php tip cn v cc m hnh phn tch u tin ho, thng qua vic phn tch cc
u v nhc im ca chng khi ng dng trong h thng QLM. Cui cng, bi vit a ra mt
s nhn xt cho vic ng dng cc phng php v m hnh sao cho ph hp vi quy m ca tng
mng li, phm vi ca n v qun l, v m bo tnh ph hp vi xu hng pht trin.
2. Chc nng ca phn tch u tin ho
Mt trong cc cu phn chnh ca h thng QLM l vic phn tch u tin cc phng n u t
( c mc d n v mng li) di ngun vn bit trc, v thng b hn ch hoc rng buc
v chnh sch phn b. Cc hnh thc phn tch u tin thay i t vic sp xp u tin nh tnh
n gin n cc hnh thc ti u ho chnh xc phc tp. Mc d vy, tt c cc hnh thc u tin
ho cho cng tc QLM mc mng li u hp nht 4 bc chnh c bn nh th hin trn
Hnh 1, l cung cp v x l thng tin, xc nh nhng vic cn hin ti v tng lai, phn
tch u tin, v lp bo co cng vi cc kin ngh cho k hoch cng vic (4). ng thi, cc hnh
thc ny u cn phi tr li nhng cu hi sau:
1. La chn d n: D n (on tuyn)
1
no nn c nng cp, ci to hoc bo tr?
2. La chn cc gii php cng vic: Cc cng vic c nng cp, ci to, hoc bo tr nh
th no?
3. La chn thi gian: Khi no cc cng vic nn c thc hin?
Khi cc gii php u t c ti u ho hon ton th tt c cc t hp c th c ca 3 cu hi
trn u phi c xem xt v nh gi c th. Tuy vy, phng php tip cn khi xem xt cc cu
hi ny c th khc nhau nh c trnh by trong phn tip theo.
Thu thp v x l thng tin (mc
phc v, h hng, s liu v
kt cu, giao thng, mi trng,
n gi, )
Xc nh s
cn thit hin
ti v trong
tng lai
Mc
can thip
Thi gian lp
k hoch
M hnh xung
cp
Phn tch u tin:
Sp xp u tin
hay Ti u ho
Hn ch v
ngun vn
Chin lc cc
phng n
Bo co Kt qu:
1. Kin ngh k hoch cng vic
2. Phn tch nhy ca cc trng hp
ngun vn khc nhau
M hnh xung
cp

Hnh 1: Cc bc c bn trong phn tch u tin ho




Tp ch Cu ng - Hi Cu ng Vit Nam, s 4/2008

2
1
on tuyn y c xem l cc on ng nht c cc c tnh c bn ng u.

Tp ch Cu ng - Hi Cu ng Vit Nam, s 4/2008

3
2. Phng php tip cn trong qun l mt ng
C 2 phng php tip cn c bn trong m hnh QLM, l phng php tip cn xui (top-
down) v phng php tip cn ngc (bottom-up) (5, 6). Phng php xui thc hin nhng
phn tch ng thi cho ton b mng li ng, khi bt k on ng no thuc mng li
u c xem xt trong phn tch. Phng php da trn m hnh ti u ho vi mc tiu l xc
nh chin lc cng vic ti u sao cho ti a ho li ch thu c hoc ti thiu ho tng chi ph
ca nh qun l v ngi s dng ng, trong khi m bo nhng tiu ch ca mng li do
ngi s dng nh trc nh l tnh trng mng li mong mun hay cc iu kin hn ch v
chnh sch ngun vn. Cc chin lc ti u xc nh c t phn tch s a ra ng li ch
o trong vic la chn cc d n thc t cho cng tc ng.
Cch tip cn ny s cho php ngi s dng xem xt mi quan h hp l gia cng vic, nh l
gia ci to v duy tu ngn nga. C ngha, vi mt ngun vn nht nh, c th chn cc cng
vic ci to cho mt s lng nh cc on tuyn hoc la chn gii php duy tu ngn nga cho
nhiu on tuyn hn. Trong qu trnh phn tch, nhng cu hi mang tnh chin lc Ci g nn
lm? s c nu ra u tin m bo tiu ch v mc phc v ca mng li di iu
kin ngun vn hn hp. Tip theo, cu hi mang tnh k hoch Ci g s c lm? s c
xem xt trn c s ca nhng ch dn c xc lp t bc chin lc trc . Cui cng, cu
hi mang tnh thc thi Ci g c lm? hay K hoch c thc thi nh th no? c
xem xt bng vic theo di tin trnh thc hin ca mi d n t giai on chun b n khi kt
thc v thu thp cc phn hi t thc t cng vic ca d n.
Ngc li vi phng php tip cn xui, phng php tip cn ngc s la chn cc d n trc
da trn nhng phn on mang tnh k thut, ngng can thip tnh trng h hng hoc tui th
d bo cn li ca mt ng. Cc chi ph (C) v li ch (B) ca mi d n c nh lng, sau
da trn t s B/C cc d n s c sp xp theo th t u tin gim dn. Vi ngun vn c
bit, ngi lp k hoch s d tm dc theo danh sch c sp xp theo mc u tin la
chn cho n khi ton b ngun vn c s dng ht. Nhc im ca phng php tip cn ny
l cc quyt nh ti u cho tng d n ring l khng phn nh c tiu ch ti u ca ton mng
li. Bi v quyt nh ti u ca mng li da trn tiu ch mc phc v ca ton mng li
hn l cho tng d n ring l. Tiu ch mng li c th v d nh chiu di ng ca mng li
t nht l 80% trong iu kin tt v khng ln hn 5% trong iu kin xu.
Kinh nghim thc t cho thy rng vic s dng phng php tip cn xui c th gim ng k
chi ph cho cng tc ng khi duy tr ton b mng li tnh trng mong mun (7, 8). Vic tit
kim cc chi ph tr nn kh thi bi v cc chin lc mng li ti u xc nh theo phng php
xui nhn chung la chn cc d n c gii php thin v duy tu ngn nga hn, trong khi phng
php ngc c xu hng ch chn cc d n c mt ng xung cp tng i nghim trng
(khi t n ngng can thip v h hng kt cu) v cn p dng nhng cng vic ci to c
mc ln phc hi li trng thi tng ng ban u. m hnh ho cc phng php tip
cn trong phn tch u tin, c rt nhiu cc phng php lp trnh c ng dng v c tng
qut trong phn di y.
3. Cc phng php phn tch u tin
Xc lp mc u tin ca cc d n (on tuyn) c thc hin bi nhiu phng php phn
tch u tin khc nhau, t vic sp xp mc u tin mt cch nh tnh n gin n cc hnh
thc phc tp theo cc m hnh ti u ho. Da trn cch phn loi ca GS. Haas cng cng s (9),
Tc gi tng hp cc phng php khc nhau cng vi nhng u im, nhc im, v nhng
ch khi s dng trong h thng QLM nh trn Bng 1. Tng t, TS. Robinson cng cng s
(10) phn nhm cc phng php phn tch u tin theo 3 th h. Th h th nht l nhng phng

Tp ch Cu ng - Hi Cu ng Vit Nam, s 4/2008

4
php sp xp u tin da trn t hp ca chi ph, iu kin v chc nng ca ng. Th h th 2
th vic sp xp u tin da trn hiu qu v chi ph, tui th ca cc cng tc ng, v phn tch
cc phng n tr hon. Th h cui cng l vic p dng cc phng php phn tch ti u ho
cho ton mng li, ng thi vi vic xem xt nhiu phng n cng vic trong sut thi gian lp
k hoch. Trong , phng php sp xp u tin c u im l n gin nhng lm mt i rt
nhiu u im ca h thng QLM nn phng php ny ch s dng trong khi cha c cc
phng php khc thay th. Phng php ti u ho theo cc m hnh ton thng phc tp nhng
em li hiu qu cao hn so vi cc phng php sp xp u tin. Cc phn tip theo y s trnh
by k hn v cc phng php c s dng ph bin.
Bng 1. Phn loi cc Phng php u tin ho
Phng php u, nhc im
Sp xp nh tnh n gin cc d n da theo cc
phn on
Nhanh v n gin, nhng mang tnh nh
tnh, kt qu xa vi gii php ti u
Sp xp da theo cc thng s nh l mc phc
v, bin dng, v.v.
n gin v d s dng, nhng c th xa gii
php ti u
Sp xp da trn cc ch tiu ca phn tch kinh t Tng i n gin v c th tip cn gn
gii php ti u hn
Ti u ho s dng cc m hnh lp trnh ton hc
theo cch thc cc nm k tip nhau, nh l
nguyn l xch Markov
Kh phc tp v yu t thi gian khng c
xem xt, nhng c th tip cn c gn gii
php ti u,
Ti u ho gn ng, theo nguyn l m tm v
loi tr (heuristic method)
Tng i n gin, s lng php tnh
tng i nh, v tip cn gn vi gii php
ti u
Ti u ho s dng cc m hnh ton, nh l ti u
ho ton b, ti u ho ng, s dng lp trnh
fuzzy, hoc thut ton pht sinh (genetic),
Rt phc tp nhng c th a ra gii php
ti u chnh xc

3.1 Phng php sp xp u tin
Phng php sp xp u tin c thc hin thng qua t hp cc tham s la chn cng vi h s
t trng ca chng. Phng php ph bin v c nhiu nh qun l s dng nht l phng php
xp hng theo t trng (Rational Factorial Rating Method). Trong phng php ny, kin chuyn
gia c s dng xy dng phng trnh xc nh h s u tin. u tin, cc on tuyn c
trng cho cc iu kin khc nhau c la chn phc v cho vic xy dng cc phiu iu tra.
Sau , nhm chuyn gia s nh gi nhng on tuyn da trn nhng thuc tnh xc lp trc.
Kt qu nh gi thu c thng qua phn tch thng k s dng thit lp phng trnh xc nh
mc u tin nh th hin di y (11).
Y = 5.4 0.0263.X
1
0.0132.X
2
0.4. log (X
3
) + 0.749.X
4
+ 1.66.X
5
trong Y l h s u tin c tr s t 1 n 10 tng ng vi iu kin ng t rt xu n rt
tt. Gi tr Y cng ln th mt ng cng c mc u tin cao v cn phi hc hin cc cng
vic ng. K hiu t X
1
n X
5
ln lt l lng ma, mc ng v tan bng, lu lng giao
thng, ch s mc phc v (PSI), v mc h hng mt ng.
3.2 Phng php ti u ho

Tp ch Cu ng - Hi Cu ng Vit Nam, s 4/2008

5
Phng php ti u ho s dng m hnh lp trnh ton cho vic phn tch u tin trong k hoch
cng vic mt nm hoc nhiu nm. Phng php ny cho php phn tch mi quan h qua li gia
cc on tuyn ng thi vi vic xem xt cc phng n cng vic cho mi on tuyn trong
chng trnh nhiu nm ca mng li ng, m bo nhng tiu ch nh sn cho mng li
trong iu kin hn ch v ngun vn. Tiu ch nh sn c th hin thng qua hm mc tiu
nh l ti a ho mc phc v, ti a ho li ch mang li hay ti thiu ho tng chi ph (bao
gm c chi ph nh qun l v chi ph ngi s dng) ca mng li. Phn di y s tng quan
mt s phng php ti u ho ph bin trong h thng QLM.
3.2.1 Phng php phn tch xc sut
Phng php phn tch xc sut d on kh nng xy ra ca tnh trng on tuyn nht nh ti
mt thi im xc nh trong tng lai. Mc chuyn tip xc sut v iu kin ng trong
tng lai thng thng c n nh bi cc nh gi mang tnh k thut da trn phn tch ca
nhm chuyn gia. C 2 hnh thc chnh c s dng, l phn phi xc sut da trn hm xc
sut lin tc v nguyn l xch Markov s dng cc bin ri rc. Trong , nguyn l Markov
c s dng rng ri v sm nht vo nhng nm 1980 bi cc nh qun l ng b bang
Kansas v Arizona ca M a ra cc chng trnh cng vic u tin. Phng php s dng gi
thit l qu trnh chuyn tip xc sut tnh trng ng ch c thit lp cho mi bc v ch ph
thuc vo iu kin hin trng ca ng v cng vic la chn ti thi im xem xt. Do
vy, phng php khng xem xt n cc yu t nh hng trc ca on tuyn, chng hn
nguyn nhn gy ra tnh trng mt ng nh hin ti. Bng 2 minh ho cch thc chuyn tip
xc sut tnh trng mt ng theo thi gian (thng thng l hng nm) thng qua ma trn
chuyn tip (9). Trong v d ny, tnh trng mt ng c th hin thng qua ch s t 1 n 9,
tng ng vi iu kin mt ng t tt n rt xu.
Bng 2: Ma trn chuyn tip s dng nguyn l xch Markov
Xc sut (%) ca iu kin mt ng cho nm tip theo Tnh trng
ban u
1 2 3 4 5 6 7 8 9 Tng
1 90 4 2 3 1 0 0 0 0 100
2
1 90 3 0 5 1 0 0 0 100
3
0 1 92 0 1 3 0 1 2 100
4
0 0 0 92 5 2 0 1 0 100
5
0 0 0 1 94 3 1 1 0 100
6
0 0 0 0 1 94 0 1 4 100
7
0 0 0 0 2 0 95 2 1 100
8
0 0 0 0 0 0 1 96 3 100
9
0 0 0 0 0 1 0 1 98 100
Qu trnh chuyn tip xc sut c thc hin lin tc cho cc nm lin tip di nhng phng
n cng vic nht nh. Cng vi l rt nhiu cc chi ph, bao gm chi ph cho mt cng vic
ng chnh c thc hin 1 ln, chi ph duy tu thng xuyn, v chi ph ca ngi s dng
trong sut nm sau khi thc hin cng tc ng. i vi mi phng n cng vic ng nht
nh, tng chi ph c xc nh bng tng cc chi ph hng nm d tnh trong sut thi k lp k
hoch c quy i v gi tr hin ti. Khi , mc ch ca phn tch ti u ha y s tm
phng n cng vic sao cho tng chi ph l nh nht hoc li ch cho x hi l ln nht, m bo
cc tiu ch ca mng li v iu kin hn ch v ngun vn. So vi phng php sp xp u tin,
phng php ti u s dng nguyn l xch Markov tip cn vic phn tch ng thi mng
li nhng vn cn c nhng nhc im sau:
Khi nim v xch Markov tng i phc tp cho vic thuyt phc cc nh qun l v nh
hoch nh so vi phng php sp xp u tin.
Do phi s dng mt s lng ln cc phng n thc hin cng vic, nn phng php ny
phc tp v kh c th tm c gii php ti u chnh xc.
Phng php thng ng dng m hnh lp trnh tuyn tnh cho vic phn tch vi s lng
ln v tnh trng ng, xc sut chuyn tip v cc phng n cng vic. Nn nhng tham s
ny phi hn ch (nh l ti a 3 ch s h hng vi 4 mc h hng cho mt loi mt ng
nht nh) do hn ch v s lng php tnh ca cng ngh my tnh hin hnh.

3.2.2 Phng php ti u ho ton b
Phng php ti u ho ton b (total enumeration) phn tch tt c cc phng n c th ri chn
phng n ti u hm mc tiu nh trc v tho mn cc iu kin rng buc. Phng php
c lp trnh tuyn tnh trong M hnh Chi tiu Vn (EBM) v c kt hp vi phn mm
HDM-III (12) v HDM-4 (13) cho cc phn tch ti u mng li. Qu trnh ti u ho cho mng
li ng vi K on tuyn, M
k
phng n cng vic, trong thi gian lp k hoch vi T thi
on cp vn c thc hin nh sau:
Hm mc tiu ti a ho tng li ch dng gi tr hin ti
[ ]
km
M
m
km
K
k
X NPV TNPV Max
k

= =
=
1 1
km
X , vi k = 1, 2, K; m = 1, 2, , M
k
; (1)
Tho mn iu kin ngun vn hn hp
, vi q = 1, 2, Q; t = 1, 2, , T (2)
qt
M
m
km kmqt
K
k
TR X R
k

= = 1 1
.
v m bo cc phng n cng vic c lp nhau
(3)

=

k
M
m
km
X
1
1
Trong ,
- l gi tr li ch dng tng i vi phng n c bn (phng n thc hin
cng vic ti thiu) c quy i v gi tr hin ti vi h s chit khu l r, ca on
tuyn k (trong tng s K on tuyn), vi phng n cng vic m (trong tng s M
km
NPV
k

phng n).
- l bin ri rc, bng 1 nu phng n cng vic m c chn cho on tuyn i, v
bng 0 khi chn phng n c bn. Phng n cng vic c hiu l t hp cc cng
vic d kin thc hin trong sut thi gian lp k hoch.
km
X

Tp ch Cu ng - Hi Cu ng Vit Nam, s 4/2008

6
- l ngun vn c sn ln nht d kin, ca loi ngun vn q (trong tng Q loi
ngun vn
qt
TR
2
), v cho thi on cp vn th t (trong tng s T ln cp vn). S nm ca
mi thi on t c th l 1 hoc nhiu nm v khng nht thit phi bng nhau.
- l ngun vn (cha chit khu) loi q do cng vic u t i hi nh qun l ti
ln cp vn th t.
kmqt
R
u im ca phng php ny l a ra gii php ti u chnh xc, nhng li cn mt khi lng
tnh ton khng l (m
k.t
php tnh cho mt phn tch gm k on tuyn, m phng n trong thi
gian phn tch t). Chng hn, phn tch mng li gm 1.000 on ng nht trong vng 10 nm
vi 5 phng n cng vic c xem xt th s lng tnh ton s l 5
10.000
. Khi lng tnh ton
ny l khng thc t. Do vy, phng php ti u ho ton b ch ng dng cho nhng phn tch
mng li nh c t on tuyn v c khi lng tnh ton thc hin c.
3.2.3 Phng php ti u ho ng
Nhm hn ch v khi lng php tnh, phng php ti u ho da trn m hnh lp trnh ng
(dynamic programming) c xut bi Bellman v Dreyfus (14) vo nm 1962. Phng php
ti u ho ng ny s dng gi thit l bt k gii php ti u (optimal solution) no u c th
thay th bng cc t hp gii php th cp ti u (optimal sub-solutions). Bng cch ny, phng
php chia nh bi ton tng th thnh nhng bi ton th cp ti u n gin hn cho vic
thc hin tnh ton c d dng v hn ch c s lng php tnh. Thng thng, ngun vn
c chia nh N phn bng nhau v khi phng php s phn tch cho t hp
th cp v loi b nhng t hp khng c kh nng cho gii php ti u. Kinh nghim cho thy
phng php ny ch hiu qu khi s iu kin hn ch v ngun vn l 3 v khi s phn chia
khng nh hn 100 m bo mc chnh xc hp l (12). Mc d phng php khc phc
phn no nhc im ca phng php ti u ton b, nhng vi nhng phn tch c s lng thi
on cp vn ln (chng hn ln hn 4) th phng php ng s tng s lng php tnh rt nhiu
dn n khng th thc hin c hoc mc chnh xc s gim khi phi s dng s chia phn
nh. Do vy, phng php ng vn gp kh khn i vi nhng bi ton phc tp trong thc t
khi c s thi on cp vn ln.
qt
TR
QT
N ) 1 ( +
3.2.4 Phng php ti u ho gn ng
Phng php ti u ha gn ng (heuristic method) da trn nguyn tc khoanh vng nhng
phng n kh thi v thc hin phn tch u ho trn vng c xc nh ny. Bng vic
khoanh vng loi tr cc phng n khng c kh nng cho gii php ti u, phng php ti u
ho gn ng lm gim mt lng php tnh ng k m bo cho vic phn tch ti u c n
gin i rt nhiu. Phng php ny c th hin nhiu dng khc nhau, nh l phng php
dc c hiu (effective gradient method) (15), phng php gia tng t s li ch rng v chi ph
(incremental NPV/cost method) (16), hoc l phng php ng bao sinh li (ecomomical
boundary/efficiency frontier method). Phng php dc c hiu c s dng trong m hnh
EBM, tuy nhin s lng on tuyn ch hn ch di 400 vi mi on tuyn c khng qu 17
gii php cng vic. Trong khi , 2 phng php cn li c s dng kt hp trong m hnh
HDM-4 v s lng t hp on tuyn v gii php cng vic (KxM
K
) c tng ln 9.999
phin bn V1.3 v 32.000 trong phin bn mi V2.03. Qu trnh p dng phng php ti u ha
gn ng c trnh by tng i r rng cng vi ng dng thc t cho vic xc lp chng
trnh cng vic nhiu nm trong iu kin c th ca Vit Nam, thng qua s dng m hnh HDM-
4 vi phng thc phn on ng nht ng ca Tc gi (17, 18). u im ca phng php gn

Tp ch Cu ng - Hi Cu ng Vit Nam, s 4/2008

7

2
V d ngun vn thng xuyn hay ngun vn nh k
ng l tng i n gin v c th s dng cho mng li ng c s lng ln cc on tuyn,
cc gii php cng vic, v vi nhiu thi on cp vn. Ngoi ra, theo nhng phn tch so snh th
phng php ny cho kt qu tng i gn vi gii php ti u, sai s thng di 5% (12). V
vy, phng php gn ng c s dng rt ph bin hin nay nhiu h thng QLM nh l
ca M v Canada (10). c bit, m hnh HDM-4, ang c s dng rng ri trn hn 100 nc
v quc gia, cng s dng phng php ny nh l cng c chnh trong vic xc lp chng trnh
cng vic u tin cho nhiu nm ca mng li ng.
4. Xy dng m hnh ti u ho hiu qu
Hin nay, m hnh ti u ho ang c pht trin nhm hp nht cc quy trnh phn tch mi
quan h qua li gia cc cng vic (duy t ngn nga, ci to, nng cp) ng thi vi vic xem
phn b ti u ngun vn gia cc h thng cng trnh (mt ng, cu, thot nc, va h, bin
bo, ) hoc gia cc h thng giao thng khc nhau (ng b, ng st, ) trong mt h
thng tng th di quyn thc thi ca nh qun l, nh minh ho trn Hnh 2. M hnh phi p
ng c s tr gip trong vic phn b tng ngun vn cho cc h thng khc nhau v ng thi
phi ti u ho cc phng n cng vic trong mi h thng ny. u im ca m hnh l cung
cp kh nng kt ni hiu qu cc cng vic nm trong ton b h thng thuc quyn thc thi ca
nh qun l.
M hnh ti u hp nht cc h thng cng trnh khc nhau c bt u quan tm vo nhng
nm cui 1980s. Sau , nhng nm 1990s m hnh hp nht bt u c xy dng v ng
dng trong thc t, nhng mi ch dng li cho h thng mt ng v h thng cu ng b.
Trong nhng nm gn y, m hnh ny c pht trin c th hp nht cc h thng cng
trnh khc nh l h thng thot nc, bin bo, ng xe p v h ng (19, 20, 21). Bn cnh
, m hnh ti u nhm hp nht cc phn khu hoc phn vng qun l ng b khc nhau cng
c pht trin thng qua nhng phng php s dng cc tham s cha ng kin chuyn gia
mt cch trc tip hoc gin tip (22, 23). Gn y nht, GS.Tsunokawa v inh Vn Hip (24)
xut phng thc ti u ho hp nht c th xem xt cho c cc h thng cng trnh hoc cc
phn khu mng li khc nhau trong chng trnh nhiu nm, vi hm mc tiu l ti thiu ho
tng chi ph hoc ti a ho li ch.
Phn b ti u gia cc h thng
Mt ng Cu Cng Bin bo H thng th n
D n 1 PA11 PA 21 PA31 PA41 PAn1
D n 2 PA12 PA 22 PA32 PA42 PAn2
. . . . . .
. . . . . .
. . . . . .
D n m PA1m PA 2m PA3m PA4m PAnm

Nm 1
Nm 2
Nm t

g

t
h

h
g
T

u

t
r
o
n
*)
PA
nm
l phng n cng vic ca d n m trong h thng n.
Hnh 2: M hnh ti u ho hp nht gia nhiu h thng

Tp ch Cu ng - Hi Cu ng Vit Nam, s 4/2008

8

Tp ch Cu ng - Hi Cu ng Vit Nam, s 4/2008

9
Kt lun
Bi vit tng quan cc phng php tip cn v cc m hnh phn tch chng trnh cng vic
u tin ca mng li ng b, m bo nhng tiu ch nh trc trong iu kin rng buc v
cc chnh sch ngun vn. Bn cnh , bi vit phn tch nhng u nhc im v phm vi ng
dng ca chng khi ng dng trong h thng QLM. Cc phng php i t vic sp xp u tin
n gin n nhng phng php ti u ho phc tp nhng m bo chnh xc cao nhm tng
hiu qu thc hin ca h thng QLM. Tuy nhin, vic s dng phng php no cho thch hp
cn tu thuc vo c tnh ca tng mng li v iu kin ca mi nh qun l. Mt trong nhng
yu t quan trng trong vic la chn phng php ph hp l kh nng p ng cho vic thu thp
s liu ca nh qun l. Do vy, i vi nhng nh qun l mng li ng quy m ln (nh
mng li ng quc l) v ngun nhn lc c k nng tt th nn hng vo vic s dng cc
m hnh ti u ho phc tp nhng em li hiu qu cho cng tc qun l trn phm vi quc gia.
i vi cc nh qun l cc mng li ng nh (nh mng li ng a phng, ng khu
vc) th c th ng dng cc phng php n gin, v ch cn thc hin cc cng vic thu thp v
x l nhng s liu cn thit c bn. Ngoi ra, vic xy dng nhng m hnh ti u ha hp nht
gia cc h thng cng trnh, cc hnh thc giao thng khc nhau, hay hp nht cc mng li khu
vc thnh mt th hp nht di quyn thc thi ca nh qun l cn c quan tm pht trin.
Vic thc hin phng thc ti u ha trong mt th hp nht gip cho nh qun l v nh hoch
nh c nhng quyt nh u t hiu qu v vic phn b ngun vn c hp l khi xem xt mt
cch ton din, m bo cc tiu ch c xc lp v tha mn nhng iu kin hn ch v
chnh sch ngun vn.


Ti liu tham kho
1. HMCP (2002). D n Tng cng Nng lc Qun l ng b. Cc ng b Vit Nam, B Giao
thng Vn ti Vit Nam.
2. RNIP (2003). D n nng cp mng li ng quc l K hoch chin lc 10 nm. Cc ng
b Vit Nam, B Giao thng Vn ti Vit Nam.
3. ISDP (2005). D n nng cp ng b giai on 3 - Thc thi pht trin chnh sch ngnh. Cc
ng b Vit Nam, B Giao thng Vn ti Vit Nam.
4. Hudson, W.R, R. Haas, and W. Uddin (1997). Infrastructure Management: Integrating Design,
Construction, Maintenance, Rehabilitation and Renovation. McGraw-Hill Professional Publishing,
New York.
5. AASHTO (2001). Pavement Management Guide: Executive Summary Report. American
Association of State Highway and Transportation Officials, Washington D.C.
6. Kulkarni, R.B and R.W. Miller (2003). Pavement Management Systems: Past, Present, and Future.
Transportation Research Record 1853, Transportation Research Board, Washington, DC., pp 65-71.
7. Way, G.B (1985). Network Optimization System for Arizona. North American Pavement
Management Conference, Vol.2, Toronto, Canada, pp.6.16 6.22.
8. Altiviti, E. R.B. Kulkarni, E.G. Johnson, N. Clark, V. Walrafen, L. Nazareth, and J. Stone (1994).
Enhancements to the Network Optimization System. Third International Conference on Managing
Pavements. Transportation Research Board, Washington, D.C., pp.190-194.
9. Haas, R., W.R. Hudson, and J.P. Zaniewski (1994). Modern Pavement Management. Krieger
Publishing Company, Malabar, Florida.

Tp ch Cu ng - Hi Cu ng Vit Nam, s 4/2008

10
10. Robinson, R., U. Danielson, and M. Snaith (1997) Road Maintenance Management: Concepts and
Systems. Palgrave Macmillan, Hampshire, England.
11. Fernado, E.G. and W.R. Hudson (1983). Development of a Prioritization Procedure for the Network
Level Pavement Management System. Center for Transportation Research. The Univ. of Texas at
Austin, Texas.
12. Watanatada T., C.G. Harral, W.D.O. Paterson, A.M. Dhareshwar, A. Bhandari, and K. Tsunokawa
(1987). The Highway Design and Maintenance Standards Model, Vol. 1: Description of the HDM-
III Model. World Bank Publications, Washington, D.C.
13. PIARC (2001). Highway Development and Management Model (HDM-4). International Study of
Highway Development and Management (ISOHDM), World Road Association (PIARC), Paris and
The World Bank, Washington, DC.
14. Bellman, R. and S.E. Dreyfus (1962). Applied Dynamic Programming. Princeton University Press,
Princeton NJ.
15. Ahmed, N.U. (1983). An Analytical Decision Model for Resource Allocation in Highway
Maintenance Management. Transportation Research, 17A.
16. Phillips, S.J. (1994). Development of United Kingdom Pavement Management System. Third
International Conference on Managing Pavement, Texas.
17. inh Vn Hip (2006). Phng php u tin ha trong Phn tch Chin lc v Chng trnh Xy
lp cho Mng li ng s dng M hnh HDM-4. Tp ch Cu ng, s 8/2006. Hi Cu
ng Vit Nam.
18. inh Vn Hip and K. Tsunokawa (2006). Identification of Rolling Multiyear Work Programs for
Road Network: A Strategy Analysis with Dynamic Sectioning. The 12th International Seminar on
Transport Research, Bangkok, Thailand, pp 59 68
19. Gharaibeh, N. G., M. I. Darter, D. R. Uzarski (1999). Development of Prototype Highway Asset
Management System. Journal of Infrastructure Systems, ASCE, 5(2), 61-68.
20. Sadek, A. W., A. Kvasnak, and J. Segale (2003). Integrated Infrastructure Management Systems: Small
Urban Areas Experience. Journal of Infrastructure Systems, ASCE, 9 (3), 98106.
21. Gharaibeh, N.G., Y.C. Chiu, and P.L. Gurian (2006). Decision Methodology for Allocating Funds
across Transportation Infrastructure Assets. Journal of Infrastructure Systems, ASCE, 12 (1), 19.
22. Heggie, I. G., and Vickers, P.(1998). Commercial Management and Financing of Roads. World
Bank Technical Paper No. 409, Washington, D.C.
23. Chan W. T. Chan, T. F. Fwa, ; and J. Y. Tan. (2003). Optimal Fund-Allocation Analysis for
Multidistrict Highway Agencies. Journal of Infrastructure Systems, ASCE, 9 (4), 167175.
24. Tsunokawa, K. and inh Vn Hip (2008). A Unified Optimization Procedure for Road Asset
Management. The 6
th
International Conference on Road and Airfield Pavement Technology,
Sapporo, Japan, pp 286-294.