کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482959 | 1446226 | 2006 | 23 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases](/preview/png/482959.png)
چکیده انگلیسی
The p-median problem with positive and negative weights has been introduced by Burkard and Krarup [Computing 60 (1998) 193]. In this paper we discuss some special cases of this problem on trees and propose a variable neighborhood search procedure for general networks, which is in fact a modification of the one proposed by Hansen and Mladenovic [Locat. Sci. 5 (1997) 207] for the p-median. We also compare the results with those obtained by a Tabu search procedure.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 170, Issue 2, 16 April 2006, Pages 440–462
Journal: European Journal of Operational Research - Volume 170, Issue 2, 16 April 2006, Pages 440–462
نویسندگان
J. Fathali, H. Taghizadeh Kakhki,