Improved algorithms for placing undesirable facilities

Improved algorithms for placing undesirable facilities

0.00 Avg rating0 Votes
Article ID: iaor200387
Country: United Kingdom
Volume: 29
Issue: 13
Start Page Number: 1859
End Page Number: 1872
Publication Date: Nov 2002
Journal: Computers and Operations Research
Authors: , ,
Keywords: obnoxious facilities
Abstract:

We improve several existing algorithms for determining the location of one or more undesirable or obnoxious facilities amidst a set P of n demand points, under various constraints and distance functions. We assume that the demand points reside within some given bounded region R. Applying concepts and techniques from Computational Geometry, we provide efficient algorithms for the following problems: (1) Maxmin multi-facility location: Locate k undesirable facilities within R under the constraints that the smallest distance between each demand point and the facilities is at least a given r, and the distance between any two facilities is at least a given 𝒟. Under the L∞ (L1) norm we present efficient algorithms for any k, and under the L2 norm we can locate efficiently two such facilities. In all cases, R is assumed to be an axis-parallel rectangle. (2) Minsum coverage: Given a set of weighted demand points contained in an axis-parallel rectangular region R, and given a smaller axis-parallel rectangle Q, place Q within R such that the sum of weights of the demand points contained in Q is minimized.

Reviews

Required fields are marked *. Your email address will not be published.