Two grouping-based metaheuristics for clique partitioning problem

Two grouping-based metaheuristics for clique partitioning problem Given a connected, undirected graph G = (V,E), where V is the set of vertices and E is the set of edges, the clique partitioning problem (CPP) seeks on this graph a partition of set V into minimum number of subsets such that each subset is a clique. The CPP is an N P $\mathcal {NP}$ -Hard problem and finds numerous practical applications in diverse domains like digital design synthesis, clustering etc. Despite its computational complexity and its numerous applications, only problem-specific heuristics have been developed so far for this problem in the literature. In this paper, two metaheuristic techniques – a steady-state grouping genetic algorithm and an artificial bee colony algorithm – are proposed for the CPP. Both the proposed approaches are designed in such a way that the grouping structure of the CPP is exploited effectively while generating new solutions. Since artificial bee colony algorithm is comparatively a new metaheuristic technique, special attention has been given to the design of this algorithm for the CPP and we came out with a new neighboring solution generation method utilizing solution components from multiple solutions. The proposed approaches have been tested on publicly available 37 DIMACS graph instances. Computational results show the effectiveness of the proposed approaches. Applied Intelligence Springer Journals

Two grouping-based metaheuristics for clique partitioning problem

Loading next page...
Springer US
Copyright © 2017 by Springer Science+Business Media New York
Computer Science; Artificial Intelligence (incl. Robotics); Mechanical Engineering; Manufacturing, Machines, Tools
Publisher site
See Article on Publisher Site


You’re reading a free preview. Subscribe to read the entire article.

DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches


Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.



billed annually
Start Free Trial

14-day Free Trial