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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Intelligence Springer Journals

Two grouping-based metaheuristics for clique partitioning problem

Loading next page...
 
/lp/springer_journal/two-grouping-based-metaheuristics-for-clique-partitioning-problem-L00EX0t60I
Publisher
Springer US
Copyright
Copyright © 2017 by Springer Science+Business Media New York
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Mechanical Engineering; Manufacturing, Machines, Tools
ISSN
0924-669X
eISSN
1573-7497
D.O.I.
10.1007/s10489-017-0904-5
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Applied IntelligenceSpringer Journals

Published: Mar 28, 2017

References

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 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

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

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off