2026· LETI Transactions on Electrical Engineering & Computer Science· Vol 19, pp. 21-42· 0 citations
TL;DR
The main focus is on algorithms using metaheuristics, there are population-based metaheuristics and single-data-based metaheuristics.
Abstract
Provides an overview of algorithms for solving the set coverage problem. Two alternative formulations of the set coverage problem, which are used by the authors of the algorithms, are considered. A classification of algorithms for solving the set coverage problem is given. The features of the most well-known algorithms for solving the set coverage problem are considered. The main focus is on algorithms using metaheuristics. Among the metaheuristics, there are population-based metaheuristics and single-data-based metaheuristics. Population-based metaheuristics include: swarm-based; based on physics; based on evolution; based on humans. Metaheuristics based on single data: simulated annealing; Taboo search; guided local search; greedy randomized adaptive search procedure.
This paper proposes a taxonomy of stopping criteria based on the aspect of the metaheuristic search process used to trigger algorithm termination, covering resource-based, objective-progress-based, population-state-based, convergence-indicator-based, statistical, algorithm-specific, and hybrid approaches.
Kata Egres, Sándor Szénási· Symposium on Intelligent Sys...· 0 citations
The Minimum Dominating Set (MDS) problem is an NP-hard optimization problem that aims to find the smallest dominating set of nodes encompassing all nodes of a graph. Because it is equivalent to the cluster covering problem, approximate solutions better than the multiplier (1−ε)lnn cannot be obtained in polynomial time...
Furkan Oztemiz, Selman Yakut· Firat University Journal of...· 0 citations
This research examines the suitability of two new local search-based metaheuristics (i.e., Simulated Annealing (SA) and Particle Swarm Optimisation (PSO)) for addressing single-machine scheduling problems in terms of two complementary objective functions: and . We also analyze the interaction of the two objective...
Iraq T. Abbas, R. J. Mitlif· Iraqi Journal of Science· 0 citations
: Backtracking search algorithm (BSA) is a very simple and efficient metaheuristic algorithm. However, BSA only relies on the random crossover vectors generated between the historical population and the current population to guide the search direction of the population, lacking purposefulness. In view of this, this pap...
Yi-Ying Zhang· Computers, Materials & C...· 0 citations
This systematic review presents a comprehensive analysis of metaheuristic optimization algorithms based on 515 distinct metaheuristic optimization algorithms and analyzes the historical evolution, inspiration diversity, search structures, symmetry-oriented search balance, and development trends of modern metaheuristics...
Ebubekir Kaya, Harun Akbulut, Ceren Baştemur Kaya et al.· Symmetry· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.