Int
ern
at
i
onal
Journ
al of Ele
ctrical
an
d
Co
mput
er
En
gin
eeri
ng
(IJ
E
C
E)
Vo
l.
8
,
No.
6
,
D
ece
m
ber
201
8
, pp.
4382
~
43
90
IS
S
N: 20
88
-
8708
,
DOI: 10
.11
591/
ijece
.
v8
i
6
.
pp
4382
-
43
90
4382
Journ
al h
om
e
page
:
http:
//
ia
es
core
.c
om/
journa
ls
/i
ndex.
ph
p/IJECE
Robu
st Counte
rp
ar
t
Op
en Capa
citated
Vehicle
Routing
(RC
-
OCVRP)
Model in
Op
timiz
atio
n
of
Garbag
e
Tra
nsp
ort
atio
n i
n
Distric
t
S
ako an
d Su
kara
mi
, P
alemb
ang Cit
y
Fitri
Maya
Pu
spita
1
,
Y
usu
f Har
tono
2
,
N
adi
a
Z
uli
at
y S
yapu
tri
3
, E
vi Yul
iz
a
4
,
Weni D
w
i Prat
iw
i
5
1,3,4,5
Depa
rt
m
ent
of
Mathe
m
atics,
Facul
t
y
of
Ma
th
emati
cs
and
Na
t
ura
l
Sc
ie
nc
es,
Sriwijay
a
Unive
rsit
y
,
Indon
esia
2
Mathe
m
at
i
cs
St
ud
y
Program
,
Fa
cul
t
y
of Educati
on
and Te
a
ch
er Tra
in
ing,
Sriwij
a
y
a
Univ
ersity
,
I
ndonesia
Art
ic
le
In
f
o
ABSTR
A
CT
Art
ic
le
history:
Re
cei
ved
Ma
y
9
, 2
01
8
Re
vised
Ju
l
9
,
201
8
Accepte
d
J
ul
23
, 2
01
8
In
thi
s
p
ape
r
,
th
e
Robust
Count
erp
art
Open
C
a
pac
i
ta
t
ion
Vehi
c
le
Rount
ing
Problem
(RC
-
OCV
RP
)
Model
has
be
en
established
to
opt
i
m
iz
e
waste
tra
nsport
in
dist
ric
ts
Sako
and
distri
ct
s
Sukara
m
i,
Pale
m
bang
Cit
y
.
Thi
s
m
odel
is
complet
ed
with
the
ai
d
of
LINGO
13.
0
b
y
using
Branc
h
and
Bound
solver
to
ge
t
the
opti
m
um
route
.
For
Sako
distri
c
s,
the
rout
es
are
as
foll
ows
:
working
are
a
1
i
s
TPS
1
-
TPS
2
-
TPS
3
-
TPA
with
dista
nc
e
53.
39
km
,
working
are
a
2
is
TPS
1
-
TPS
2
-
TPS
3
-
TPA
with
dista
n
ce
48.
14
km
,
worki
ng
area
3
is
TPS
1
-
TPA wit
h
a
dista
nc
e
of
22.
98
km
,
and
working
area
4
is T
PS
1
-
TPS
2
-
TPS
3
-
TPS
4
-
TPA
with
45.
45
km
dista
nce
,
and
obta
in
ed
the
opt
imum
route
in
Sukara
m
i
distri
ct
s
is
as
fol
lo
ws
:
working
are
a
1
is
TPS
1
-
TPS
2
-
TPA
44.
39
km
,
work
ing
ar
ea
2
is
TPS
1
-
TPS
2
-
TPS
3
-
TPA
with
dist
anc
e
49.
3
2
km
,
working
ar
ea
3
is
TPS
1
-
T
PS
3
-
TPA
-
TPS
2
-
TPA
with
dist
anc
e
58
.
57
km
,
and
workin
g
area
4
is
TPS
1
-
TPA
with
a
di
stanc
e
of
24
.
07
km
,
working
are
a
5
is
TPS
1
-
TPS
3
-
TPA
-
TPS
2
-
TPS
4
-
TPA
with
a
dista
n
ce
of
77.
66
km
,
and
working
area
6
is a T
PS
1
-
T
PS
2
-
TPS
3
-
TPA wit
h
a
dist
ant
e
44.
94
km
.
Ke
yw
or
d:
Garba
ge
tra
nsp
or
ta
ti
on
OCVRP
Op
ti
m
iz
ation
Robust
Copyright
©
201
8
Instit
ut
e
o
f Ad
vanc
ed
Engi
n
ee
r
ing
and
S
cienc
e
.
Al
l
rights re
serv
ed
.
Corres
pond
in
g
Aut
h
or
:
Fit
ri May
a Pu
s
pita,
Dep
a
rtm
ent o
f M
at
hem
a
ti
cs, F
acult
y o
f
Ma
them
atics and
Natu
ral Scie
nc
es
,
S
riwij
ay
a
U
niv
e
rsity
,
Jln.
Ra
ya
Pale
m
ban
g
-
P
rabu
m
ul
ih K
M
32 Ind
e
r
al
ay
a,
Og
a
n Ili
r,
Ind
on
esi
a
.
Em
a
il
: fit
ri
m
a
yap
uspit
a@
unsr
i.ac.i
d
1.
INTROD
U
CTION
Palem
ban
g
ci
ty
as
a
m
e
tropolit
an
ci
ty
is
facing
a
pro
ble
m
li
ke
oth
er
bi
g
ci
ti
es,
nam
e
ly
gar
ba
ge
.
Alm
os
t
80
%
of
the
waste
is
f
ro
m
hous
e
hold
waste.
G
ar
bage
accum
ulati
on
will
ha
ve
ne
ga
ti
ve
ef
fects
both
f
or
the
en
vironm
ent
an
d
f
or
hu
m
an
li
fe.
Se
ver
a
l
factor
s
t
hat
c
ause
the
bu
il
d
up
of
garba
ge,
on
e
of
wh
ic
h
is
the
te
chn
iq
ue
of
tr
ans
porting
wa
ste
is
that
are
no
t
e
ff
ic
ie
nt.
Ther
e
f
or
e,
to
pr
e
ve
nt
the
ac
cum
ulati
on
of
waste,
m
or
e
accurate
and
ef
fici
ent
waste
tra
ns
po
r
t
m
et
ho
ds
a
re
nee
ded
t
o
tra
ns
po
rt
waste
f
ro
m
the
Te
m
p
or
a
ry
Disposal Si
te
c
al
le
d
TPS
to
la
ndfill
s call
ed
T
PA
.
Ther
e
a
re
two
t
ypes
of
garba
ge
car
us
ed
,
na
m
el
y
a
m
ro
ll
and
dum
p
truck
.
Wh
il
e
there
a
r
e
three
ty
pes
of
waste
co
ntainers
i
n
the
TP
S,
the
c
on
ta
ine
r
with
a
ca
paci
ty
of
4
kg,
ga
r
bag
e
c
onta
iner
s
m
ade
of
f
ibe
r
with
a
capaci
ty
of
3.8
kg,
a
nd
a
wast
e
bin
m
ade
of
con
c
rete
with
a
capaci
ty
of
5
kg.
Acc
ordin
g
to
[1]
tra
nsp
ort
at
ion
of w
ast
e
from
TPS
t
o
TP
A
is
done base
d o
n t
he
di
visio
n of
work
i
ng area
.
An
a
ppli
cat
ion
of
Ve
hicle
Rou
ti
ng
P
r
ob
le
m
(V
RP)
is
a
m
at
te
r
of
deliv
ery
an
d
retrie
va
l
of
goods.
Me
anwhil
e,
ac
cordin
g
to
[
2]
,
VRP
a
pp
li
cat
ion
s
ap
pea
r
in
desig
n
a
nd
dis
tribu
ti
on
syst
e
m
s
wh
os
e
op
e
rati
ons
are
determ
ined
by
route
c
onstructio
n,
an
d
t
he
goal
is
t
o
m
i
nim
iz
e
total
co
st
an
d
tr
a
vel
r
ou
te
s
.
I
f
t
he
ve
hicle
has
a
sin
gle
c
apacit
y
with
a
sin
gle
com
m
od
it
y
the
n
it
i
s
cal
le
d
a
Ca
pacit
at
ed
Veh
i
cl
e
Rou
ti
ng
P
roblem
(CVRP
).
A
ppli
cat
ion
s
relat
ed
to
sh
i
pp
i
ng,
s
uc
h
as
c
on
s
um
er
pro
duct
s
a
nd
ga
r
bag
e
colle
ct
io
n
a
nd
trans
portat
ion
i
nclu
ding
ai
r,
r
a
il
,
sh
ips
an
d
m
otor
ve
hicle
s
[3]
.
In
netw
orks
,
routin
g
pro
ble
m
s
are
al
so
crit
ic
al
issues
t
o
be
discuss
e
d.
I
n
s
ome
cas
es,
routin
g
pro
blem
wireless
sen
sor
net
work
[
4]
a
nd
im
pr
ov
e
d
Aug
m
ented
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
& C
om
p
Eng
IS
S
N: 20
88
-
8708
Ro
bu
st C
ounte
rp
art
Ope
n
C
apacitate
d
Ve
hi
cl
e
Ro
uting
…
(
Fit
ri Maya
P
uspit
a
)
4383
Line
Se
gm
ent
Ba
sed
(
ALS
B
)
for
ste
ine
r
m
i
nim
u
m
treei
s
currently
disc
usse
d.
O
n
the
i
ssu
e
of
Ca
paci
ta
te
d
Veh
ic
le
R
ou
ti
ng
P
roblem
(CVRP)
as
disc
usse
d
i
n
[5
]
,
[
6]
,
the
car
rier
ve
hicle
m
us
t
retu
rn
to
t
he
de
po
t
after
com
pleti
ng
it
s
w
ork.
H
owev
er,
f
or
so
m
e
ve
hicle
r
ou
te
pr
ob
le
m
s
su
c
h
a
s
the
r
ou
te
of
the
garbag
e
tr
ans
port
veh
ic
le
,
th
e
ab
ov
e
-
m
entioned
conditi
ons
ca
n
not
be
pe
rform
ed.
This
bec
om
es
ineff
ic
ie
nt,
as
it
will
co
st
m
or
e
travel
an
d
m
or
e
tim
e
wasted.
This
is
wh
at
th
e
authors
f
ound
ha
pp
e
ning
in
the
fiel
d,
that
the
garba
ge
car
does
no
t
retu
r
n
to
the
depot
t
o
ra
ise
the
hous
e
of
e
ach
dri
ve
r.
This
bec
om
es
a
new
pro
ble
m
becau
se
the
pat
h
form
ed
turns
i
nto
a
n
open
pa
th.
T
hus,
t
he
C
VRP
prob
le
m
beco
m
es
an
O
pen
Ca
pa
ci
ta
te
d
Ve
hicle
Rou
ti
ng
Pr
oble
m
(
OCV
RP)
prob
le
m
as quo
te
d from
[7]
.
Robustne
ss
in
m
od
el
li
ng
oc
cur
s
in
so
m
e
env
i
ronm
ents.
For
i
ns
ta
nce
,
r
obus
tne
ss
c
an
occ
ur
i
n
dynam
ic
al
power
syst
em
[8]
,
robust
perfor
m
ance
in
syst
e
m
op
erati
on
of
an
ai
rcr
aft
[
9]
or
eve
n
rob
us
t
m
od
el
pr
e
dicti
ve
c
ontrolle
r
(RMPC
)
f
or
ada
ptive
s
yst
e
m
[10]
.
T
he
R
obus
t
C
ounte
rp
a
rt
(RC
)
m
et
ho
d
in
thi
s
case
was
dev
el
oped
by
Be
n
-
Tal
a
nd
Ne
m
irov
sk
i
i
n
early
1997.
I
n
this
m
et
hodolog
y,
RC
repre
sents
the
w
orst
-
case
or
ie
nted
a
ppr
oa
ch,
a
s
olu
ti
on
cal
le
d
r
obus
t
f
easi
ble
m
et
ho
ds
[
11
]
.
T
he
em
erg
e
nce
of
rob
us
t
as
a
m
et
hodo
l
og
y
is con
si
der
e
d
c
apab
le
of
res
olv
in
g
the
un
ce
rt
ai
nty of
e
xisti
ng
d
at
a
[
12]
.
I
n t
he
ga
rb
a
ge ha
ul,
the
un
ce
rtai
nty of
the
data
on
th
e
garbag
e
vo
l
um
e
in
each
TPS
is
found.
Ba
sed
on
the
facts
that
arise,
then
the
pro
blem
is
cl
assifi
ed
as
a
Dem
and
Robust
Counter
part
(D
RC
)
pro
ble
m
.
DRC
issu
es
can
be
so
lv
ed
by
MILP
with
the
help o
f
Lin
go
13.0 Pro
gr
am
an
d sol
ve
d wit
h B
ran
c
h
a
nd Bo
und
s
ol
ver
.
Sako
an
d
Suka
ram
i
Distric
ts
are
on
e
of
the
densel
y
po
pula
te
d
district
s
of
Palem
ban
g.
Th
is
research
is
base
d
on
re
search
on
16
district
s
in
Pal
e
m
ban
g
Ci
ty
.
To
ob
ta
i
n
a
m
ini
m
u
m
route
with
m
axi
m
um
waste
capaci
ty
,
us
e
Robust
Co
unte
rp
a
rt
O
pe
n
Ca
pacit
at
ed
Ve
hi
cl
e
Rou
ti
ng
Prob
le
m
(RC
-
O
CVRP)
m
et
hod.
T
he
sp
eci
al
ty
of
t
he
RC
-
OC
VRP
m
et
ho
d
is
t
o
ge
t
the
opti
m
u
m
route
acc
ordin
g
to
t
he
ci
rc
umst
ances
that
oc
cur
i
n
the
fie
ld
that
the
ga
rb
a
ge
tr
uc
k
does
no
t
re
tur
n
to
the
de
po
t
bu
t
to
t
he
ho
m
e
of
each
dr
i
ver
as
well
as
th
e
un
ce
rtai
nty
of
the
volum
e
of
garbag
e
.
T
he
obj
ect
ive
of
th
is
researc
h
is
to
ap
ply
Robus
t
Cou
nte
rp
a
rt
Ope
n
Ca
pacit
at
ed
V
ehicl
e
Rou
ti
ng
Pr
oble
m
(RC
-
OCVRP
)
m
et
h
od
t
o
opti
m
iz
e
waste
trans
port
at
ion
r
ou
te
bas
ed
on
distance a
nd
volum
e o
f
T
PS
i
n
Sa
ko a
nd S
ukaram
i
district
s
, P
al
em
ban
g
Ci
ty
.
2.
RESEA
R
CH MET
HO
D
The
w
riti
ng
of
this
researc
h
i
s
a
case
stud
y,
us
in
g
data
of
garba
ge
tran
sportat
io
n
in
tw
o
Distric
ts
in
Palem
ban
g C
it
y, Sako a
nd S
ukaram
i Sub
district
s
. D
at
a
obta
ined fr
om
D
K
K Ko
ta
Pale
m
bang
a
nd f
ie
l
d survey
in
the
f
or
m
of
direct
inter
vie
w
with
D
KK
dri
ver
a
nd
m
eas
ur
em
ent
of
distance
bet
ween
TPS
an
d
T
PS
t
o
TP
A.
The
ste
ps
ta
ke
n
a
re:
a.
Coll
ect
ing
dat
a
in
the
f
orm
of
:
the
num
ber
of
car
s
ope
rati
ng
i
n
the
district
s
of
Sa
ko
a
nd
district
s
Sukaram
i
al
ong
with
t
he
volum
e
of
ca
r
ca
pa
ci
ty
,
the
r
oute
thr
ough
each
car
a
nd
the
vol
um
e
transpor
te
d
from
each
TPS
, th
e
distance
tr
aveled
from
the TP
S
to
t
he
T
PS
to
the
TP
A.
b.
Determ
ining
D
ist
ance Mat
rix.
c.
Mod
el
t
he data
into
R
obus
t C
ounter
par
t M
odel
.
d.
Esta
blish M
odel
s b
y
determ
i
ning
wor
king a
rea in
each
dist
rict
s
in
OCVR
P and C
VRP is
su
es.
e.
Apply t
he
m
odel
o
f
each
workin
g
a
rea int
o Li
ngo 1
3.0.
f.
Lo
ok
i
ng
for
optim
al
integer
so
luti
on
f
ro
m
non
-
opti
m
a
l
i
ntege
r
so
l
utio
n
by
usi
ng
Br
anch
a
nd
bo
und
so
lve
r
m
et
ho
d on LI
N
GO 13.
0.
g.
Determ
ining
the
opti
m
a
l
ro
ut
e
on
work
i
ng
area
f
or
the
c
ase
of
garba
ge
trans
portat
ion
by
Branc
h
a
nd
Boun
d
s
olv
e
r m
et
ho
d o
n
L
I
NGO 1
3.0.
3.
RESU
LT
S
A
ND AN
ALYSIS
DKK
Pale
m
ba
ng
Ci
ty
pro
vi
des
4
ga
rb
a
ge
trans
port
ve
hicle
s
in
Sa
ko
district
s
a
nd
6
ga
rb
a
ge
trans
port
ve
hic
le
s
in
district
s
Sukaram
i
with
a
ca
rr
yi
ng
c
apacit
y
of
up
to
8
t
ons.
Eac
h
garbag
e
tra
nsport
veh
ic
le
is
div
ided
int
o
ind
i
vid
ual
w
orkin
g
a
rea.
This
m
od
el
con
sist
s
of
a
com
bin
at
ion
of
Rob
ust
Counterpa
rt
Mod
el
a
nd
OCVRP M
od
el
.
Min
=
Subj
ect
t
o
19.07
01
+
20.52
02
+
23.
32
03
+
19.
07
10
+
5.56
12
+
4.6
3
13
+
20
.
52
20
+
5.56
21
+
5.4
6
23
+
12
3.3
2
30
+
4.63
31
+
5.46
32
≤
01
+
02
+
03
+
12
+
13
+
21
+
23
+
31
+
32
≥ 0.
96
10
+
20
+
30
+
12
+
13
+
21
+
23
+
31
+
32
≥ 1
01
+
02
+
03
=
1
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
20
88
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol.
8
, N
o.
6
,
Dece
m
ber
2
01
8
:
4382
-
4390
4384
2800
≤
1
<
8000
2800
≤
2
<
8000
2100
≤
3
<
8000
1
−
2
+
8000
12
≤
5200
1
−
3
+
8000
13
≤
5900
2
−
1
+
8000
21
≤
5200
2
−
3
+
8000
23
≤
5900
3
−
1
+
8000
31
≤
5200
3
−
2
+
8000
32
≤
5200
,
01
,
02
,
03
,
12
,
13
,
21
,
23
,
31
,
32
≥
0
Table
1
is
a
s
olu
ti
on
ta
ble
of
the
Ro
bust
Counter
par
t
O
CVRP
m
od
el
in
Sa
ko
distric
ts
.
From
the
ta
ble,
it
can
be
obta
ine
d
that
the
opti
m
al
ro
ute
dista
nce
for
work
i
ng
area
1
is
53.
39
km,
w
orki
ng
area
2
i
s
48.14
km
,
wor
king
area
3
is
22.98
km
,
and
work
i
ng
area
4
is
45
.
45
km
.
Wh
e
reas
Ta
ble
2
sh
ows
the
va
lue
of
the
decisi
on
va
riable
for
w
ork
i
ng
area
1,
Tab
le
3
sh
ows
the
value
of
the
de
ci
sion
va
riable
fo
r
w
orki
ng
ar
ea
2,
Table
4
s
hows
the
value
of
the
decisi
on
va
riab
le
f
or
w
or
king
area
3,
a
nd
Ta
ble
5
s
hows
t
he
value
of
the
decisi
on
var
ia
bl
e for wor
king
area
4.
Tabl
e
1
.
So
l
utiono
f
Ro
bust C
ounter
par
t
OC
VRP
in
Sa
ko
Distric
t
S
o
lver S
ta
tu
s
W
o
rkin
g
Ar
ea
1
W
o
rkin
g
Ar
ea
2
W
o
rkin
g
Ar
ea
3
W
o
rkin
g
Ar
ea
4
Mod
el Class
MI
L
P
MI
L
P
MI
L
P
MI
L
P
State
Glo
b
al Opti
m
al
Glo
b
al Opti
m
al
Glo
b
al Opti
m
al
Glo
b
al Opti
m
al
Ob
jectiv
e
5
3
.39
4
8
.14
2
2
.98
4
5
.45
Inf
easib
elity
0
0
0
0
Iter
atio
n
s
0
0
0
0
So
lv
er
T
y
p
e
Bran
ch
and
Bo
u
n
d
Bran
ch
and
Bo
u
n
d
Bran
ch
and
Bo
u
n
d
Bran
ch
and
Bo
u
n
d
Bes
t Objectiv
e
5
3
.39
4
8
.14
2
2
.98
4
5
.45
Step
s
0
0
0
0
Up
d
ate I
n
terval
2
2
2
2
GMU
25
25
19
30
ER
0
0
0
0
Table
2.
R
obust
V
aria
ble V
al
ue wit
h OCVR
P
Work
i
ng Are
a 1
i
n
Sa
ko
Dis
tric
t
Variable
W
o
rkin
g
Ar
ea
1
Variable
W
o
rkin
g
Ar
ea
1
5
3
.39
21
0
01
0
23
1
02
0
30
1
03
0
31
0
10
0
32
0
12
1
1
2800
13
0
2
5600
20
0
3
7700
The
values
li
ste
d
in
1
,
2
,
3
of
Table
2
represe
nt
th
e
vlo
m
e
of
wa
ste
trans
ported
upon
le
a
ving
TPS
-
(
=
1
,
2
,
3
)
,
s
o
that
1
=
2800
,
2
=
5600
,
3
=
7700
.
A
r
ou
te
that
m
us
t
be
passe
d
by
dum
p
tr
uck
f
or
garba
ge
trans
port
at
w
orkin
g
area
1
is
TP
S
1
-
T
PS
2
-
T
P
S
3
-
T
PA
Kar
y
a
Jay
a.
Mi
ni
m
um
ro
ute
the
dr
i
ver
passes
i
n gr
a
ph
for
m
is exp
la
i
ned in
Fig
ur
e
1.
1
2
3
TPA
Figure
1. Ve
hi
cl
e
route
of
w
orki
ng area
1 Sa
ko in
Distric
t
The
values
li
ste
d
in
1
,
2
,
3
of
Table
3
represe
nt
th
e
vlo
m
e
of
wa
ste
trans
ported
upon
le
a
ving
TPS
-
(
=
1
,
2
,
3
)
,
s
o
that
1
=
2700
,
2
=
5600
,
3
=
7800
.
R
oute
s
that
m
us
t
be
pass
ed
by
dum
p
truc
k
f
or
garba
ge
trans
port
at
w
orkin
g
area
2
is
TP
S
1
-
T
PS
2
-
T
P
S
3
-
T
PA
Kar
y
a
Jay
a.
Mi
ni
m
um
ro
ute
the
dr
i
ver
passes
is
d
e
pec
it
ed
in Fi
gure
2.
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
& C
om
p
Eng
IS
S
N: 20
88
-
8708
Ro
bu
st C
ounte
rp
art
Ope
n
C
apacitate
d
Ve
hi
cl
e
Ro
uting
…
(
Fit
ri Maya
P
uspit
a
)
4385
Table
3.
R
obust
V
aria
ble V
al
ue wit
h OCVR
P
Work
i
ng Are
a 2
i
n
Sa
ko
Dis
tric
t
Variable
W
o
rkin
g
Ar
ea
2
Variable
W
o
rkin
g
Ar
ea
2
4
8
.14
21
0
01
0
23
1
02
0
30
1
03
0
31
0
10
0
32
0
12
1
1
2700
13
0
2
5600
20
0
3
7800
1
2
3
TPA
Figure
2. Ve
hi
cl
e
route
of
w
orki
ng area
2
i
n Sak
o
Distric
t
Table
4.
R
obust
V
aria
ble V
al
ue
w
it
h OCVR
P
Work
i
ng Are
a 3
i
n
Sa
ko
dis
tric
ts
Variable
W
o
rkin
g
Ar
ea
3
2
2
.98
01
0
10
1
1
0
2
7500
The
value
s
li
ste
d
i
n
1
,
2
of
Ta
bl
e
4
re
pr
e
sent
t
he
vlo
m
e
of
w
ast
e
trans
porte
d
upon
le
a
ving
T
PS
-
(
=
1
,
2
)
,
so
that
1
=
0
,
2
=
7500
.
Rou
t
es
that
m
us
t
be
passe
d
by
dum
p
truck
f
or
garba
ge
tra
nsp
or
t
at
work
i
ng
area
3
is
TP
S
1
-
TP
A
Ka
rya
Jay
a.
Mi
ni
m
u
m
ro
ut
e
the
dri
ver
pa
sses
in
gr
a
ph
form
as
exp
la
ined
i
n
Fig
ure
3.
1
TPA
Figure
3. Ve
hi
cl
e
route
of
w
orki
ng area
3
i
n Sak
o
district
s
Table
5.
R
obust
V
aria
ble V
al
ue wit
h OCVR
P
Work
i
ng Are
a 4
i
n
Sa
ko
dis
tric
ts
Variable
W
o
rkin
g
Ar
ea
4
Variable
W
o
rkin
g
Ar
ea
4
4
5
.45
30
0
01
0
31
0
02
0
32
0
03
0
34
1
04
0
40
1
10
0
41
0
12
1
42
0
13
0
43
0
14
0
1
1800
20
0
2
4500
21
0
3
6000
23
1
4
7600
24
0
The
values
li
s
te
d
in
1
,
2
,
3
,
4
of
Ta
ble
5.
The
val
ues
li
ste
d
in
TPS
-
(
=
1
,
2
,
3
,
4
)
,
s
o
that
1
=
1800
,
2
=
4500
,
3
=
6000
,
4
=
7600
.
Ro
utes
t
hat
m
us
t
be
passe
d
by
du
m
p
tr
uc
k
for
garba
ge
trans
port
at
work
i
ng
a
re
a
4
is
TPS
1
–
TPS
2
–
T
PS
3
–
TPS
4
–
TP
A
Kar
ya
Jay
a.
M
ini
m
u
m
ro
ute
the
dri
ver
pass
es
is
dep
ic
te
d i
n Fi
g
ure
4.
1
2
3
4
TPA
Figure
4. Ve
hi
cl
e
route
of
w
orki
ng area
4
i
n Sak
o
district
s
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
20
88
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol.
8
, N
o.
6
,
Dece
m
ber
2
01
8
:
4382
-
4390
4386
Table
6
is
a
s
ol
ution
ta
ble
of
the
Ro
bust
C
ounte
rp
a
rt
OCV
RP
m
od
el
in
S
uk
a
ram
i
district
s
.
From
the
ta
ble,
it
can
be
fou
nd
that
the
optim
al
ro
ute
distance
for
w
orkin
g
a
rea
1
is
44.
39
km
,
w
orkin
g
a
rea
2
is
49.
32
km
,
work
i
ng
a
rea
3
is
58.
57
km
,
work
i
ng
a
rea
4
is
24.
07
km
,
work
i
ng
a
rea
5
is
77.
66
km
.
And
w
ork
ing
ar
ea
6
is
44.
94
km
.
Wh
il
e
Ta
ble
7
sh
ows
the
val
ue
of
the
decisi
on
va
riable
f
or
w
orkin
g
a
rea
1,
Table
8
sho
ws
t
he
value
of
the
de
ci
sion
va
riabl
e
fo
r
work
i
ng
area
2,
Table
9
sh
ows
the
value
of
the
de
ci
sion
va
riabl
e
for
work
i
ng
area
3,
Ta
ble
10
shows
t
he
val
ue
of
the
decisi
on
var
ia
ble
for
w
orkin
g
area
4,
Table
11
s
how
s
the
value
of
t
he
de
ci
sion
va
riable
f
or
w
orki
ng
a
rea
5,
an
d
Tab
le
12
s
hows
th
e
val
ue
of
the
decisi
on
var
ia
bl
e
for
work
i
ng
area
6.
The
value
s
l
ist
ed
in
1
,
2
of
Tab
le
7
re
pr
ese
nt
t
he
vl
om
e
of
w
ast
e
trans
porte
d
up
on
le
a
ving
TPS
-
(
=
1
,
2
)
,
so
t
hat
1
=
3800
,
2
=
7500
.
Rou
te
s
that
m
us
t
be
passed
by
dum
p
truck
for
ga
r
ba
ge
trans
port
at
wo
r
king
area
1
is
TPS
1
-
TP
S
2
-
T
PS
3
-
TP
A
Kar
ya
Jay
a.
Mi
ni
m
u
m
ro
ute
the
dr
ive
r
pas
s
es
in
Fig
ure
5.
Tabl
e
6.
So
l
ution
of R
obus
t C
ounter
par
t
OC
VRP
in
S
ukara
m
i
district
s
So
lv
er
Statu
s
W
o
rkin
g
Ar
ea
1
W
o
rkin
g
Ar
ea
2
W
o
rkin
g
Ar
ea
3
W
o
rkin
g
Ar
ea
4
W
o
rkin
g
Ar
ea
5
W
o
rkin
g
Ar
ea
6
Mod
el Class
MI
L
P
MI
L
P
MI
L
P
MI
L
P
MI
L
P
MI
L
P
State
Glo
b
al
Op
ti
m
al
Glo
b
al
Op
ti
m
al
Glo
b
al
Op
ti
m
al
Glo
b
al
Op
ti
m
al
Glo
b
al
Op
ti
m
al
Glo
b
al
Op
ti
m
al
Ob
jectiv
e
4
4
.39
4
9
.32
5
8
.57
2
4
.07
7
7
.66
4
4
.94
Inf
easib
elity
0
0
0
0
0
0
Iter
atio
n
s
0
0
0
0
0
0
So
lv
er
T
y
p
e
Bran
ch
and
Bo
u
n
d
Bran
ch
and
Bo
u
n
d
Bran
ch
and
Bo
u
n
d
Bran
ch
and
Bo
u
n
d
Bran
ch
and
Bo
u
n
d
Bran
ch
and
Bo
u
n
d
Bes
t Objectiv
e
4
4
.39
4
9
.32
5
8
.57
2
4
.07
7
7
.66
4
4
.94
Step
s
0
0
0
0
0
0
Up
d
ate I
n
terval
2
2
2
2
2
2
GMU
21
25
25
19
30
25
ER
0
0
0
0
0
0
Table
7.
R
obust
V
aria
ble V
al
ue wit
h OCVR
P
Work
i
ng Are
a 1
i
n
S
ukaram
i
district
s
Variable
W
o
rkin
g
Ar
ea
1
Variable
W
o
rkin
g
Ar
ea
1
4
4
.39
20
1
01
0
21
0
02
0
1
3800
10
0
2
7500
12
1
1
2
TPA
Figure
5. Ve
hi
cl
e
route
of
w
orki
ng area
1in
Sukaram
i
district
s
Table
8.
R
obust
V
aria
ble V
al
ue wit
h OCVR
P
Work
i
ng Are
a 2
i
n
S
ukaram
i
district
s
Variable
W
o
rkin
g
Ar
ea
2
Variable
W
o
rkin
g
Ar
ea
2
4
9
.32
21
0
01
0
23
1
02
0
30
1
03
0
31
0
10
0
32
0
12
1
1
2500
13
0
2
5100
20
0
3
7800
The
values
li
ste
d
in
1
,
2
,
3
of
Table
8
represe
nt
th
e
vlo
m
e
of
wa
ste
trans
ported
upon
le
a
ving
TPS
-
(
=
1
,
2
,
3
)
,
s
o
that
1
=
2500
,
2
=
5100
,
3
=
7800
.
R
oute
s
that
m
us
t
be
pass
ed
by
dum
p
truc
k
f
or
garba
ge
trans
port
at
w
orkin
g
area
2
is
TP
S
1
-
T
PS
2
-
T
P
S
3
-
T
PA
Kar
y
a
Jay
a.
Mi
ni
m
um
ro
ute
the
dr
i
ver
passes
is
expla
ined
i
n
Fi
g
ure
6.
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
& C
om
p
Eng
IS
S
N: 20
88
-
8708
Ro
bu
st C
ounte
rp
art
Ope
n
C
apacitate
d
Ve
hi
cl
e
Ro
uting
…
(
Fit
ri Maya
P
uspit
a
)
4387
1
2
3
TPA
Figure
6. Ve
hi
cl
e
route
of
w
orki
ng area
2
i
n Su
kar
am
i
district
s
Table
9.
R
obust
V
aria
ble V
al
ue wit
h OCVR
P
Work
i
ng Are
a 3
i
n
S
ukaram
i
district
s
Variable
W
o
rkin
g
Ar
ea
3
Variable
W
o
rkin
g
Ar
ea
3
5
8
.57
21
0
01
0
23
0
02
0
30
1
03
1
31
0
10
0
32
0
12
1
1
3600
13
0
2
7700
20
1
3
6700
The
values
li
ste
d
in
1
,
2
,
3
of
Table
9
represe
nt
th
e
vlo
m
e
of
wa
ste
trans
ported
upon
le
a
ving
TPS
-
(
=
1
,
2
,
3
)
,
s
o
t
hat
1
=
3600
,
2
=
7700
,
3
=
6700
.
R
ou
te
s
that
m
us
t
be
passe
d
by
du
m
p
tr
uc
k
f
or
garba
ge
tran
sport
at
w
orkin
g
area
3
is
TP
S
1
–
TPS
2
–
T
P
A
Ka
rya
Jay
a
–
TPS
3
–
T
PA
K
arya
Jay
a.
Mi
ni
m
u
m
route
is i
n
Fig
ure
7
.
1
3
2
TPA
Figure
7. Ve
hi
cl
e
route
of
w
orki
ng area
3
i
n Su
kar
am
i
district
s
Table
10. Rob
us
t V
ariable
V
al
ue
with
O
C
V
RP
Wo
r
king
A
rea
4
in
S
uk
a
ra
m
i
district
s
Variable
W
o
rkin
g
Area
4
2
4
.07
01
0
10
1
1
0
2
7600
The
val
ues
li
ste
d
i
n
1
,
2
of
Ta
bl
e
10
re
pr
e
sent
the
vlo
m
e
of
waste
tra
nsp
ort
ed
upon
le
a
vi
ng
T
PS
-
(
=
1
,
2
)
,
s
o
that
1
=
0
,
2
=
7600
.
R
ou
te
s
that
m
us
t
be
pa
ssed
by
dum
p
truc
k
f
or
garba
ge
t
ran
s
port
at
work
i
ng
area
4
is
T
PS
1
-
TP
A
Kar
ya
Jay
a.
Mi
nim
u
m
ro
ut
e
the
dri
ve
r
pa
sses
in
grap
h
f
or
m
as
Fig
ure
11
exp
la
ine
d.
1
TPA
Figure
8. Ve
hi
cl
e Rou
te
of
W
orkin
g Ar
ea
4 in S
ukaram
i
district
s
The
values
li
st
ed
in
1
,
2
,
3
,
4
of
Ta
ble
11
.
T
he
valu
es
li
ste
d
in
TP
S
-
(
=
1
,
2
,
3
,
4
)
,
so
t
hat
1
=
4900
,
2
=
3800
,
3
=
7900
,
4
=
7400
.
Ro
utes
t
hat
m
us
t
be
passe
d
by
du
m
p
tr
uc
k
for
garba
ge
trans
port
at
work
i
ng
a
re
a
5
is
TPS
1
–
TPS
3
–
T
PA
Kar
ya
Jay
a
–
T
PS
2
–
TP
S
4
–
TPA
Kar
ya
Ja
ya
.
Mi
ni
m
u
m
route
the
dr
i
ver
passe
s
is
d
esc
ribe
d
in
F
igure
9.
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
20
88
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol.
8
, N
o.
6
,
Dece
m
ber
2
01
8
:
4382
-
4390
4388
Table
11. Rob
us
t V
ariable
V
al
ue
with
O
C
V
RP
Wo
r
king
A
rea
5
in
S
uk
a
ra
m
i
district
s
Variable
W
o
rkin
g
Ar
ea
5
Variable
W
o
rkin
g
Ar
ea
5
7
7
.66
30
1
01
0
31
0
02
1
32
0
03
0
34
0
04
0
40
1
10
0
41
0
12
0
42
0
13
1
43
0
14
0
1
4900
20
0
2
3800
21
0
3
7900
23
0
4
7400
1
3
TPA
4
2
Figure
9. Ve
hi
cl
e Rou
te
of
W
orkin
g Ar
ea
5 in S
ukaram
i
district
s
Table
12. Rob
us
t V
ariable
V
al
ue
with
O
C
V
RP
Wo
r
king
A
rea
6
in
S
uk
a
ra
m
i
district
s
Variable
W
o
rkin
g
Ar
ea
VI
Variable
W
o
rkin
g
Ar
ea
VI
4
4
.94
21
0
01
0
23
1
02
0
30
1
03
0
31
0
10
0
32
0
12
1
1
2500
13
0
2
5600
20
0
3
7900
The
valu
es
li
ste
d
i
n
1
,
2
,
3
of
T
able
12
re
present
th
e
vl
om
e
of
was
te
trans
porte
d
upon
le
a
ving
T
PS
-
(
=
1
,
2
,
3
)
,
s
o
that
1
=
2500
,
2
=
5600
,
3
=
7900
.
R
oute
s
that
m
us
t
be
pass
ed
by
dum
p
truc
k
f
or
garba
ge
trans
port
at
w
orkin
g
area
6
is
TP
S
1
-
T
PS
2
-
T
P
S
3
-
T
PA
Kar
y
a
Jay
a.
Mi
ni
m
um
ro
ute
the
dr
i
ver
passes
i
n gr
a
ph
for
m
as F
ig
ure
10 e
xp
la
ine
d.
1
2
3
TPA
Figure
10. Ve
hi
cl
e
route of
w
orkin
g
a
rea
6
i
n
S
ukaram
i
district
s
4.
CONCL
US
I
O
N
Fr
om
the
cal
cu
la
ti
on
of
Ro
bust
Counter
par
t
OCVRP
M
od
e
l
with
the
hel
p
of
Li
ngo
13.0
Pr
og
ram
,
it
can
be
obta
ine
d
t
he
op
ti
m
u
m
route
in
Sa
ko
di
stric
ts
is
as
fo
l
lows
.
F
or
worki
ng
area
1
,
the
route
is
TPS
1
-
TPS
2
-
T
PS
3
-
T
PA
with
dista
nce
of
53.
39
km
.
Fo
r
w
orkin
g
a
rea
2
,
the
rout
e
is
TPS
1
-
T
P
S
2
-
TPS
3
-
TP
A
with
distance
of
48.
14
km
.
W
he
re
as
fo
r
w
orki
ng
area
3
,
the
rou
te
is
TPS
1
-
TP
A
with
a
distance
of
22.98
km
,
and
work
i
ng
area
4
,
the
r
oute
is
T
PS
1
-
TP
S
2
-
T
PS
3
-
TP
S
4
-
T
PA
with
45.45
km
distance.
Nex
t,
f
or
t
he
obta
ine
d
op
ti
m
u
m
ro
ute
in
Suka
ram
i
district
s
is
as
fo
l
lows
.
For
wor
kin
g
a
rea
1
,
t
he
r
ou
te
is
TP
S
1
-
T
PS
2
-
TP
A
of
44.
39
km
.
Fo
r
w
orki
ng
a
rea
2
,
the
route
is
TPS
1
-
TPS
2
-
T
PS
3
-
TPA
with
dist
ance
of
49.
32
km
.
Fo
r
w
orki
ng
a
rea
3
,
t
he
route
is
TPS
1
-
TPS
3
-
TPA
-
TPS
2
-
T
PA
with
distan
ce
58.
57
km
.Lastl
y,
for
wor
ki
ng
area
4
,
the
route
is
TPS
1
-
TP
A
wi
th
a
distance
of
24.
07
km
.
W
orkin
g
area
5
ha
s
route
of
TP
S
1
-
T
PS
3
-
TP
A
-
T
PS
2
-
TP
S
4
-
T
P
A
with a
distance
of
77.66 km
, an
d w
orki
ng are
a
6
is
a TP
S
1
-
TPS 2
-
TPS 3
-
TPA
with
a
distante
44.94 km
.
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
& C
om
p
Eng
IS
S
N: 20
88
-
8708
Ro
bu
st C
ounte
rp
art
Ope
n
C
apacitate
d
Ve
hi
cl
e
Ro
uting
…
(
Fit
ri Maya
P
uspit
a
)
4389
ACKN
OWLE
DGE
MENTS
The
researc
h
l
eadin
g
to
this
stud
y
was
fina
ncial
ly
su
pp
or
t
ed
by
Sr
i
wij
ay
a
U
niv
e
rsity
f
or
sup
port
thr
ough
Com
petit
ive Leadin
g Gra
nt i
n 201
7
.
REFERE
NCE
S
[1]
Irm
ei
l
y
ana,
F.
M.
Pus
pit
a,
an
d
Indra
wat
i
,
Pem
odel
an
dan
s
olusi
opti
mal
Open
Capacitat
ed
V
ehi
c
le
Rou
ti
ng
Proble
m
pada
transpor
tasi
pengangk
utan
sa
mpah
di
Distri
ct
I
li
r
Timur
I
Kota
Pal
emba
ng
,
in
Proc
ee
di
ng
Konfe
rensi
Nasi
onal
Tekno
logi
I
nformas
i
dan
Ap
li
kasiny
a
,
Fak.
I
l
mu Kompute
r UNSRI
.
2009
.
[2]
P.
Tot
h
,
and
D.
Vigo,
Ex
a
ct
soluti
on
o
f
the
vehic
l
e
routing
problem
,
in
Fl
e
et
Manage
ment
an
d
Logis
ti
cs
,
T
.
G
.
Crani
c
and
G. L
apor
te, Edit
ors.
1998,
Kluwer
Aca
demic
Publish
er:
Norw
ell.
p.
1
-
31.
[3]
J.
Sniez
ek
,
and
L.
Bodin
,
‘Cost
models
for
ve
hi
c
le
routin
g
probl
ems
,
in
35th
Ha
waii
Int
ernati
on
al
Confe
ren
ce
o
n
Syste
m Scien
ce
.
2002.
Hawa
ii
.
[4]
S.
Um
ar,
P.V.R
.
D.P.
Rao
,
and
S.
Gutta,
Tr
ee
Based
En
ergy
B
alanc
ing
Routin
g
Protoc
o
l
by
S
el
f
Or
ganizing
in
Wirel
ess
Sensor
Net
works
,
In
te
r
nat
ion
al
Journal
of
Elec
tr
ical
an
d
Com
pute
r
En
gine
er
ing
(IJEC
E),
2015
.
5
(6):
p.
1486
-
1491.
[5]
F.M.
Pus
pit
a,
O
n
Capaci
ta
te
d
V
ehi
c
le
Rout
ing
Proble
m
,
in
Mat
hemati
cs
Depart
ment
.
2004
,
M.
Sc
The
sis.
Cur
tin
Univer
sit
y
of
T
e
chnol
og
y
:
Perth.
[6]
F.M
.
Pus
pit
a,
A
pli
kasi
Tekn
ik
P
reproce
ss
ing
pada
PB
ILP
dan
S
olusiny
a
dengan
Branch
and
bound.
JM
AP
,
200
6.
5
(2):
p.
127
-
132
.
[7]
A.N.
Letch
ford
,
J.
L
y
sg
aa
rd
.
,
an
d
R.
W
.
Eglese.
A
branch
and
c
ut
algorit
hm
for
capac
i
tat
ed
op
e
n
ve
hi
cl
e
rout
in
g
problem
.
2006
[
ci
t
ed
2009
11
Ju
l
y
]
;
Ava
il
ab
le fr
om
:
htt
p://ww
w.l
anc
s.
ac.uk/
staff
/
le
t
chf
oa/art
i
cles/
ovrp/pdf
.
[8]
H.M.
Solim
an,
a
nd
M.
Solim
an,
Design
of
Obs
erv
er
-
Based
Robu
st
Powe
r
Syste
m
Stabi
li
z
ers.
Internat
ion
al
Journal
of
Elec
tr
ical and
Com
pute
r
Eng
i
nee
ring
(IJECE)
,
2016
.
6
(5):
p
.
1
956
-
1966.
[9]
J.M.
Fard,
M.A.
Nekoui
,
A.K
.
Sedigh
and
R.
Am
ja
difa
rd,
Ro
bust
Mult
i
varia
ble
Control
le
r
Design
wit
h
th
e
simultane
ous
H2/H∞/µ
for
a
Sin
gle
Pe
rs
on
Ai
rcraft.
Int
ern
ational
Journal
of
El
ec
t
ric
a
l
and
Com
pute
r
Engi
n
ee
rin
g
(IJECE),
20
13.
3
(2):
p.
279
-
286
.
[10]
F.
Pirouzmand,
Robust
Mode
l
Predi
ct
i
ve
Co
ntrol
Ba
sed
on
MRA
S
for
Sa
te
llite
A
tt
i
tude
Control
Syste
m.
Inte
rna
ti
ona
l
Jou
rna
l
of
E
le
c
trica
l
and
Com
puter Enginee
r
ing
(IJE
CE),
2014
.
4
(1
): p.
81
-
92
.
[11]
Y.
Neste
rov,
an
d
A.
Nem
irovski
,
Inte
rior
Poi
nt
Pol
ynomial
A
lgo
rithms
in
Conve
x
Program
ming.
SIA
M
Studie
s
i
n
Aplli
ed
Mathe
m
at
i
cs,
1994
.
[12]
A.
Ben
-
Tal,
and
A.
Nem
irovski,
Lect
ures
on
Mo
dern
Conve
x
Op
ti
mization:
Ana
l
ysis,
Al
gori
thms,
and
Engi
ne
erin
g
Appl
ic
a
ti
ons
.
20
01:
Soci
ety
fo
r
I
ndustria
l
and
Applie
d
Mathe
m
ati
cs.
BIOGR
AP
H
I
ES
OF
A
UTH
ORS
Fitri
Ma
y
a
Pus
pit
a
re
ce
iv
ed
her
S.Si
degr
ee
in
Mathe
m
at
i
cs
from
Sriwijay
a
Univer
sit
y
,
South
Sum
at
era
,
Indo
nesia
in
1997.
The
n
she
recei
ved
he
r
M.Sc
in
Mathe
m
at
i
c
s
from
Curti
n
Univer
sit
y
of
Technol
og
y
(CUT)
W
este
rn
Aus
tralia
in
2004.
She
rev
ei
v
ed
h
is
Ph.D
in
Sci
ence
and
Tech
nolog
y
in
2015
from
Univer
siti
Sains
Islam
Malay
s
ia.
She
has
be
en
a
Mathe
m
atics
Depa
rtment
m
e
m
ber
at
Fa
cul
t
y
m
at
hematics
an
d
Natur
a
l
Sci
en
ce
s
Sriwij
a
y
a
U
nive
rsit
y
South
Sum
at
era
Indon
esia
sinc
e
1998.
Her
rese
ar
ch
in
te
rests
in
cl
ude
o
pti
m
iz
ation
and
it
s
appl
i
cations
such
as
v
ehi
c
le r
outi
ng
prob
le
m
s a
nd
QoS
pri
ci
ng
and
ch
arg
ing
in
t
hird
gen
erati
on
i
nte
rne
t
.
Yus
uf
Hart
ono
rec
e
ive
d
h
is
Ba
che
lor
of
Sci
en
ce
in
Math
emat
ic
s
Edu
ca
t
ion
f
rom
Sriwja
y
a
Univer
sit
y
,
Indo
nesia
in
1988.
The
n
h
e
re
ceive
d
his
M.Sc
in
Math
and
Stat
s
from
Univ.
of
Miss
ouri
at
Roll
a,
US
A
in
1993
.
He
rev
ei
v
ed
his
Ph.D
in
Mathem
at
ic
s
in
2003
f
rom
Te
chni
sche
Univer
siteit
Delf
t,
Nede
r
la
nd
.
He
has
bee
n
a
Ma
t
hemati
cs
Stud
y
Program
m
embe
r
at
Facu
lty
of
Educ
a
ti
on
and T
hea
ch
er
Tr
ai
ning
Sriwija
y
a
Unive
rsit
y
South Sum
at
er
a
Indone
sia
s
inc
e
1990
.
His
rese
arc
h
in
te
rest
s inc
lud
e
st
at
isti
cs
and it
s
appl
i
c
at
ion
.
Nadia
Zu
li
a
t
y
S
y
aput
r
i
cur
r
entl
y
is
an
under
gra
duate
studen
t
at
Ma
the
m
at
i
cs
Depa
rtment
,
Facul
t
y
of
Math
emati
cs
and
Na
t
ura
l
Sc
ie
nc
es,
S
riw
ij
a
y
a
Unive
r
sit
y
.
She
is
cur
r
ent
l
y
on
fin
al
stage
of
her
th
e
sis
sub
m
ission.
Her
topi
c
in
te
re
st
inc
lude
s
Opti
m
iz
at
ion
and
it
s
appl
icati
on
on
routi
ng
som
e co
m
m
odit
ie
s.
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
20
88
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol.
8
, N
o.
6
,
Dece
m
ber
2
01
8
:
4382
-
4390
4390
W
eni
Dw
i
Prati
wi
rec
e
ive
d
h
er
S.Pd
degr
ee
in
Mathe
m
at
i
cs
Educ
ation
f
rom
Sriwijay
a
Univer
sit
y
,
Sout
h
Sum
at
era
,
Ind
onesia
in
2011
.
The
n
she
al
so
re
ce
iv
ed
her
M
.
Sc
in
Mathe
m
atics
Educ
a
ti
on
from
Sriwijay
a
Univ
ersity
,
South
Sum
at
era
,
Indon
esia
in
2013
and
from
Utre
cht
Univer
sit
y
,
Net
her
la
nds.
She
h
as
bee
n
a
Math
emati
cs
Educat
i
on
Stud
y
Progr
am
m
ember
at
Facul
t
y
of
Educat
ion
and
T
each
er
Tr
ai
ning
Sriw
ij
a
y
a
Univer
sit
y
South
Sum
at
era
Indone
sia
sinc
e
2015.
Her
rese
ar
ch
in
te
rests
inclu
de
m
at
hema
ti
cs
educ
a
ti
on
and it
s
applications.
Evi
Yuliza
her
S.Si
degr
ee
i
n
Mathe
m
at
i
cs
from
Sriwijay
a
Unive
rsit
y
,
S
outh
Sum
at
era
,
Indone
sia
in
2000.
The
n
she
rece
ive
d
her
M.Si
in
Mathe
m
at
ic
s
fr
om
Gadja
h
Mada
Univer
sit
y
in
2004.
Her
rese
ar
ch
in
te
rests
incl
udse
Algebr
a
.
S
he
has
b
ee
n
a
Mathe
m
atics
Dep
a
rtment
m
ember
at
Fa
cul
t
y
m
a
th
emati
cs
and
Nat
ura
l
Sci
ences
Sriwi
jay
a
Univer
si
t
y
South
Sum
atera
Indon
esia
since
2008
.
Evaluation Warning : The document was created with Spire.PDF for Python.