Abstract
The problem is to find the best location in the plane of a minisum annulus with fixed width using a partial coverage distance model. Using the concept of partial coverage distance, those demand points within the area of the annulus are served at no cost, while for ‘uncovered’ demand points there will be additional costs proportional to their distances to the annulus. The objective of the problem is to locate the annulus such that the sum of distances from the uncovered demand points to the annulus (covering area) is minimized. The distance is measured by the Euclidean norm. We discuss the case where the radius of the inner circle of the annulus is variable, and prove that at least two demand points must be on the boundary of any optimal annulus. An algorithm to solve the problem is derived based on this result.
Similar content being viewed by others
References
Agarwal PK, Aronov B, Har-Peled S, Sharir M (1999) Approximation and exact algorithms for minimum-width annuli and shells. Proceedings of the fifteenth annual symposium on computational geometry, SCG ’99. ACM, New York, pp 380–389
Berman O, Drezner Z, Krass D (2010) Generalized coverage: new developments in covering location models. Comput Oper Res 37(10):1675–1687
Brent RP (1973) Algorithms for minimization without derivatives. Prentice Hall (reprinted by Dover, 2002 and 2013)
Brimberg J, Juel H, Schöbel A (2009a) Locating a circle on the plane using the minimax criterion. Stud Locat Anal 17:46–60
Brimberg J, Juel H, Schöbel A (2009b) Locating a minisum circle in the plane. Discrete Appl Math 157(5):901–912
Brimberg J, Juel H, Körner M, Schöbel A (2011) Locating a general minisum circle on the plane. 4OR 9(4):351–370
Brimberg J, Juel H, Körner M, Schöbel A (2014a) On models for continuous facility location with partial coverage. Oper Res Soc J 66:3343
Brimberg J, Schieweck R, Schöbel A (2014b) Locating a median line with partial coverage distance. J Glob Optim 62(2):371–389
Chan TM (2000) Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. Proceedings of the sixteenth annual symposium on computational geometry, SCG ’00. ACM, New York, pp 300–309
Drezner Z, Brimberg J (2014) Fitting concentric circles to measurements. Math Methods Oper Res 79(1):119–133
Drezner Z, Steiner S, Wesolowsky GO (2002) On the circle closest to a set of points. Comput Oper Res 29(6):637–650
Drezner Z, Suzuki A (2004) The big triangle small triangle method for the solution of nonconvex facility location problems. Oper Res 52(1):128–135
Forsythe GE, Moler CB, Malcolm MA (1977) Computer methods for mathematical computations. Prentice-Hall, Englewood Cliffs
García-López J, Ramos PA (1997) Fitting a set of points by a circle. Proceedings of the thirteenth annual symposium on computational geometry, SCG ’97. ACM, New York, pp 139–146
Gluchshenko ON, Hamacher HW, Tamir A (2009) An optimal algorithm for finding an enclosing planar rectilinear annulus of minimum width. Oper Res Lett 37(3):168–170
Goodman AW (1962) Analytic geometry and the calculus, chapter Introduction to analytic geometry. Taylor & Francis, London
Lagarias JC, Reeds JA, Wright MH, Wright PE (1998) Convergence properties of the Nelder-Mead simplex method in low dimensions. SIAM J Optim 9(1):112–147
Le VB, Lee DT (1991) Out-of-roundness problem revisited. IEEE Trans Pattern Anal Mach Intell 13(3):217–223
Mehlhorn K, Shermer TC, Yap CK (1997) A complete roundness classification procedure. Proceedings of the thirteenth annual symposium on computational geometry, SCG ’97. ACM, New York, pp 129–138
Melachrinoudis E (2011) The location of undesirable facilities. In: Eiselt HA, Marianov V (eds) Foundations of location analysis, International series in operations research & management science, vol 155., SpringerUS, Boston, pp 207–239
Plastria F (1992) GBSSS: the generalized big square small square method for planar single-facility location. Eur J Oper Res 62(2):163–174
Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher H (eds) Facility location: applications and theory. Springer-Verlag, Berlin, pp 37–79
Rivlin TJ (1979) Approximation by circles. Computing 21(2):93–104
Roy U, Zhang X (1992) Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error. Comput Aided Des 24(3):161–168
Schöbel A (2015) Location of dimensional facilities in a continuous space. Location science. Springer, Cham, pp 135–175
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Alkhalifa, L., Brimberg, J. Locating a minisum annulus: a new partial coverage distance model. TOP 25, 373–393 (2017). https://doi.org/10.1007/s11750-016-0435-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-016-0435-y