A three-phased local search approach for the clique partitioning problem

Yi Zhou (), Jin-Kao Hao () and Adrien Goëffon ()
Additional contact information
Yi Zhou: Université d’Angers
Jin-Kao Hao: Université d’Angers
Adrien Goëffon: Université d’Angers

Journal of Combinatorial Optimization, 2016, vol. 32, issue 2, No 9, 469-491

Abstract: Abstract This paper presents a three-phased local search heuristic CPP-P $$^{3}$$ 3 for solving the Clique Partitioning Problem (CPP). CPP-P $$^{3}$$ 3 iterates a descent search, an exploration search and a directed perturbation. We also define the Top Move of a vertex, in order to build a restricted and focused neighborhood. The exploration search is ensured by a tabu procedure, while the directed perturbation uses a GRASP-like method. To assess the performance of the proposed approach, we carry out extensive experiments on benchmark instances of the literature as well as newly generated instances. We demonstrate the effectiveness of our approach with respect to the current best performing algorithms both in terms of solution quality and computation efficiency. We present improved best solutions for a number of benchmark instances. Additional analyses are shown to highlight the critical role of the Top Move-based neighborhood for the performance of our algorithm and the relation between instance hardness and algorithm behavior.

Keywords: Clique partitioning; Restricted neighborhood; Tabu search; Direct perturbation; Heuristic (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9964-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jcomop:v:32:y:2016:i:2:d:10.1007_s10878-015-9964-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9964-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

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