Efficiency for continuous facility location problems with attraction and repulsion

The paper deals with the problem of locating new facilities in presence of attracting and repulsive demand points in a continuous location space. When an arbitrary norm is used to measure distances and with closed convex constraints, we develop necessary conditions of efficiency. In the unconstrained case and if the norm derives from a scalar product, we completely characterize strict and weak efficiency and prove that the efficient set coincides with the strictly efficient set and/or coincides with the weakly efficient set. When the convex hulls of the attracting and repulsive demand points do not meet, we show that the three sets coincide with a closed convex set for which we give a complete geometrical description. We establish that the convex hulls of the attracting and repulsive demand points overlap iff the weakly efficient set is the whole space and a similar result holds for the efficient set when we replace the convex hulls by their relative interiors. We also provide a procedure which computes, in the plane and with a finite number of demand points, the efficient sets in polynomial time. Concerning constrained efficiency, we show that the process of projecting unconstrained weakly efficient points on the feasible set provides constrained weakly efficient points.

[1]  F. Plastria,et al.  The effects of majority in Fermat-Weber problems with attraction and repulsion in a pseudometric space , 1991 .

[2]  Jack Brimberg,et al.  On locating a semi-desirable facility on the continuous plane , 1998 .

[3]  Roland Durier,et al.  On Pareto optima, the Fermat-Weber problem, and polyhedral gauges , 1990, Math. Program..

[4]  Emanuel Melachrinoudis,et al.  Semi-obnoxious single facility location in Euclidean space , 2003, Comput. Oper. Res..

[5]  Erhan Erkut,et al.  Analytical models for locating undesirable facilities , 1989 .

[6]  Enrique Mérida Casermeiro,et al.  A general model for the undesirable single facility location problem , 2006, Oper. Res. Lett..

[7]  Malick M. Ndiaye.  Efficience sous contraintes et théorie de la localisation , 1996 .

[8]  Emanuel Melachrinoudis,et al.  LOCATING AN UNDESIRABLE FACILITY WITHIN A GEOGRAPHICAL REGION USING THE MAXIMIN CRITERION , 1985 .

[9]  Alice E. Smith,et al.  Bi-criteria model for locating a semi-desirable facility on a plane using particle swarm optimization , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[10]  Yoshiaki Ohsawa,et al.  Bicriteria Euclidean location associated with maximin and minimax criteria , 2000 .

[11]  Zvi Drezner,et al.  Location of Multiple Obnoxious Facilities , 1985, Transp. Sci..

[12]  Arie Tamir,et al.  Locating two obnoxious facilities using the weighted maximin criterion , 2006, Oper. Res. Lett..

[13]  Samuel J. Ratick,et al.  A Risk-Sharing Model for Locating Noxious Facilities , 1988 .

[14]  Emilio Carrizosa,et al.  A D.C. biobjective location model , 2002, J. Glob. Optim..

[15]  A. L. Brown.  Best n‐Dimensional Approximation to Sets of Functions , 1964 .

[16]  Zvi Drezner,et al.  THE LOCATION OF AN OBNOXIOUS FACILITY WITH RECTANGULAR DISTANCES , 1983 .

[17]  Eduardo Conde,et al.  Closest Solutions in Ideal-Point Methods , 1997 .

[18]  C. Michelot,et al.  Sets of efficient points in a normed space , 1986 .

[19]  H. Juel,et al.  A minisum model with forbidden regions for locating a semi-desirable facility in the plane , 1998 .

[20]  Eduardo Conde,et al.  Semi-obnoxious location models: A global optimization approach , 1997 .

[21]  Alice E. Smith,et al.  Solving the semi-desirable facility location problem using bi-objective particle swarm , 2007, Eur. J. Oper. Res..

[22]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[23]  Luc-Normand Tellier,et al.  THE WEBER PROBLEM: FREQUENCY OF DIFFERENT SOLUTION TYPES AND EXTENSION TO REPULSIVE FORCES AND DYNAMIC PROCESSES* , 1989 .

[24]  Emanuel Melachrinoudis,et al.  Bicriteria location of a semi-obnoxious facility , 1999 .

[25]  Kim Allan Andersen,et al.  The bicriterion semi-obnoxious location (BSL) problem solved by an epsilon-approximation , 2003, Eur. J. Oper. Res..

[26]  Frank Plastria,et al.  Location of Semi-Obnoxious Facilities , 2003 .

[27]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[28]  G. O. Wesolowsky,et al.  The Weber Problem On The Plane With Some Negative Weights , 1991 .

[29]  Jack Brimberg,et al.  A bicriteria model for locating a semi-desirable facility in the plane , 1998, Eur. J. Oper. Res..

[30]  Frank Plastria,et al.  Continuous Location Problems , 1995 .

[31]  Johannes Jahn,et al.  Recent Advances and Historical Development of Vector Optimization , 1987 .

[32]  Frank Plastria,et al.  Dominators for Multiple-objective Quasiconvex Maximization Problems , 2000, J. Glob. Optim..

[33]  Christian Michelot,et al.  Efficiency in constrained continuous location , 1998 .

[34]  José Muñoz-Pérez,et al.  Location of an undesirable facility in a polygonal region with forbidden zones , 1999, Eur. J. Oper. Res..

[35]  Roland Durier.  Sets of Efficiency in a Normed Space and Inner Product , 1987 .

[36]  Eduardo Conde,et al.  Location of a Semiobnoxious Facility: A Biobjective Approach , 1997 .

[37]  Frank Plastria,et al.  Euclidean push-pull partial covering problems , 2006, Comput. Oper. Res..

[38]  Frank Plastria,et al.  Undesirable facility location with minimal covering objectives , 1999, Eur. J. Oper. Res..

[39]  B. Jaumard,et al.  WEBER'S PROBLEM WITH ATTRACTION AND REPULSION , 1991 .

[40]  Kazuki Tamura,et al.  Efficient Location for a Semi-Obnoxious Facility , 2003, Ann. Oper. Res..