Abstract
The multi-facility Weber problem is concerned with locating in the plane m facilities having unlimited capacities and allocating them to n customers at minimum total cost. The deterministic version is a non-convex optimization problem and difficult to solve exactly. In this work we focus on a probabilistic extension and consider the situation where the customer locations are randomly distributed. For this problem, we propose new heuristics based on the principle of vector quantization which are capable of computing good quality solutions for general distance functions and customer location distributions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aly AA, White JA (1978) Probabilistic formulations of the multifacility Weber problem. Nav Res Log Q 25: 531–547
Aras N, Özkısacık KC, Altınel İK (2006) Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps. J Oper Res Soc 57: 82–93
Brimberg J, Love RF (1993) Global convergence of a generalized iterative procedure for the location problem with ℓ p distances. Oper Res 41: 1153–1163
Brimberg J, Chen R, Chen D (1998) Accelerating convergence in the Fermat-Weber location problem. Oper Res Lett 22: 151–157
Charon I, Hudry O (2001) The noising methods: a generalization of some metaheuristics. Eur J Oper Res 135: 86–101
Cooper L (1963) Location-allocation problems. Oper Res 11: 331–343
Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev 6: 37–53
Cooper L (1978) The stochastic transportation-location problem. Comput Math Appl 4: 265–275
Eilon S, Watson-Gandy CDT, Christofides N (1972) Distribution management: mathematical modelling and practical analysis. Charles Griffin & Company Limited, London
Frenk JBG, Melo MT, Zhang S (1994) A Weiszfeld method for a generalized ℓ p distance minisum location model in continuous space. Location Sci 2: 111–117
Gray DH (1984) Vector quantization. IEEE ASSSP M 1: 4–29
Hsieh K-H, Tien F-C (2004) Self-organizing feature maps for solving location-allocation problems with rectilinear distances. Comput Oper Res 31: 1017–1031
Katz IN, Cooper L (1974) An always convergent numerical scheme for a random locational equilibrium problem. SIAM J Numer Anal 11: 683–692
Katz IN, Cooper L (1976) Optimal facility location for normally and exponentially distributed points. J Res Nat Bur Stand B 80B: 53–73
Linde Y, Buzo A, Gray RM (1980) An algorithm for vector quantizer design. IEEE T Commun COM-28: 84–95
Love RF, Juel H (1982) Properties and solution methods for large location-allocation problems. J Oper Res Soc 33: 443–452
Lozano S, Guerrero F, Onieva L, Larrañeta J (1998) Kohonen maps for solving a class of location-allocation problems. Eur J Oper Res 108: 106–117
Megiddo N, Supowit KJ (1984) On the complexity of some common geometric location problems. SIAM J Comput 13: 182–196
Rosing KE (1992) An optimal method for solving the (generalized) multi-Weber problem. Eur J Oper Res 58: 414–426
Weiszfeld E (1937) Sur le point lequel la somme des distances de n points donnés est minimum. Tôhoku Math J 43: 353–386
Wesolowsky GO (1977) The Weber problem with rectangular distances and randomly distributed destinations. J Reg Sci 17: 53–60
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Özkısacık, K.C., Altınel, İ.K. & Aras, N. Solving probabilistic multi-facility Weber problem by vector quantization. OR Spectrum 31, 533–554 (2009). https://doi.org/10.1007/s00291-008-0157-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-008-0157-0