The semi-obnoxious minisum circle location problem with Euclidean norm | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقاله 51، دوره 12، شماره 1، مرداد 2021، صفحه 669-678 اصل مقاله (473.83 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2021.4869 | ||
| نویسندگان | ||
| Mehraneh Gholami؛ Jafar Fathali* | ||
| Faculty of Mathematical Sciences, Shahrood University of Technology, University Blvd., Shahrood, Iran | ||
| چکیده | ||
| 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. | ||
| کلیدواژهها | ||
| Minisum circle location؛ Nonlinear programming؛ Semi-obnoxious facility؛ Cuckoo optimization algorithm | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 16,055 تعداد دریافت فایل اصل مقاله: 9,775 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 722 |
| تعداد مقالات | 10,383 |
| تعداد مشاهده مقاله | 72,839,202 |
| تعداد دریافت فایل اصل مقاله | 64,535,818 |