Probabilistic single obnoxious facility location with fixed budget

This paper investigates probabilistic single obnoxious facility location with fixed budget which is defined as locating the facility to maximize the probability that the minimum weighted distance from the facility to all non-expropriated demand nodes exceeds a given threshold and the maximum weighted distance from the facility to all expropriated demand nodes does not exceed another given value, where demand weights are random variables with general continuous probability distributions. Properties of the optimal solutions are identified and heuristic solution procedures are presented, especially under the condition of some specific probability distributions. The general problem we propose also leads to some known problems such as maximin, quantile location problems.

► We investigate the model of probabilistic single obnoxious facility location with fixed budget. ► Properties of the optimal solutions are identified especially under the condition of some specific probability distributions. ► Heuristic solution procedures for solving the model are presented.