Title of article
Acontinuousanalysisframeworkforthesolutionoflocation–allocationproblemswith dense demand
Author/Authors
Alper Murat، نويسنده , , VedatVerterb، نويسنده , , GilbertLaportec، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
14
From page
123
To page
136
Abstract
Location–allocation problemsariseinseveralcontexts,includingsupplychainanddatamining.Inits
most commoninterpretation,thebasicproblemconsistsofoptimallylocatingfacilitiesandallocatingcus-
tomers tofacilitiessoastominimizethetotalcost.Thestandardapproachtosolvinglocation–allocation
problems istomodelalternativelocationsitesandcustomersasdiscreteentities.Manyprobleminstances
in practiceinvolvedensedemanddataanduncertaintiesaboutthecostandlocationsofthepotential
sites. Theuseofdiscretemodelsisofteninappropriateinsuchcases.Thispaperpresentsanalternative
methodology wherethemarketdemandismodeledasacontinuousdensityfunctionandtheresulting
formulation issolvedbymeansofcalculustechniques.Themethodologyprioritizestheallocationdeci-
sions ratherthanlocationdecisions,whichisthecommonpracticeinthelocationliterature.Thesolution
algorithm proposedinthisframeworkisalocalsearchheuristic(steepest-descentalgorithm)andis
applicable toproblemswheretheallocationdecisionsareintheformofpolygons,e.g.,withEuclidean
distances. Extensivecomputationalexperimentsconfirmtheefficiencyoftheproposedmethodology.
Keywords
Voronoi diagrams , Continuous modeling , Location–allocation problem , Fermat–Weber problem
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927629
Link To Document