Clustering search algorithm for the capacitated centered clustering problem

Authors:
Antonio Augusto Chaves;Luiz Antonio Nogueira Lorena
Affiliations:
LAC - Laboratory of Computing and Applied Mathematics, INPE - National Institute for Space Research, 12227-010 São José dos Campos, SP, Brazil;LAC - Laboratory of Computing and Applied Mathematics, INPE - National Institute for Space Research, 12227-010 São José dos Campos, SP, Brazil
Venue:
Computers and Operations Research
Year:
2010

Citing 3
Cited 4

A column generation approach to capacitated p-median problems

Computers and Operations Research
Hybrid Algorithms with Detection of Promising Areas for the Prize Collecting Travelling Salesman Problem

HIS '05 Proceedings of the Fifth International Conference on Hybrid Intelligent Systems
The capacitated centred clustering problem

Computers and Operations Research

Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem

Expert Systems with Applications: An International Journal
Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction

Computers and Operations Research
Clustering Search for the Berth Allocation Problem

Expert Systems with Applications: An International Journal
A hybrid metaheuristic approach for the capacitated p-median problem

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The capacitated centered clustering problem (CCCP) consists in partitioning a set of n points into p disjoint clusters with a known capacity. Each cluster is specified by a centroid. The objective is to minimize the total dissimilarity within each cluster, such that a given capacity limit of the cluster is not exceeded. This paper presents a solution procedure for the CCCP, using the hybrid metaheuristic clustering search (CS), whose main idea is to identify promising areas of the search space by generating solutions through a metaheuristic and clustering them into groups that are then further explored with local search heuristics. Computational results in test problems of the literature show that the CS found a significant number of new best-known solutions in reasonable computational times.