Scheuerer, Stephan and Wendolsky, Rolf (2005) A scatter search heuristic for the capacitated clustering problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 169 (2). pp. 533-547. ISSN 0377-2217,
Full text not available from this repository. (Request a copy)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. (c) 2004 Elsevier B.V. All rights reserved.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | ALGORITHMS; metaheuristics; scatter search; capacitated clustering problems; capacitated p-median problems |
| Subjects: | 600 Technology > 650 Management & auxiliary services |
| Divisions: | Business, Economics and Information Systems > Institut für Betriebswirtschaftslehre |
| Depositing User: | Dr. Gernot Deinzer |
| Date Deposited: | 18 Feb 2021 10:54 |
| Last Modified: | 18 Feb 2021 10:54 |
| URI: | https://pred.uni-regensburg.de/id/eprint/34841 |
Actions (login required)
 |
View Item |
