Siting a facility in continuous space to maximize coverage of a region

Siting facilities in continuous space such that continuously distributed demand within a region is optimally served is a challenging location problem. This problem is further complicated by the non-convexity of regions typically encountered in practice. In this paper a model for maximizing the service coverage of continuously distributed demand through the location of a single service facility in continuous space is proposed. To address this problem, theoretical conditions are established and associated methods are proposed for optimally siting a service facility in a region (convex or non-convex) with uniformly distributed demand. Through the use of geographic information systems (GIS), the developed approach is applied to identify facility sites that maximize regional coverage provided limitations on facility service ability.

[1]  Jeffery L. Kennington,et al.  Hierarchical cellular network design with channel allocation , 2005, Eur. J. Oper. Res..

[2]  Jack Snoeyink,et al.  A One-Step Crust and Skeleton Extraction Algorithm , 2001, Algorithmica.

[3]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[4]  Z. Drezner,et al.  Replacing continuous demand with discrete demand in a competitive location model , 1997 .

[5]  Morton E. O'Kelly,et al.  A lattice covering model for evaluating existing service facilities , 2004 .

[6]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[7]  Yukio Sadahiro,et al.  A Statistical Method for Analyzing the Relative Location of Points in a Bounded Region , 2010 .

[8]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[9]  Abraham Mehrez,et al.  THE MAXIMAL COVERING LOCATION PROBLEM WITH FACILITY PLACEMENT ON THE ENTIRE PLANE , 1982 .

[10]  V. Ralph Algazi,et al.  Continuous skeleton computation by Voronoi diagram , 1991, CVGIP Image Underst..

[11]  D. T. Lee,et al.  Medial Axis Transformation of a Planar Shape , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Robert Rosenthal,et al.  Computer graphical solutions of constrained minimax location problems , 1980 .

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

[14]  Frank Plastria,et al.  Continuous Covering Location Problems , 2002 .

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

[16]  Robert F. Love,et al.  A COMPUTATIONAL PROCEDURE FOR OPTIMALLY LOCATING A FACILITY WITH RESPECT TO SEVERAL RECTANGULAR REGIONS , 1972 .

[17]  R. Brubaker.  Models for the perception of speech and visual form: Weiant Wathen-Dunn, ed.: Cambridge, Mass., The M.I.T. Press, I–X, 470 pages , 1968 .

[18]  Srinagesh Gavirneni,et al.  Schlumberger Optimizes Receiver Location for Automated Meter Reading , 2004, Interfaces.

[19]  David G. Kirkpatrick,et al.  Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[20]  John M. Gleason.  A set covering approach to bus stop location , 1975 .

[21]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[22]  Abraham Mehrez,et al.  An extended continuous maximal covering location problem with facility placement , 1984, Comput. Oper. Res..

[23]  J. Brandt.  Convergence and continuity criteria for discrete approximations of the continuous planar skeleton , 1994 .

[24]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[25]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[26]  Christopher M. Gold,et al.  Outside-in: An Alternative Approach to Forest Map Digitizing , 1996, Int. J. Geogr. Inf. Sci..

[27]  Richard L. Church,et al.  SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPER , 1984 .

[28]  Z. Drezner,et al.  The p-center location problem in an area , 1996 .

[29]  A. Mehrez.  A NOTE ON THE LINEAR INTEGER FORMULATION OF THE MAXIMAL COVERING LOCATION PROBLEM WITH FACILITY PLACEMENT ON THE ENTIRE PLANE , 1983 .

[30]  Yangsheng Xu,et al.  Determining two minimal circumscribing discs for a polygon , 1995, Comput. Aided Des..

[31]  Belarmino Adenso-Díaz,et al.  A simple search heuristic for the MCLP: Application to the location of ambulance bases in a rural region , 1997 .

[32]  Hassan Masum,et al.  Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf , 2000, SIGA.

[33]  Ugo Montanari,et al.  Continuous Skeletons from Digitized Images , 1969, JACM.

[34]  Morton E. O'Kelly,et al.  Locating Emergency Warning Sirens , 1992 .

[35]  Franco P. Preparata,et al.  The Medial Axis of a Simple Polygon , 1977, MFCS.

[36]  Jin J. Chou.  Voronoi diagrams for planar shapes , 1995, IEEE Computer Graphics and Applications.

[37]  Azriel Rosenfeld,et al.  Computer representation of planar regions by their skeletons , 1967, CACM.

[38]  Richard L. Church,et al.  Regional service coverage modeling , 2008, Comput. Oper. Res..