Title of article
A computationalcomparisonofseveralmodelsfortheexactsolutionofthe capacityanddistanceconstrainedplantlocationproblem
Author/Authors
Maria Albareda-Sambola، نويسنده , , ElenaFerna´ndez ، نويسنده , , GilbertLaporte، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
8
From page
1109
To page
1116
Abstract
The CapacityandDistanceConstrainedPlantLocationProblem is anextensionofthediscretecapacitated
plantlocationproblem,wherethecustomersassignedtoeachplanthavetobeassignedtovehicles.In
additiontothecapacityconstraintsontheplants,thereisalimitonthetotaldistancetraveledbyeach
vehicletoserveitsassignedcustomersbymeansofroundtrips.Thispaperpresentsseveralformulations
for theproblemandproposesdifferentfamiliesofvalidinequalities.Theresultsofextensivecomputa-
tional experimentsarepresentedandanalyzed.
Keywords
Discrete location
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927930
Link To Document