The Obnoxious Facilities Planar p-Median Problem with Variable Sizes
研究了令人厌恶设施（如垃圾场）的选址问题，其中设施规模随服务量变化，规模越大应离社区越远，目标是满足最小距离要求下最小化运营成本，并为非线性求解器设计了高效初始解。
The obnoxious facility location problem is to locate facilities that have a negative impact on communities (being “obnoxious”) and being farther from communities is preferred. For example, noisy or polluting factories, garbage dumps, airports, should not be located close to communities. Such facilities also serve the communities, otherwise they are not needed. Our goal is to minimize the system’s operating cost subject to a minimum distance requirement from communities. The multiple obnoxious facility problem is usually defined as locating several facilities maximizing the minimum distance between facilities and communities. However, not all facilities have the same impact on communities. In this paper we assume that the size of a facility depends on the volume of service provided by it. Larger garbage dumps, for example, should be located farther away from communities. The problem is extremely non-convex and available non-linear solvers are not performing well. We designed a special starting solution for non-linear solvers that provides better objective values, in a shorter run time.