Title of article :
A Branch-and-CutmethodfortheCapacitatedLocation-RoutingProblem
Author/Authors :
Jose´-Manuel Belenguer ، نويسنده , , EnriqueBenavent ، نويسنده , , ChristianPrins، نويسنده , ,
Caroline Prodhon، نويسنده , , RobertoWolflerCalvo، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
Recentresearchesinthedesignoflogisticnetworkshaveshownthattheoveralldistributioncostmaybe
excessiveifroutingdecisionsareignoredwhenlocatingdepots.TheLocation-RoutingProblem(LRP)
overcomesthisdrawbackbysimultaneouslytacklinglocationandroutingdecisions.Theaimofthispaper
is toproposeanexactapproachbasedonaBranch-and-CutalgorithmforsolvingtheLRPwithcapacity
constraintsondepotsandvehicles.Theproposedmethodisbasedonazero-onelinearmodel
strengthenedbynewfamiliesofvalidinequalities.Thecomputationalevaluationonthreesetsof
instances(34instancesintotal),with5–10potentialdepotsand20–88customers,showsthat26
instanceswithfivedepotsaresolvedtooptimality,includingallinstanceswithupto40customersand
three with50customers.
Keywords :
Branch-and-cut , vehicle routing , Facility location , Location-Routing Problem
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
