Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 353101, 10 pages
Research Article

An Iterated Tabu Search Approach for the Clique Partitioning Problem

Faculty of Informatics, Kaunas University of Technology, Studentu Street 50-408, 51368 Kaunas, Lithuania

Received 8 November 2013; Accepted 15 January 2014; Published 4 March 2014

Academic Editors: S. Bureerat, N. Gulpinar, and W. Ogryczak

Copyright © 2014 Gintaras Palubeckis et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Given an edge-weighted undirected graph with weights specifying dissimilarities between pairs of objects, represented by the vertices of the graph, the clique partitioning problem (CPP) is to partition the vertex set of the graph into mutually disjoint subsets such that the sum of the edge weights over all cliques induced by the subsets is as small as possible. We develop an iterated tabu search (ITS) algorithm for solving this problem. The proposed algorithm incorporates tabu search, local search, and solution perturbation procedures. We report computational results on CPP instances of size up to 2000 vertices. Performance comparisons of ITS against state-of-the-art methods from the literature demonstrate the competitiveness of our approach.