Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem

ARAS M. N., Orbay M., ALTINEL İ. K.

Journal of the Operational Research Society, cilt.59, sa.1, ss.64-79, 2008 (SCI-Expanded, SSCI, Scopus) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 59 Sayı: 1
  • Basım Tarihi: 2008
  • Doi Numarası: 10.1057/palgrave.jors.2602262
  • Dergi Adı: Journal of the Operational Research Society
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.64-79
  • Anahtar Kelimeler: Heuristics, Location-allocation, Mixed integer programming formulation
  • Boğaziçi Üniversitesi Adresli: Evet

Özet

In this paper, we consider the capacitated multi-facility Weber problem with rectilinear distance. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the rectilinear distance separating them. We first give a new mixed integer linear programming formulation of the problem by making use of a well-known necessary condition for the optimal facility locations. We then propose new heuristic solution methods based on this formulation. Computational results on benchmark instances indicate that the new methods can provide very good solutions within a reasonable amount of computation time. © 2008 Operational Research Society Ltd. All rights reserved.