Title of article :
A localbranchingheuristicforthecapacitatedfixed-chargenetworkdesignproblem
Author/Authors :
Inmaculada Rodr?guez-Mart?n، نويسنده , , JuanJoséSalazar-Gonz?lez، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Pages :
7
From page :
575
To page :
581
Abstract :
We describeinthisarticleanewheuristicapproachforthecapacitatedfixed-chargenetworkdesign problem. Thisisawellknown NP-hard problemthathasbeenextensivelystudied.Weproposetouse local branchingtotackleit.LocalbranchingisanovelmetaheuristictechniquepresentedbyFischettiand Lodi [Localbranching.MathematicalProgrammingSeriesB2003;98:23–47]thatutilizesageneralMIP solver toexploreneighborhoods.Ourimplementationistestedonalargesetofbenchmarkinstances. The resultsshowthatthemethodoutperformsthebestheuristicapproachesfoundintheliterature.
Keywords :
Network design , Heuristics , Local branching
Journal title :
Computers and Operations Research
Serial Year :
2010
Journal title :
Computers and Operations Research
Record number :
927671
Link To Document :
بازگشت