IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Clique Finder: A Self-Adaptive Simulated Annealing Algorithm for the Maximum Clique Problem

Clique Finder: A Self-Adaptive Simulated Annealing Algorithm for the Maximum Clique Problem
View Sample PDF
Author(s): Sarab Almuhaideb (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia), Najwa Altwaijry (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia), Shahad AlMansour (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia), Ashwaq AlMklafi (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia), AlBandery Khalid AlMojel (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia), Bushra AlQahtani (Department of Computer Science, College of Computer and Information Sciences, Saudi Arabia)and Moshail AlHarran (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia)
Copyright: 2022
Volume: 13
Issue: 2
Pages: 22
Source title: International Journal of Applied Metaheuristic Computing (IJAMC)
Editor(s)-in-Chief: Peng-Yeng Yin (Ming Chuan University, Taiwan)
DOI: 10.4018/IJAMC.20220401.oa1

Purchase

View Clique Finder: A Self-Adaptive Simulated Annealing Algorithm for the Maximum Clique Problem on the publisher's website for pricing and purchasing information.

Abstract

The Maximum Clique Problem (MCP) is a classical NP-hard problem that has gained considerable attention due to its numerous real-world applications and theoretical complexity. It is inherently computationally complex, and so exact methods may require prohibitive computing time. Nature-inspired meta-heuristics have proven their utility in solving many NP-hard problems. In this research, we propose a simulated annealing-based algorithm that we call Clique Finder algorithm to solve the MCP. Our algorithm uses a logarithmic cooling schedule and two moves that are selected in an adaptive manner. The objective (error) function is the total number of missing links in the clique, which is to be minimized. The proposed algorithm was evaluated using benchmark graphs from the open-source library DIMACS, and results show that the proposed algorithm had a high success rate.

Related Content

. © 2024.
Maryam AlJame, Aisha Alnoori, Mohammad G. Alfailakawi, Imtiaz Ahmad. © 2023. 27 pages.
Trust Tawanda, Philimon Nyamugure, Elias Munapo, Santosh Kumar. © 2023. 16 pages.
Preeti Pragyan Mohanty, Subrat Kumar Nayak. © 2022. 32 pages.
Parag Verma, Ankur Dumka, Anuj Bhardwaj, Alaknanda Ashok. © 2022. 21 pages.
Sarab Almuhaideb, Najwa Altwaijry, Shahad AlMansour, Ashwaq AlMklafi, AlBandery Khalid AlMojel, Bushra AlQahtani, Moshail AlHarran. © 2022. 22 pages.
Sajad Ahmad Rather, P. Shanthi Bala. © 2022. 39 pages.
Body Bottom