Chemical Reaction Optimization Algorithm to Find Maximum Independent Set in a Graph

Abstract

Finding maximum independent set (MIS) in a graph is considered one of the fundamental problems in the computer science field, where it can be used to provide solutions for various real life applications. For example, it can be used to provide solutions in scheduling and prioritization problems. Unfortunately, this problem is one of the NP-problems of computer science, which limit its usage in providing solution for such problems with large sizes. This leads the scientists to find a way to provide solutions of such problems using fast algorithms to provide some near optimal solutions. One of the techniques used to provide solutions is to use metaheuristic algorithms. In this paper, a metaheuristic algorithm based on Chemical Reaction Optimization (CRO) is applied with various techniques to find MIS for application represented by a graph. The suggested CRO algorithm achieves accuracy percentages that reach 100% in some cases. This variation depends on the overall structure of the graph along with the picked parameters and colliding molecule selection criteria during the reaction operations of the CRO algorithm.

The goat search algorithms

“…Moreover, to solve vortex game problem and chaos game problem the notable works of Khattab et al ( 2019 ) and Talatahari and Mahdi ( 2021 ) respectively may be noted over here. To study the graph theory in an algorithm Asmaran et al ( 2019 ) and Mahafzah et al ( 2021 ) did extensive works on the theory of chemical reaction. Halim et al ( 2021 ) discussed performance assessment of the metaheuristic optimization algorithms.…”