This paper presents a new variant of the capacitated multi-source Weber problem that introduces fixed costs for opening facilities. Three types of fixed costs are considered and experimented upon. A guided constructive heuristic scheme based on the concept of restricted regions and a greedy randomized adaptive search procedure (GRASP) are proposed. The four known data sets in the literature, typically used for the uncapacitated multi-source Weber problem, are adapted by adding capacities and facility fixed costs and used as a platform to assess the performance of our proposed approaches. Computational results are provided and some research avenues highlighted.
ArasN.AltınelI.K. and OrbayM., 2007a. New Heuristic Methods for the Capacitated Multi-Facility Weber Problem. Naval Research Logistics54, 21–32.
2.
ArasN.YumusakS. and AltınelI. K., 2007b. Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms. In DoernerK.F.GendreauM.GreistorferP.GutjahrW. J.HartlR.F. and ReimannM., editors. Metaheuristics: Progress in Complex Systems Optimization, Springer, 91–112.
3.
ArasN.OrbayM. and AltinelI.K., 2008. Efficient Heuristics for the Rectilinear Distance Capacitated Multi-Facility Weber Problem. Journal of the Operational Research Society59, 64–79.
4.
BrimbergJ.HansenP.MladenovićN. and TaillardE. D., 2000. Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem. Operations Research48, 444–460.
5.
BrimbergJ.MladenovićN. and SalhiS., 2004. The Multi-Source Weber Problem with Constant Opening Cost. Journal of the Operational Research Society55, 640–646.
6.
BrimbergJ. and SalhiS., 2005. A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost. Annals of Operations Research136, 99–115.
7.
BrimbergJ.HansenP.MladenovićN. and SalhiS., 2008. A Survey of Solution Methods for the Continuous Location-Allocation Problem. International Journal of Operations Research5, 1–12.
8.
CooperL., 1964. Heuristic Methods for Location-Allocation Problems. SIAM Review6, 37–53.
9.
CooperL., 1972. The Transportation-Location Problem. Operations Research20, 94–108.
10.
CooperL., 1975. The Fixed Charge Problem – I: A New Heuristic Method. Computers and Mathematics with Applications1, 89–95.
11.
CooperL.1976. An Efficient Heuristic Algorithm for the Transportation-Location Problem. Journal of Regional Science16, 309–3015.
12.
GongD.GenM.YamazakiG. and XuW., 1997. Hybrid Evolutionary Method for Capacitated Location-Allocation Problem. Computers and Industrial Engineering33, 577–580.
13.
KuehnA.A. and HamburgerM.J., 1963. A Heuristic Program for Locating Warehouses. Management Science9, 643–666.
14.
LuisM., 2008. Meta-heuristics for the Capacitated Multi-Source Weber Problem, Ph.D. Thesis, University of Kent, UK.
15.
LuisM.SalhiS. and NagyG., 2009. Region-Rejection Based Heuristics for the Capacitated Multi-Source Weber Problem, Computers and Operations Research, 36, 2007–2017.
16.
LuisM.SalhiS. and NagyG., 2011. A Guided Reactive GRASP for the Capacitated Multi-Source Weber Problem, Computers and Operations Research, 38, 1014–1024.
17.
MohammadiN.MalekM.R., and AlesheikhA. A., 2010. A New GA Based Solution for Capacitated Multi Source Weber Problem, International Journal of Computational Intelligence Systems, 3, 514–521.
18.
PreparataF. and ShamosM. I., 1985. Computational Geometry.Springer, New York.
19.
ResendeM.G.C. and RibeiroC.G., 2010. Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations and Applications. In GendreauM. and PotvinJ-Y., Editors. Handbook of Metaheuristics (2nd Edition), Springer, NY, p. 283–319.
20.
RosingK.E., 1992. The Optimal Location of Steam Generators in Large Heavy Oil Fields. American Journal of Mathematical and Management Sciences12, 19–42.
21.
SheraliH.D. and ShettyC. M., 1977. The Rectilinear Distance Location-Allocation Problem. AIIE Transaction9, 136–143.
22.
SheraliH.D. and TuncbilekC.H., 1992. A Squared-Euclidean Distance Location-Allocation Problem. Naval Research Logistics39, 447–469.
23.
SheraliH.D.RamachandranS. and KimS., 1994. A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem. Discrete Applied Mathematics49, 357–378.
24.
SheraliH.D.Al-LoughaniI. and SubramanianS., 2002. Global Optimization Procedures for the Capacitated Euclidean and ℓp Distance Multifacility Location-Allocation Problem. Operations Research50, 433–448.
25.
WeiszfeldE. and PlastriaF., 2009. On the Point for Which the Sum of the Distances to n Given Points is Minimum. Annals of Operations Research167, 7–41.
26.
ZainuddinZ.M. and SalhiS., 2007. A Perturbation-Based Heuristic for the Capacitated Multisource Weber Problem. European Journal of Operational Research179, 1194–1207.
