Elsevier

Information Processing Letters

Volume 112, Issue 5, 28 February 2012, Pages 195-199
Information Processing Letters

Probabilistic single obnoxious facility location with fixed budget

https://doi.org/10.1016/j.ipl.2011.09.001Get rights and content

Abstract

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.

Highlights

► 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.

References (9)

  • J.J. Saameño Rodríguez et al.

    A general model for the undesirable single facility location problem

    Operations Research Letters

    (2006)
  • O. Berman et al.

    The expropriation location problem

    Journal of Operational Research Society

    (2003)
  • O. Berman et al.

    A probabilistic minimax location problem on the plane

    Annals of Operations Research

    (2003)
  • O. Berman et al.

    The expected maximum distance objective in facility location

    Journal of Regional Science

    (2003)
There are more references available in the full text version of this article.

This paper is supported by NSFC (No. 11101256).

View full text