Izvorni znanstveni članak
https://doi.org/10.17535/crorr.2024.0015
A hybrid population-based algorithm for solving the Minimum Dominating Set Problem
Belkacem Zouilekh
; LIFORCE Laboratory, Department of Operations Research, Faculty of Mathematics, University of Sciences and Technology Houari Boumediene, P.B. 32 El-Alia, 16111, Bab Ezzouar, Algiers, Algeria.
Sadek Bouroubi
; LIFORCE Laboratory, Department of Operations Research, Faculty of Mathematics, University of Sciences and Technology Houari Boumediene, P.B. 32 El-Alia, 16111, Bab Ezzouar, Algiers, Algeria.
*
* Autor za dopisivanje.
Sažetak
The Minimum Dominating Sets (MDS) problem is pivotal across diverse fields like social networks and ad hoc wireless networks, representing a significant NP-complete challenge in graph theory. To tackle this, we propose a novel hybrid cuckoo search approach. While cuckoo search is renowned for its wide search space exploration, we enhance it with intensification methods and genetic crossover operators for improved performance. Comprehensive experimental evaluations against state-of-the-art techniques validate our approach's effectiveness.
Ključne riječi
genetic algorithm; hybrid cuckoo search algorithm; minimum dominating set
Hrčak ID:
321260
URI
Datum izdavanja:
7.10.2024.
Posjeta: 0 *