Multiple obnoxious facilities with weighted demand points

Abstract

In this paper we define and heuristically solve the multiple weighted obnoxious facilities location problem maximizing the minimum weighted distance between facilities and a given set of communities. Each community may have a different weight because different communities may be affected differently by a facility. The distance between pairs of facilities must exceed a given minimum distance. Solving the problem by the multi-purpose non-linear solver SNOPT from random starting locations performed poorly. Three approaches are proposed to generate “good” starting solutions. The best known solutions were established by these approaches.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 15 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.