A scatter search heuristic for the capacitated clustering problem

A scatter search heuristic for the capacitated clustering problem

0.00 Avg rating0 Votes
Article ID: iaor20063703
Country: Netherlands
Volume: 169
Issue: 2
Start Page Number: 533
End Page Number: 547
Publication Date: Mar 2006
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics, location
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.