Abstract
The objective of the classical version of the minisum circle location problem is finding a circle $C$ in the plane such that the sum of the weighted distances from the circumference of $C$ to a set of given points is minimized, where every point has a positive weight. In this paper, we investigate the semi-obnoxious case, where every existing facility has either a positive or negative weight. The distances are measured by the Euclidean norm. Therefore, the problem has a nonlinear objective function and global nonlinear optimization methods are required to solve this problem. Some properties of the semi-obnoxious minisum circle location problem with Euclidean norm are discussed. Then a cuckoo optimization algorithm is presented for finding the solution of this problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Nonlinear Analysis and Applications
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.