Covering problem with minimum radius enclosing circle

This study extends the classical smallest enclosing circle problem in location science to optimize healthcare communication hubs. Given a set of demand points and potential groups, we identify the optimal number of subgroups to cover all points and the circle enclosing them with minimum radius. The center of this circle serves as the communication hub location, minimizing the distance between demand points and facilities subject to customer demand. We develop a nonconvex-nonlinear optimization model and propose a quadratic programming-based approximation algorithm to solve it. Tested on various hypothetical and real scenarios, our model effectively reduces the facility setup cost and identifies the optimal communication hub location.

Grantor dc:publisher

University of Tennessee at Chattanooga

Author dc:creator

• Onyame, Eric Nartey

Contributors dc:contributor

• Weerasena, Lakmali
• Aniekan, Ebiefung; Gao, Lani; Bandara, Damitha
• College of Arts and Sciences

• Facility management--Mathematics
• Mathematical optimization
• Geometry, Differential

Licence

• http://rightsstatements.org/vocab/InC/1.0/

Language dc:language

English, eng

Repository record dc:identifier

https://scholar.utc.edu/theses/796

OAI identifier oai:identifier

oai:scholar.utc.edu:theses-1972