Title of article
Uncapacitated singleandmultipleallocation p-hub centerproblems
Author/Authors
Andreas T. Ernst، نويسنده , , HorstHamacherb، نويسنده , , HouyuanJiangc، نويسنده , , MohanKrishnamoorthy، نويسنده , , GerhardWoegingerd، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2009
Pages
12
From page
2230
To page
2241
Abstract
The hubmedianproblemistolocatehubfacilitiesinanetworkandtoallocatenon-hubnodestohub
nodes suchthatthetotaltransportationcostisminimized.Inthehubcenterproblem,themainobjective
is oneofminimizingthemaximumdistance/costbetweenorigindestinationpairs.Inthispaper,westudy
uncapacitated hubcenterproblemswitheithersingleormultipleallocation.Bothproblemsareproved
to beNP-hard.Weevenshowthattheproblemoffindinganoptimalsingleallocationwithrespecttoa
given setofhubsisalreadyNP-hard.Wepresentintegerprogrammingformulationsforbothproblems
and proposeabranch-and-boundapproachforsolvingthemultipleallocationcase.Numericalresultsare
reported whichshowthatthenewformulationsaresuperiortopreviousones.
Keywords
Facility planning and design , Hub center , NP-hard , Heuristic
Journal title
Computers and Operations Research
Serial Year
2009
Journal title
Computers and Operations Research
Record number
927608
Link To Document