کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4959508 | 1445950 | 2017 | 32 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The probabilistic p-center problem: Planning service for potential customers
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: The probabilistic p-center problem: Planning service for potential customers The probabilistic p-center problem: Planning service for potential customers](/preview/png/4959508.png)
چکیده انگلیسی
This work deals with the probabilistic p-center problem, which aims at minimizing the expected maximum distance between any site with demand and its center, considering that each site has demand with a specific probability. The problem is of interest when emergencies may occur at predefined sites with known probabilities. For this problem we propose and analyze different formulations as well as a Variable Neighborhood Search heuristic. Computational tests are reported, showing the potentials and limits of each formulation, the impact of their enhancements, and the effectiveness of the heuristic.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 262, Issue 2, 16 October 2017, Pages 509-520
Journal: European Journal of Operational Research - Volume 262, Issue 2, 16 October 2017, Pages 509-520
نویسندگان
Luisa I. MartÃnez-Merino, Maria Albareda-Sambola, Antonio M. RodrÃguez-ChÃa,