Hybrid bat algorithm for minimum dominating set problem

Abed, Saad Adnan; Rais, Helmi Md

doi:10.3233/jifs-17398

Cited by 3 publications

(3 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The SLS is enhanced by using a simulated annealing process. Recently, Abed and Rais [33], introduced a hybrid population-based technique known as the Hybrid Bat Algorithm, which is rooted in microbat bio-sonar characteristics and simulated annealing. The fact that SA is efficient in exploitation and the bat algorithm has a high capacity for the exploration of large regions in the search space helps to ensure a good balance between intensification and diversification in the search methodology.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Hybrid cuckoo search algorithm for the minimum dominating set problem

Zouilekh¹,

Bouroubi²

2022

Preprint

View full text Add to dashboard Cite

The notions of dominating sets of graphs began almost 400 years ago with the game of chess, which sparked the analysis of dominating sets of graphs, at first relatively loosely until the beginnings of the 1960s, when the issue was given mathematical description. It's among the most important problems in graph theory, as well as an NP-Complete problem that can't be solved in polynomial time. As a result, we describe a new hybrid cuckoo search technique to tackle the MDS problem in this work. Cuckoo search is a well-known metaheuristic famed for its capacity for exploring a large area of the search space, making it useful for diversification. However, to enhance performance, we incorporated intensification techniques in addition to the genetic crossover operator in the suggested approach. The comparison of our method with the corresponding state-of-the-art techniques from the literature is presented in an exhaustive experimental test. The suggested algorithm outperforms the present state of the art, according to the obtained results.

show abstract

Section: Related Workmentioning

confidence: 99%

“…We test the suggested HCSA-MDS on the first benchmark against HGA-MDS [31], SAMDS [32], and HBA [33] for the purpose of proving the performance of the HCSA-MDS approach check Table 6.…”

Section: Comparative Analysis Of Hcsa-mds Against the State-of-art Ap...mentioning

confidence: 99%

Hybrid cuckoo search algorithm for the minimum dominating set problem

Zouilekh¹,

Bouroubi²

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…The minimum dominating set is classified as NP-Completeness and in general cannot be solved exactly in polynomial time [14], [15]. It means that there is no theoretically efficient algorithm that finds the exact smallest dominating set for a given graph.…”

Section: Introductionmentioning

confidence: 99%

The Domination Parameters on a kind of the regular honeycomb structure

Movahedi¹,

Choong²,

Akhbari³

2022

CSJM

View full text Add to dashboard Cite

The honeycomb mesh, based on hexagonal structure, has enormous applications in chemistry and engineering. A major challenge in this field is to understand the unique properties of honeycomb structures, which depend on their properties of topology. One of the important concepts in graph theory is the domination number which can be used for network control and monitoring. In this paper, we investigate the domination number of the honeycomb network. For this purpose, the domination number, the total domination number, the independent domination number, the connected domination number and the doubly connected domination number of the honeycomb are obtained. Finally, in some honeycomb structures of real models, we obtain the exact amount of these parameters.

show abstract