## Abstract

The problem of locating facilities in a feasible area covering some parts of network links within a given radius is analyzed. The feasible area can be the interior (convex hull of the nodes) of a planar network or any union of convex polygons. Both minimization and maximization of coverage are considered. The single facility location problem is solved by the global optimization approach “Big Triangle Small Triangle.” The multiple facility maximization problem is solved by a specially designed heuristic algorithm. The idea of the heuristic algorithm may prove to work well on other planar multiple facility location problems. Computational experience with problems of up to 40,000 links demonstrate the effectiveness of the single facility and multiple facilities algorithms. The largest single facility minimal cover problem is solved in about one minute and the largest single facility maximal cover problem is solved in less than 4 minutes.

## Keywords

Networks Maximal covering Minimal covering Obnoxious facilities## Notes

### Acknowledgments

This research was supported, in part, by the Natural Sciences and Engineering Research Council of Canada.

## References

- Avriel M, Diewert WE, Schaible S, Zang I (1987) Generalized concavity. Springer, BerlinGoogle Scholar
- Bazaraa MS, Shetty CM (1993) Non-Linear programming. Wiley, New YorkGoogle Scholar
- Bell MG (2006) Mixed route strategies for the risk-averse shipment of hazardous materials. Netw and Spat Econ 6:253–265CrossRefGoogle Scholar
- Berglund PG, Kwon C (2014) Robust facility location problem for hazardous waste transportation. Netw and Spat Econ 14:91–116CrossRefGoogle Scholar
- Berman O, Drezner Z, Krass D (2010a) Cooperative cover location problems: The planar case. IIE Trans 42:232–246CrossRefGoogle Scholar
- Berman O, Drezner Z, Krass D (2010b) Generalized coverage: New developments in covering location models. Comput Oper Res 37:1675–1687CrossRefGoogle Scholar
- Berman O, Drezner Z, Krass D (2011) Big segment small segment global optimization algorithm on networks. Networks 58:1–11CrossRefGoogle Scholar
- Berman O, Drezner Z, Wesolowsky GO (1996) Minimum covering criterion for obnoxious facility location on a network. Networks 18:1–5CrossRefGoogle Scholar
- Berman O, Drezner Z, Wesolowsky GO (2009) The maximal covering problem with some negative weights. Geogr Anal 41:30–42CrossRefGoogle Scholar
- Berman O, Huang R (2008) The minimum weighted covering location problem with distance constraints. Comput Oper Res 35:356–372CrossRefGoogle Scholar
- Berman O, Krass D (2002) The generalized maximal covering location problem. Comput Oper Res 29:563–591CrossRefGoogle Scholar
- Berman O, Krass D, Drezner Z (2003) The gradual covering decay location problem on a network. Eur J Oper Res 151:474–480CrossRefGoogle Scholar
- Brimberg J, Drezner Z (2013) A new heuristic for solving the p-median problem in the plane. Comput Oper Res 40:427–437CrossRefGoogle Scholar
- Church RL (1984) The planar maximal covering location problem. J Reg Sci 24:185–201CrossRefGoogle Scholar
- Church RL, Meadows B (1979) Location modelling using maximum service distance criteria. Geogr Anal 11:358–373CrossRefGoogle Scholar
- Church RL, ReVelle CS (1974) The maximal covering location problem. Pap Reg Sci Assoc 32:101–118CrossRefGoogle Scholar
- Current J, Daskin M, Schilling D (2002). In: Drezner Z, Hamacher HW (eds) Facility Location: applications and theory. Springer-Verlag, Berlin, pp 81–118Google Scholar
- Current JR, Schilling DA (1994) The median tour and maximal covering tour problems: Formulations and heuristics. Eur J Oper Res 73(1):114–126CrossRefGoogle Scholar
- Curtin KM, Hayslett-McCall K, Qiu F (2010) Determining optimal police patrol areas with maximal covering and backup covering location models. Netw Spat Econ 10:125–145CrossRefGoogle Scholar
- Drezner T, Drezner Z, Goldstein Z (2010) A stochastic gradual cover location problem. Nav Res Logist 57:367–372Google Scholar
- Drezner T, Drezner Z, Salhi S (2002) Solving the multiple competitive facilities location problem. Eur J Oper Res 142:138–151CrossRefGoogle Scholar
- Drezner T, Drezner Z, Scott CH (2009) Location of a facility minimizing nuisance to or from a planar network. Comput Oper Res 36:135–148CrossRefGoogle Scholar
- Drezner Z (1981) On a modified one-center problem. Manag Sci 27:848–851CrossRefGoogle Scholar
- Drezner Z (1986) The p-cover problem. Eur J Oper Res 26:312–313CrossRefGoogle Scholar
- Drezner Z (1998) Finding whether a point is inside a polygon and its application to forbidden regions. The J Manag Sci & Regional Development 1:41–48Google Scholar
- Drezner Z, Suzuki A (2004) The big triangle small triangle method for the solution of non-convex facility location problems. Oper Res 52:128–135CrossRefGoogle Scholar
- Drezner Z, Wesolowsky GO (1980) Single facility
*ℓ*_{p}distance minimax location. SIAM J Algebraic Discret Methods 1:315–321CrossRefGoogle Scholar - Drezner Z, Wesolowsky GO (1996) Obnoxious facility location in the interior of a planar network. J Reg Sci 35:675–688CrossRefGoogle Scholar
- Drezner Z, Wesolowsky GO, Drezner T (2004) The gradual covering problem. Nav Res Logist 51:841–855CrossRefGoogle Scholar
- Du L, Peeta S (2014) A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions. Netw Spat Econ 14:271–295CrossRefGoogle Scholar
- Eiselt HA, Marianov V (2009) Gradual location set covering with service quality. Socio-Econ Plan Sci 43:121–130CrossRefGoogle Scholar
- Elzinga J, Hearn D (1972) Geometrical solutions for some minimax location problems. Trans Sci 6:379–394CrossRefGoogle Scholar
- Hansen P, Peeters D, Thisse J-F (1981) On the location of an obnoxious facility. Sistemi Urbani 3:299–317Google Scholar
- Karasakal O, Karasakal E (2004) A maximal covering location model in the presence of partial coverage. Comput Oper Res 31:15–26CrossRefGoogle Scholar
- Karkazis J, Boffey B (1995) Optimal location of routes for vehicles transporting hazardous materials. Eur J Oper Res 86:201–215CrossRefGoogle Scholar
- Kolen A, Tamir A (1990) Covering problems. In: Mirchandani PB, Francis RL (eds) Discrete Location Theory. Wiley-Interscience, New York, NY, pp 263–304Google Scholar
- Lee DT, Schachter BJ (1980) Two algorithms for constructing a Delaunay triangulation. Int J Parallel Prog 9 (3):219–242Google Scholar
- Matisziw TC, Murray AT (2009a) Area coverage maximization in service facility siting. J Geogr Syst 11 (2):175–189CrossRefGoogle Scholar
- Matisziw TC, Murray AT (2009b) Siting a facility in continuous space to maximize coverage of a region. Socio-Econ Plan Sci 43(2):131–139CrossRefGoogle Scholar
- Megiddo N, Zemel E, Hakimi SL (1983) The maximum coverage location problems. SIAM J Algebraic Discret Methods 4:253–261CrossRefGoogle Scholar
- Murray AT, Matisziw TC, Wei H, Tong D (2008) A geocomputational heuristic for coverage maximization in service facility siting. Trans GIS 12 (6):757–773CrossRefGoogle Scholar
- Ohya T, Iri M, Murota K (1984) Improvements of the incremental method of the Voronoi diagram with computational comparison of various algorithms. J Oper Res Soc Jpn 27:306–337Google Scholar
- Plastria F (1992) GBSSS, the generalized big square small square method for planar single facility location. Eur J Oper Res 62:163–174CrossRefGoogle Scholar
- Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher HW (eds) Facility Location: Applications and Theory. Springer-Verlag, Berlin, pp 37–79CrossRefGoogle Scholar
- ReVelle C, Toregas C, Falkson L (1976) Applications of the location set covering problem. Geogr Anal 8:65–76CrossRefGoogle Scholar
- Schöbel A, Scholz D (2010) The big cube small cube solution method for multidimensional facility location problems. Comput Oper Res 37:115–122CrossRefGoogle Scholar
- Sugihara K, Iri M (1994) A robust topology-oriented incremental algorithm for Voronoi diagram. Inter J Comput Geom Appl 4:179–228CrossRefGoogle Scholar
- Suzuki A, Drezner Z (1996) The p-center location problem in an area. Locat Sci 4:69–82CrossRefGoogle Scholar
- Suzuki A, Drezner Z (2009) The minimum equitable radius location problem with continuous demand. Eur J Oper Res 195:17–30CrossRefGoogle Scholar
- Szabo PG, Markot M, Csendes T, Specht E (2007) New Approaches to Circle Packing in a Square: With Program Codes. Springer, New YorkGoogle Scholar
- Wang J, Kang Y, Kwon C, Batta R (2012) Dual toll pricing for hazardous materials transport with linear delay. Netw Spat Econ 12:147–165CrossRefGoogle Scholar
- Watson-Gandy C (1982) Heuristic procedures for the
*m*-partial cover problem on a plane. Eur J Oper Res 11:149–157CrossRefGoogle Scholar - Wendell RE, Hurter AP (1973) Location theory, dominance and convexity. Oper Res 21:314–320CrossRefGoogle Scholar
- Yin Y (2006) Optimal fleet allocation of freeway service patrols. Netw Spat Econ 6:221–234CrossRefGoogle Scholar
- Yin Y (2008) A scenario-based model for fleet allocation of freeway service patrols. Netw Spat Econ 8:407–417CrossRefGoogle Scholar