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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.