A generalized Weiszfeld method for the multi-facility location problem

Iyigun C., Ben-Israel A.

OPERATIONS RESEARCH LETTERS, vol.38, no.3, pp.207-214, 2010 (Peer-Reviewed Journal) identifier identifier

  • Publication Type: Article / Article
  • Volume: 38 Issue: 3
  • Publication Date: 2010
  • Doi Number: 10.1016/j.orl.2009.11.005
  • Journal Indexes: Science Citation Index Expanded, Scopus
  • Page Numbers: pp.207-214
  • Keywords: Fermat-Weber location problem, Multi-facility location problem, Decomposition method, Probabilistic assignments, Weiszfeld method, ALGORITHM


An iterative method is proposed for the K facilities location problem. The problem is relaxed using probabilistic assignments, depending on the distances to the facilities. The probabilities, that decompose the problem into K single-facility location problems, are updated at each iteration together with the facility locations. The proposed method is a natural generalization of the Weiszfeld method to several facilities. (C) 2009 Elsevier B.V. All rights reserved.