INTERNATIONAL JOURNAL OF SCIENTIFIC DEVELOPMENT AND RESEARCH International Peer Reviewed & Refereed Journals, Open Access Journal ISSN Approved Journal No: 2455-2631 | Impact factor: 8.15 | ESTD Year: 2016
open access , Peer-reviewed, and Refereed Journals, Impact factor 8.15
Comparison of Meta-Hueristics performance in solving MCP
Authors Name:
Elmabruk laias
, Abdalla M. Hanashi
Unique Id:
IJSDR2306008
Published In:
Volume 8 Issue 6, June-2023
Abstract:
Abstract— This paper evaluates the performance of three hybrid meta-heuristic algorithms in solving maximum clique problem. The graph traversal problem can be found in many application making it one of the most studied NP-hard. In recent researches, the performance of each one of the three was measured separately via DIMACS benchmarks, however this study compares the results of implementing the three algorithms to find the maximum clique of 30 DIMACS graph, where it was found that Simulated Annealing and Genetic Algorithm did better than Tabu Search, in addition, results show that GA only could find the optimum of certain benchmarks, while SA only could find the optimum of another set of benchmarks. Also, the study investigates combining two distinct local optimizers with genetic algorithm.
Keywords:
Keywords—component; Maximum Clique Problem;Meta heurisrtics ;Local Optimization
Cite Article:
"Comparison of Meta-Hueristics performance in solving MCP ", International Journal of Science & Engineering Development Research (www.ijsdr.org), ISSN:2455-2631, Vol.8, Issue 6, page no.41 - 48, June-2023, Available :http://www.ijsdr.org/papers/IJSDR2306008.pdf
Downloads:
000346982
Publication Details:
Published Paper ID: IJSDR2306008
Registration ID:206966
Published In: Volume 8 Issue 6, June-2023
DOI (Digital Object Identifier):
Page No: 41 - 48
Publisher: IJSDR | www.ijsdr.org
ISSN Number: 2455-2631
Facebook Twitter Instagram LinkedIn