کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4636670 | 1340726 | 2006 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A genetic algorithm for the p-median problem with pos/neg weights
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A genetic algorithm for the p-median problem with pos/neg weights A genetic algorithm for the p-median problem with pos/neg weights](/preview/png/4636670.png)
چکیده انگلیسی
Let a connected undirected graph G = (V, E) be given. In the classical p-median problem we want to find a set X containing p points in G such that the sum of weighted distances from X to all vertices in V is minimized. We consider the semi-obnoxious case where every vertex has either a positive or negative weight. In this case we have two different objective functions: the sum of the minimum weighted distances from X to all vertices and the sum of the weighted minimum distances. In this paper we propose a genetic algorithm for both problems. Computational results are compared with a previously investigated variable neighborhood search algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 183, Issue 2, 15 December 2006, Pages 1071–1083
Journal: Applied Mathematics and Computation - Volume 183, Issue 2, 15 December 2006, Pages 1071–1083
نویسندگان
Jafar Fathali,