The planar multiple obnoxious facilities location problem: A Voronoi based heuristic

Abstract Consider a situation where a given number of facilities must be located in a convex polygon with the objective of maximizing the minimum distance between facilities and a given set of communities subject to the facilities being farther than a certain distance from one another. This continuous multiple obnoxious facility location problem is very difficult to solve by commercial nonlinear optimizers. We propose a mathematical formulation of two variants of the problem and a heuristic approach based on Voronoi diagrams and a binary linear program. We compare our heuristic with popular state of the art solvers which utilize the multi-start approach: interior point, sparse nonlinear optimizer (SNOPT), GA, IPOPT, and NOMAD running in Matlab. Each problem instance is solved using 100 randomly generated starting solutions, and the best solution is selected. We found that our results are much better and were obtained in a fraction of the time required by other methods. The multiple obnoxious location problem is a perfect example where all-purpose nonlinear non-convex solvers perform poorly and are significantly outperformed by custom designed heuristics.

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

[2]  Oded Berman,et al.  The minimum weighted covering location problem with distance constraints , 2008, Comput. Oper. Res..

[3]  Barun Chandra,et al.  Approximation Algorithms for Dispersion Problems , 2001, J. Algorithms.

[4]  Sad Salhi,et al.  Heuristic Search: The Emerging Science of Problem Solving , 2017 .

[5]  Zvi Drezner,et al.  Location of a facility minimizing nuisance to or from a planar network , 2009, Comput. Oper. Res..

[6]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[7]  Sébastien Le Digabel,et al.  Algorithm xxx : NOMAD : Nonlinear Optimization with the MADS algorithm , 2010 .

[8]  Duane C. Hanselman,et al.  Mastering MATLAB 5: A Comprehensive Tutorial and Reference , 1995 .

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

[10]  G. O. Wesolowsky,et al.  OBNOXIOUS FACILITY LOCATION IN THE INTERIOR OF A PLANAR NETWORK , 1995 .

[11]  Georges Voronoi.  Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs. , 1908 .

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

[13]  Rajan Batta,et al.  Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials , 1988, Oper. Res..

[14]  R. Church,et al.  Location Modeling Utilizing Maximum Service Distance Criteria , 2010 .

[15]  Christodoulos A. Floudas,et al.  A Global Optimization Method For Weber’s Problem With Attraction And Repulsion , 1994 .

[16]  Kazuo Murota,et al.  IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS , 1984 .

[17]  Zvi Drezner,et al.  Solving the Continuous p-Dispersion Problem Using Non-linear Programming , 1995 .

[18]  Hyeon-Suk Na,et al.  On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes , 2003, Comput. Geom..

[19]  M. Kuby.  Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems , 2010 .

[20]  Otfried Cheong,et al.  Voronoi diagrams on the spher , 2002, Comput. Geom..

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

[22]  Z. Drezner,et al.  The multifacility maximin planar location problem with facility interaction , 2006 .

[23]  Said Salhi,et al.  The obnoxious p facility network location problem with facility interaction , 1997 .

[24]  Zvi Drezner,et al.  Minimax and maximin facility location problems on a sphere , 1983 .

[25]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[26]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[27]  R. Garfinkel,et al.  Locating an Obnoxious Facility on a Network , 1978 .

[28]  Patric R. J. Östergård,et al.  More Optimal Packings of Equal Circles in a Square , 1999, Discret. Comput. Geom..

[29]  Kokichi Sugihara,et al.  A robust Topology-Oriented Incremental algorithm for Voronoi diagrams , 1994, Int. J. Comput. Geom. Appl..

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

[31]  Abraham Duarte,et al.  Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem , 2016, Eur. J. Oper. Res..

[32]  Marco Locatelli,et al.  Packing equal circles in a square: a deterministic global optimization approach , 2002, Discret. Appl. Math..

[33]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2005, SIAM Rev..

[34]  Atsuyuki Okabe,et al.  Using Voronoi Diagrams , 1995 .

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

[36]  Tibor Csendes,et al.  New Approaches to Circle Packing in a Square - With Program Codes , 2007, Optimization and its applications.

[37]  E. Erkut.  The discrete p-dispersion problem , 1990 .

[38]  Panos M. Pardalos,et al.  New results in the packing of equal circles in a square , 1995, Discret. Math..