Aneffectivememeticalgorithmforthecumulativecapacitatedvehicleroutingproblem

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.