Solving the clique partitioning problem as a maximally diverse grouping problem

Solving the clique partitioning problem as a maximally diverse grouping problem

0.00 Avg rating0 Votes
Article ID: iaor20172923
Volume: 11
Issue: 6
Start Page Number: 1123
End Page Number: 1135
Publication Date: Aug 2017
Journal: Optimization Letters
Authors: , , ,
Keywords: combinatorial optimization, allocation: resources, heuristics
Abstract:

In this paper we show that the clique partitioning problem can be reformulated in an equivalent form as the maximally diverse grouping problem (MDGP). We then modify a skewed general variable neighborhood search (SGVNS) heuristic that was first developed to solve the MDGP. Similarly as with the MDGP, significant improvements over the state of the art are obtained when SGVNS is tested on large scale instances. This further confirms the usefulness of a combined approach of diversification afforded with skewed VNS and intensification afforded with the local search in general VNS.

Reviews

Required fields are marked *. Your email address will not be published.