TY - JOUR
ID - 4869
TI - The semi-obnoxious minisum circle location problem with Euclidean norm
JO - International Journal of Nonlinear Analysis and Applications
JA - IJNAA
LA - en
SN -
AU - Gholami, Mehraneh
AU - Fathali, Jafar
AD - Faculty of Mathematical Sciences, Shahrood University of Technology, University Blvd., Shahrood, Iran
Y1 - 2021
PY - 2021
VL - 12
IS - 1
SP - 669
EP - 678
KW - Minisum circle location
KW - nonlinear programming
KW - Semi-obnoxious facility
KW - Cuckoo optimization algorithm
DO - 10.22075/ijnaa.2021.4869
N2 - 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.
UR - https://ijnaa.semnan.ac.ir/article_4869.html
L1 - https://ijnaa.semnan.ac.ir/article_4869_42ebf726b5dc93e5d0a99ef7b8525b66.pdf
ER -