An Evolutionary Approach to the Maximum Edge Weight Clique Problem

Author(s): Dalila B.M.M. Fontes*, Jose Fernando Goncalves, Fernando A.C.C. Fontes.

Journal Name: Recent Advances in Electrical & Electronic Engineering

Volume 11 , Issue 3 , 2018

Become EABM
Become Reviewer

Graphical Abstract:


Abstract:

Background: This work addresses the maximum edge weight clique problem (MEWC), an important generalization of the well-known maximum clique problem.

Methods: The MEWC problem can be used to model applications in many fields including broadband network design, computer vision, pattern recognition, and robotics. We propose a random key genetic algorithm to find good quality solutions for this problem. Computational experiments are reported for a set of benchmark problem instances derived from the DIMACS maximum clique instances.

Results: The results obtained show that our algorithm is both effective and efficient, as for most of the problem instances tested, we were able to match the best-known solutions with very small computational time requirements.

Keywords: Genetic algorithms, network optimization, maximum clique, weight clique, genetic representation, genes.

Rights & PermissionsPrintExport Cite as

Article Details

VOLUME: 11
ISSUE: 3
Year: 2018
Page: [260 - 266]
Pages: 7
DOI: 10.2174/2352096511666180214105643
Price: $58

Article Metrics

PDF: 20