Undesirable facility location with minimal covering objectives

An undesirable facility is to be located within some feasible region of any shape in the plane or on a planar network. Population is supposed to be concentrated at a finite number n of points. Two criteria are taken into account: a radius of influence to be maximised, indicating within which distance from the facility population disturbance is taken into consideration, and the total covered population, i.e. lying within the influence radius from the facility, which should be minimised. Low complexity polynomial algorithms are derived to determine all nondominated solutions, of which there are only O(n3) for a fixed feasible region or O(n2) when locating on a planar network. Once obtained, this information allows almost instant answers and a trade-off sensitivity analysis to questions such as minimising the population within a given radius (minimal covering problem) or finding the largest circle not covering more than a given total population.

[1]  Christoph Überhuber.  Computer-Numerik 2 , 1995 .

[2]  F. Plastria.  GBSSS: The generalized big square small square method for planar single-facility location , 1992 .

[3]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

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

[5]  G. O. Wesolowsky,et al.  FINDING THE CIRCLE OR RECTANGLE CONTAINING THE MINIMUM WEIGHT OF POINTS. , 1994 .

[6]  Philippe Vincke,et al.  Multicriteria Decision-Aid , 1992 .

[7]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[8]  Frank Plastria,et al.  On destination optimality in asymmetric distance Fermat-Weber problems , 1993, Ann. Oper. Res..

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

[10]  C. Pandu Rangan,et al.  An O(n log n) algorithm for a maxmin location problem , 1992, Discret. Appl. Math..

[11]  Paul R. Kleindorfer,et al.  Chapter 11 Siting of hazardous facilities , 1994, Operations research and the public sector.

[12]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[13]  Emanuel Melachrinoudis,et al.  An O(mn2) algorithm for the Maximin problem in E2 , 1995, Oper. Res. Lett..

[14]  G. O. Wesolowsky,et al.  A Maximin Location Problem with Maximum Distance Constraints , 1980 .

[15]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[16]  E. Melachrinoudis,et al.  Locating an undesirable facility with a minimax criterion , 1986 .

[17]  Frank Plastria,et al.  Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints , 1998 .

[18]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[19]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .

[20]  Peter C. Smith,et al.  Operations Research and the Public Sector , 1995, Handbooks in operations research and management science.

[21]  Horst W. Hamacher,et al.  Restricted planar location problems and applications , 1995 .

[22]  Frank Plastria,et al.  On minquantile and maxcovering optimisation , 1995, Math. Program..

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

[24]  C. Papadimitriou,et al.  A branch-and-bound algorithm for the location of facilities causing atmospheric pollution , 1992 .