Title of article
Heuristic andexactalgorithmsforamin–maxselectivevehicle routing problem
Author/Authors
Cristiano ArbexValle، نويسنده , , LeonardoConegundesMartinez، نويسنده , , AlexandreSallesdaCunha ، نويسنده , , GeraldoR.Mateus، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
12
From page
1054
To page
1065
Abstract
In thiswork,weinvestigateavehicleroutingproblemwherenotallclientsneedtobevisitedandthegoal
is tominimizethelongestvehicleroute.Weproposetwoexactsolutionapproachesforsolvingthe
problem:aBranch-and-cut(BC)algorithmandaLocalBranching(LB)methodthatusesBCasitsinner
solver.Ourcomputationalexperienceindicatesthat,inpractice,theproblemisdifficulttosolve,mainly
when thenumberofvehiclesgrows.Inadditiontotheexactmethods,wepresentaheuristicthatrelieson
GRASPandontheresolutionofarestrictedintegerprogrambasedonasetcoveringreformulationforthe
problem.TheheuristicwascapableofsignificantlyimprovingthebestsolutionsprovidedbyBCandLB,in
one tenthofthetimestakenbythemtoachievetheirbestupperbounds.
Keywords
Heuristics , Branch-and-cut , Local branching , Vehicle routing problem
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927924
Link To Document