OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS

Abstract

The problem considered in this paper is the weighted obnoxious facility location in the convex hull of demand points. The objective function is to maximize the smallest weighted distance between a facility and a set of demand points. Three new optimal solution approaches are proposed. Two variants of the Big Small Triangle global optimization method, and a procedure based on intersection points between Apollonius circles. We also compared the results with a multi-start approach using the non-linear multi-purpose software SNOPT. Problems with 1,000 demand points are optimally solved in a fraction of a second of computer time.