The Generalized Noxious Facility Location Problem

This paper deals with the problem of determining the location of noxious facilities, which are undesirable to be near the customers living neighborhood. Here, we propose a new problemwhich is more applicable in the real world. In the proposed problem, there are n potential sites to be used for locating Pnoxious facilities with the aim of minimizing total received signals by the customers. The side constraints which are included in thisproblem are considering the total budget and limiting the amount of aggregated signals, received by each customer from all noxious facilities to maintain the healthy life. A mathematical model is proposed for the problem, accompanied with a Simulated Annealing metaheuristic to solve the problem.Computational results on a set of data sets show that the proposed metaheuristic method performs well in solving the problem.

Keywords:

Noxious Facility location problem , Covering problem , Simulated Annealing