کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482777 | 1446229 | 2006 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A scatter search heuristic for the capacitated clustering problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A scatter search heuristic for the capacitated clustering problem A scatter search heuristic for the capacitated clustering problem](/preview/png/482777.png)
چکیده انگلیسی
This paper proposes a scatter search-based heuristic approach to the capacitated clustering problem. In this problem, a given set of customers with known demands must be partitioned into p distinct clusters. Each cluster is specified by a customer acting as a cluster center for this cluster. The objective is to minimize the sum of distances from all cluster centers to all other customers in their cluster, such that a given capacity limit of the cluster is not exceeded and that every customer is assigned to exactly one cluster. Computational results on a set of instances from the literature indicate that the heuristic is among the best heuristics developed for this problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 169, Issue 2, 1 March 2006, Pages 533–547
Journal: European Journal of Operational Research - Volume 169, Issue 2, 1 March 2006, Pages 533–547
نویسندگان
Stephan Scheuerer, Rolf Wendolsky,