Tabu search and GRASP for the capacitated clustering problem

Anna Martínez-Gavara (), Vicente Campos (), Micael Gallego (), Manuel Laguna () and Rafael Martí ()

Computational Optimization and Applications, 2015, vol. 62, issue 2, 589-607

Abstract: The capacitated clustering problem (CCP) consists of forming a specified number of clusters or groups from a set of elements in such a way that the sum of the weights of the elements in each cluster is within some capacity limits, and the sum of the benefits between the pairs of elements in the same cluster is maximized. This problem—which has been recently tackled with a GRASP/VNS approach—arises in the context of facility planners at mail processing and distribution. We propose a tabu search and several GRASP variants to find high quality solutions to this NP-hard problem. These variants are based on several neighborhoods, including a new one, in which we implement a one-for-two swapping strategy. We also hybridize both methodologies to achieve improved outcomes. The maximally diverse grouping problem (MDGP) is a special case of the CCP in which all the elements have a weight of 1 U. This problem has been recently studied in the academic context when forming student groups, and we adapt the best method reported in the literature, a tabu search with strategic oscillation (TS_SO), to the CCP. On the other hand, the handover minimization in mobility networks is a problem equivalent to the CCP in which we minimize the sum of the benefits (costs) of the edges between different clusters. GRASP with Path Relinking has been recently applied to it. Our empirical study with 133 instances shows the superiority of the new GRASP with tabu search for the CCP with respect to these three previous approaches: the GRASP/VNS, the adapted TS_SO, and the GRASP with Path Relinking. Copyright Springer Science+Business Media New York 2015

Keywords: Capacitated clustering; Diversity problems; Tabu search; GRASP; Graph partitioning (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-015-9749-1 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:62:y:2015:i:2:p:589-607

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-015-9749-1

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().