Title of article
MIP modelsforconnectedfacilitylocation:Atheoreticaland computationalstudy
Author/Authors
Stefan Gollowitzer، نويسنده , , IvanaLjubic´ ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
15
From page
435
To page
449
Abstract
This articlecomprisesthefirsttheoreticalandcomputationalstudyonmixedintegerprogramming
(MIP)modelsfortheconnectedfacilitylocationproblem(ConFL).ConFLcombinesfacilitylocationand
Steiner trees:givenasetofcustomers,asetofpotentialfacilitylocationsandsomeinter-connection
nodes, ConFLsearchesfortheminimum-costwayofassigningeachcustomertoexactlyoneopen
facility,andconnectingtheopenfacilitiesviaaSteinertree.ThecostsneededforbuildingtheSteiner
tree,facilityopeningcostsandtheassignmentcostsneedtobeminimized.
We modelConFLusingsevencompactandthreemixedintegerprogrammingformulationsof
exponentialsize.WealsoshowhowtotransformConFLintotheSteinerarborescenceproblem.Afull
hierarchybetweenthemodelsisprovided.Fortwoexponentialsizemodelswedevelopabranch-and-
cut algorithm.Anextensivecomputationalstudyisbasedontwobenchmarksetsofrandomly
generatedinstanceswithupto1300nodesand115,000edges.Weempiricallycomparethepresented
modelswithrespecttothequalityofobtainedboundsandthecorrespondingrunningtime.Wereport
optimalvaluesforallbut16instancesforwhichtheobtainedgapsarebelow0.6%.
Keywords
Facility location , Steiner trees , Mixed integer programming models , LP-relaxations
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927869
Link To Document