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


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

COMPUTERS & OPERATIONS RESEARCH, vol.62, pp.237-256, 2015 (Peer-Reviewed Journal) identifier identifier

  • Publication Type: Article / Article
  • Volume: 62
  • Publication Date: 2015
  • Doi Number: 10.1016/j.cor.2014.09.001
  • Journal Name: COMPUTERS & OPERATIONS RESEARCH
  • Journal Indexes: Science Citation Index Expanded, Scopus
  • Page Numbers: pp.237-256
  • Keywords: Facility location problems, Second order cone programming, Minimum sum of squares clustering, Hyperbolic smoothing, MINISUM LOCATION, WEBER PROBLEM, RESPECT

Abstract

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.