An improved binary Crow-JAYA optimisation system with various evolution operators, such as mutation for finding the max clique in the dens graph

Abstract

The paper proposes an Improved Binary Cuckoo Search Algorithm-Binary Jaya Optimiser (IBCSA-BJO) with binary Jaya Optimiser (JO) to solve the max clique problem. This algorithm integrates opposition-based learning (OBL), transfer functions, Lévy flight, mutation, Xor, 1-point crossover, and the repairing method to enhance initial population diversity, improve searching capabilities, and avoid local optima traps. Transfer functions convert continuous values to binary, while the repairing method fixes infeasible solutions. Evaluations on benchmark problems demonstrate the effectiveness of IBCSA-BJO as a competitive alternative to state-of-the-art approaches.

Topics & Concepts