Title of article
A multi-dimensionalshootingalgorithmforthetwo-facility location–allocationproblemwithdensedemand
Author/Authors
Alper Murat، نويسنده , , VedatVerter، نويسنده , , GilbertLaporte، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
14
From page
450
To page
463
Abstract
We developanefficientallocation-basedsolutionframeworkforaclassoftwo-facilitylocation–
allocationproblemswithdensedemanddata.Byformulatingtheproblemasamulti-dimensional
boundaryvalueproblem,weshowthatpreviousresultsforthediscretedemandcasecanbeextended
to problemswithhighlydensedemanddata.Further,thisapproachcanbegeneralizedtonon-convex
allocationdecisions.ThisformulationisillustratedfortheEuclideanmetriccasebyrepresentingthe
affine bisectorwithtwopoints.Aspecializedmulti-dimensionalshootingalgorithmispresentedand
illustratedonanexample.Comparisonswithtwoalternativemethodsthroughacomputationalstudy
confirm theefficiencyoftheproposedmethodology.
Keywords
Location–allocation problem , Shooting algorithm , Boundary value problem , Continuous modeling
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927870
Link To Document