Solving the clique partitioning problem as a maximally diverse grouping problem

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.

[1]  Frits C. R. Spieksma,et al.  The clique partitioning problem: Facets and patching facets , 2001, Networks.

[2]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[3]  M. Brusco,et al.  Clustering Qualitative Data Based on Binary Equivalence Relations: Neighborhood Search Heuristics for the Clique Partitioning Problem , 2009 .

[4]  Irène Charon,et al.  Noising methods for a clique partitioning problem , 2006, Discret. Appl. Math..

[5]  S. Régnier,et al.  Sur quelques aspects mathématiques des problèmes de classification automatique , 1983 .

[6]  R. R. Weitz,et al.  An empirical comparison of heuristic methods for creating maximally diverse groups , 1998, J. Oper. Res. Soc..

[7]  Vahid Lotfi,et al.  A Final-Exam-Scheduling Package , 1991 .

[8]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[9]  Bahram Alidaee,et al.  Clique Partitioning for Clustering: A Comparison with K-Means and Latent Class Analysis , 2007, Commun. Stat. Simul. Comput..

[10]  R. R. Weitz,et al.  An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups, VLSI design, and exam scheduling , 1997 .

[11]  F. Glover,et al.  Solving group technology problems via clique partitioning , 2007 .

[12]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[13]  C. Ribeiro,et al.  Clustering and clique partitioning: Simulated annealing and tabu search approaches , 1992 .

[14]  Nenad Mladenovic,et al.  Mic'2001 -4th Metaheuristics International Conference Design of Balanced Mba Student Teams , 2022 .

[15]  Nenad Mladenovic,et al.  Solving the maximally diverse grouping problem by skewed general variable neighborhood search , 2015, Inf. Sci..

[16]  Michael J. Pazzani,et al.  Mining for proposal reviewers: lessons learned at the national science foundation , 2006, KDD '06.

[17]  Dragan Urošević.  VARIABLE NEIGHBORHOOD SEARCH FOR MAXIMUM DIVERSE GROUPING PROBLEM , 2014 .