Heuristics for a continuous multi-facility location problem with demand regions


DİNLER D. , TURAL M. K. , İYİGÜN C.

COMPUTERS & OPERATIONS RESEARCH, cilt.62, ss.237-256, 2015 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 62
  • Basım Tarihi: 2015
  • Doi Numarası: 10.1016/j.cor.2014.09.001
  • Dergi Adı: COMPUTERS & OPERATIONS RESEARCH
  • Sayfa Sayıları: ss.237-256

Özet

We consider a continuous multi-facility location allocation problem where the demanding entities are regions in the plane instead of points. The problem can be stated as follows: given m (closed, convex) polygonal demand regions in the plane, find the locations of q facilities and allocate each region to exactly one facility so as to minimize a weighted sum of squares of the maximum Euclidean distances between the demand regions and the facilities they are assigned to.