Title of article
Aneffectivememeticalgorithmforthecumulativecapacitatedvehicleroutingproblem
Author/Authors
Sandra UlrichNgueveu، نويسنده , , ChristianPrins، نويسنده , , RobertoWolflerCalvob، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
9
From page
1877
To page
1885
Abstract
The cumulativecapacitatedvehicleroutingproblem(CCVRP)isatransportationproblemwhichoccurs
when theobjectiveistominimizethesumofarrivaltimesatcustomers,insteadoftheclassicalroute
length, subjecttovehiclecapacityconstraints.Thistypeofchallengesariseswheneverpriorityisgiven
to thesatisfactionofthecustomerneed,e.g.vitalgoodssupplyorrescueafteranaturaldisaster.The
CCVRP generalizestheNP-hardtravelingrepairmanproblem(TRP),byaddingcapacityconstraintsand
a homogeneousvehiclefleet.Thispaperpresentsthefirstupperandlowerboundingproceduresfor
this newproblem.ThelowerboundsarederivedfromCCVRPproperties.Upperboundsaregivenbya
memetic algorithmusingnon-trivialevaluationsofcostvariationsinthelocalsearch.Goodresultsare
obtained notonlyontheCCVRP,butalsoonthespecialcaseoftheTRP,outperformingtheonlyTRP
metaheuristic published.
Keywords
Cumulative capacitated vehicle routing problem , Metaheuristic , Routing for relief , Traveling repairman problem , Memetic algorithm
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927794
Link To Document