Skip to main content
Log in

Locating a minisum annulus: a new partial coverage distance model

  • Original Paper
  • Published:
TOP Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

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

    Chapter  Google Scholar 

  • Berman O, Drezner Z, Krass D (2010) Generalized coverage: new developments in covering location models. Comput Oper Res 37(10):1675–1687

    Article  Google Scholar 

  • 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

    Google Scholar 

  • Brimberg J, Juel H, Schöbel A (2009b) Locating a minisum circle in the plane. Discrete Appl Math 157(5):901–912

    Article  Google Scholar 

  • 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

    Google Scholar 

  • Brimberg J, Schieweck R, Schöbel A (2014b) Locating a median line with partial coverage distance. J Glob Optim 62(2):371–389

    Article  Google Scholar 

  • 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

    Chapter  Google Scholar 

  • Drezner Z, Brimberg J (2014) Fitting concentric circles to measurements. Math Methods Oper Res 79(1):119–133

    Article  Google Scholar 

  • Drezner Z, Steiner S, Wesolowsky GO (2002) On the circle closest to a set of points. Comput Oper Res 29(6):637–650

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Forsythe GE, Moler CB, Malcolm MA (1977) Computer methods for mathematical computations. Prentice-Hall, Englewood Cliffs

    Google Scholar 

  • 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

    Chapter  Google Scholar 

  • 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

    Article  Google Scholar 

  • Goodman AW (1962) Analytic geometry and the calculus, chapter Introduction to analytic geometry. Taylor & Francis, London

    Google Scholar 

  • 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

    Article  Google Scholar 

  • Le VB, Lee DT (1991) Out-of-roundness problem revisited. IEEE Trans Pattern Anal Mach Intell 13(3):217–223

    Article  Google Scholar 

  • 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

    Chapter  Google Scholar 

  • 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

    Chapter  Google Scholar 

  • Plastria F (1992) GBSSS: the generalized big square small square method for planar single-facility location. Eur J Oper Res 62(2):163–174

    Article  Google Scholar 

  • Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher H (eds) Facility location: applications and theory. Springer-Verlag, Berlin, pp 37–79

    Chapter  Google Scholar 

  • Rivlin TJ (1979) Approximation by circles. Computing 21(2):93–104

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Schöbel A (2015) Location of dimensional facilities in a continuous space. Location science. Springer, Cham, pp 135–175

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Loay Alkhalifa.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-016-0435-y

Keywords

Mathematics Subject Classification

Navigation