کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
475681 | 699347 | 2015 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
New heuristic algorithms for solving the planar p-median problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: New heuristic algorithms for solving the planar p-median problem New heuristic algorithms for solving the planar p-median problem](/preview/png/475681.png)
چکیده انگلیسی
In this paper we propose effective heuristics for the solution of the planar p-median problem. We develop a new distribution based variable neighborhood search and a new genetic algorithm, and also test a hybrid algorithm that combines these two approaches. The best results were obtained by the hybrid approach. The best known solution was found in 466 out of 470 runs, and the average solution was only 0.000016% above the best known solution on 47 well explored test instances of 654 and 1060 demand points and up to 150 facilities.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 62, October 2015, Pages 296–304
Journal: Computers & Operations Research - Volume 62, October 2015, Pages 296–304
نویسندگان
Zvi Drezner, Jack Brimberg, Nenad Mladenović, Said Salhi,