A Greedy Simulated Annealing-based Multiobjective Algorithm for the Minimum Weight Minimum Connected Dominating Set Problem
Engineering, Technology & Applied Science Research · 09.10.2024 · 14 (5) · 16686-16691
DOI: 10.48084/etasr.8272 ↗Kurz gefasst
Fachartikel in der Zeitschrift Engineering, Technology & Applied Science Research, online erschienen am 09.10.2024. Verfasst von Hayet Dahmri und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The minimum connected dominating set problem is a well-known NP-hard combinatorial optimization problem in graph theory, with various fields of application including wireless sensor networks, optical networks, and systems biology. This paper presents an adaptive multiobjective simulated annealing approach to address a variant of the minimum connected dominating set problem known as the Minimum Weight Minimum Connected Dominating Set Problem. This approach combines a multiobjective Pareto set with a greedy simulated annealing algorithm to tackle the problem by simultaneously optimizing two objectives, namely the cardinality and the total weight of the connected dominating set. Experimental results compared to those obtained by current state-of-the-art approaches show the superiority of our method.
Zitieren
APA
Dahmri, H., Bouamama, S., & Balbal, S. (2024). A Greedy Simulated Annealing-based Multiobjective Algorithm for the Minimum Weight Minimum Connected Dominating Set Problem. Engineering, Technology & Applied Science Research, 14(5), 16686-16691. https://doi.org/10.48084/etasr.8272
Vancouver
Dahmri H, Bouamama S, Balbal S. A Greedy Simulated Annealing-based Multiobjective Algorithm for the Minimum Weight Minimum Connected Dominating Set Problem. Engineering, Technology & Applied Science Research. 2024;14(5):16686-16691. doi:10.48084/etasr.8272
BibTeX
@article{Dahmri2024,
author = {Dahmri, Hayet and Bouamama, Salim and Balbal, Samir},
title = {A Greedy Simulated Annealing-based Multiobjective Algorithm for the Minimum Weight Minimum Connected Dominating Set Problem},
journal = {Engineering, Technology & Applied Science Research},
year = {2024},
volume = {14},
number = {5},
pages = {16686--16691},
doi = {10.48084/etasr.8272}
}
EUVIMED