Location of semiobnoxious facilities. Different approaches

The paper presents some approaches for locating semiobnoxious facilities in a given network. Semiobnoxious are facilities that provide disservices as well as services. Hence, when locating semiobnoxious facilities, two conflicting objectives must be attained. Four approaches to this problem were studied, which led to different discrete location problems differing in the objectives to attain. Two of them are biobjective location problems while the others are location problems with one objective function and additional distance constraints. It is made certain that the demand points are neither too close to the nearest facility, in order to avoid the obnoxious effect, nor too far away so that they can be properly served. Lower and upper bounds were obtained for each approach making use of heuristic and relaxation methods. Some computational results for randomly generated problems are reported.