Title of article :
A computationalcomparisonofseveralmodelsfortheexactsolutionofthe
capacityanddistanceconstrainedplantlocationproblem
Author/Authors :
Maria Albareda-Sambola، نويسنده , , ElenaFerna´ndez ، نويسنده , , GilbertLaporte، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
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
Journal title :
Computers and Operations Research
