Covering Part of a Planar Network
- 124 Downloads
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.
KeywordsNetworks Maximal covering Minimal covering Obnoxious facilities
This research was supported, in part, by the Natural Sciences and Engineering Research Council of Canada.
- 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
- 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
- Drezner T, Drezner Z, Goldstein Z (2010) A stochastic gradual cover location problem. Nav Res Logist 57:367–372Google 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
- Hansen P, Peeters D, Thisse J-F (1981) On the location of an obnoxious facility. Sistemi Urbani 3:299–317Google 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
- 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
- Szabo PG, Markot M, Csendes T, Specht E (2007) New Approaches to Circle Packing in a Square: With Program Codes. Springer, New YorkGoogle Scholar