Title of article :
A branch-and-cutalgorithmforthepartitioning-hub
location-routingproblem
Author/Authors :
Daniele Catanzaro ، نويسنده , , EricGourdin، نويسنده , , MartineLabbe´ ، نويسنده , , F.AykutO¨، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
We introducethePartitioning-Hub-Location-RoutingProblem(PHLRP),ahublocationproblem
involvinggraphpartitioningandroutingfeatures.ThePHLRPconsistsofpartitioningagivennetwork
into sub-networks,locatingatleastonehubineachsub-networkandroutingthetrafficwithinthe
networkatminimumcost.ThisproblemfindsapplicationsindeploymentofanInternetRouting
ProtocolcalledIntermediateSystem–IntermediateSystem(ISIS),andstrategicplanningofLTLground
freightdistributionsystems.WepresentanIntegerProgramming(IP)modelforsolvingexactlythe
PHLRP andexplorepossiblevalidinequalitiestostrengthenit.Computationalexperimentsprovethe
effectivenessofourmodelwhichisabletotackleinstancesofPHLRPcontainingupto20vertices.
Keywords :
Hub-location , Branch-and-cut , Communication networks , Graph partitioning , Size constrained clique partitioning
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
