An improved binary Crow-JAYA optimisation system with various evolution operators, such as mutation for finding the max clique in the dens graph
by Mohammad Al-Batah; Mohammad Ryiad Al-Eiadeh
International Journal of Computing Science and Mathematics (IJCSM), Vol. 19, No. 4, 2024

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.

Online publication date: Wed, 12-Jun-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com