کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482305 | 1446187 | 2007 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The equitable location problem on the plane
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: The equitable location problem on the plane The equitable location problem on the plane](/preview/png/482305.png)
چکیده انگلیسی
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverage constraints. Focusing on uniform demand over the unit square, we develop upper and lower bounds on feasibility of the problem for a given number of facilities and coverage radius. Based on these bounds and numerical experiments we suggest a heuristic to solve the problem. Our computational results show that the heuristic is very efficient, as the average gap between its solutions and the lower bound is 4.34%.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 183, Issue 2, 1 December 2007, Pages 578–590
Journal: European Journal of Operational Research - Volume 183, Issue 2, 1 December 2007, Pages 578–590
نویسندگان
Opher Baron, Oded Berman, Dmitry Krass, Qian Wang,