| Summary: | Vehicle routing problem
, also know
n as node routing problem has
been the focus of much res
earch attention.
On the c
ontrary,
capacitated arc routing problem
s (C
ARP) have been com
paratively
neglected. Both classes are NP-hard
and extremely rich in theory
and applications. From
CARP point
of view, a vehicle giving its
service whiles it on the route.
The capacity
of the vehicle get
increase alo
ng the rou
tes and its service s
tops when reach capacity.
In real life problem
, operation of
the vehicle is lim
ited to certain
tim
e duration and several options oc
cur for a vehicle for routing. In
this pap
er, we introdu
ce an ex
tended problem
case m
odel of CARP
that is CARP with tim
e wi
ndow (CARPTW
) and its initial
heuris
tic so
lution which
is related to a solid w
aste ope
ration in
Johor Bahru.
|
|---|