کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4652106 | 1632584 | 2015 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
VNS variants for the Max-Mean Dispersion Problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper we propose three different VNS variants to solve the Max-Mean Dispersion Problem. This problem consists of selecting a set of elements in such a way that the average distance between them is maximized. To tackle this problem, we propose a Basic Variable Neighborhood Search (BVNS), a Variable Neighborhood Descent (VND) and a Generalized Variable Neighborhood Search (GVNS) that hybridizes the previous two methods. Experimentation on previously reported instances shows that the Variable Neighborhood Search methodology is able to obtain solutions of high quality when compared with state of the art procedures.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 47, February 2015, Pages 253-260
Journal: Electronic Notes in Discrete Mathematics - Volume 47, February 2015, Pages 253-260