Skip to content
Open access

A Novel Binary Hunger Games Search Algorithm with Data-Driven Repair for the Set Covering Problem

Sep 2026 · Biomimetics · Vol 11 · 0 citations · 35 references
Medicine

TL;DR

The Binary Hunger Games Search metaheuristic is selected because the relative quality of each individual determines its hunger level, which in turn regulates the movement of the population and the influence of the best solution found.

Abstract

Solving problems associated with the efficient distribution and organization of resources has generated increasing interest in the scientific community. One of the most commonly used approaches consists of approximate solution techniques, which have been able to solve complex covering problems within acceptable computational time and cost. One of the benchmarks used to evaluate these approaches is the Set Covering Problem, which is an NP-hard combinatorial optimization problem. Among the techniques that have been investigated, metaheuristics play an important role. These methods are commonly developed for continuous search spaces and, in order to be applied to covering problems, must be modified to operate in discrete domains. This modification presents an important challenge: finding an appropriate transformation method that translates continuous solutions into binary solutions. This issue has been addressed through two main strategies: binarization using two-step schemes, and, in our proposal, the use of repair operators orchestrated according to their performance through an Adaptive Repair Selection Mechanism based on the multi-armed bandit framework. To evaluate our proposal, we selected the Binary Hunger Games Search metaheuristic because the relative quality of each individual determines its hunger level, which in turn regulates the movement of the population and the influence of the best solution found. Infeasible solutions are handled through a set of Tabu Search-based repair operators. Instead of applying a single repair rule throughout the entire execution, the proposed approach dynamically selects among these operators according to their observed contribution during the search. Each repair operator also incorporates Tabu memory to discourage repetitive decisions during feasibility restoration. The experiments were conducted using the classical Beasley benchmark instances for the Set Covering Problem.

Read PDF

Similar papers

Sep 2026

A Metaheuristic Optimization Framework for Discrete Optimization under Strict Time Limits

STILO is introduced, a MOF specifically designed for optimization under strict time limits that integrates fine-grained configuration spaces for ant colony optimization, genetic algorithm, and simulated annealing, combining existing and novel operators.

Umut Çalıkyılmaz, Nitin Nayak, S. Groppe · 0 citations
Open access Sep 2026

The Less–is–More Approach to Variable Neighborhood Search: A Comparative Study

This study aims to support a comparison of several possibilities of element composition through a comparison of several possibilities of element composition, including new ideas for elementary moves, in the less-is-more approach applied to metaheuristic variable neighborhood search.

Marta Kasprzak · 0 citations
Open access Sep 2026

Using Evolving Algorithms to Solve Bi-Criteria-Objective Function Machine Scheduling Problems

     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 · 0 citations
Open access Sep 2026

An Improved Tabu Search Algorithm for Parallel Task Scheduling on Identical Machines

An improved tabu search algorithm is proposed to overcome the shortcoming of traditional methods being prone to falling into local optima and achieves highly competitive performance compared with the original tabu search algorithm and the OR-Tools solver, while significantly improving computational efficiency.

Wen-Hao Jia, Xin Chen, Di Wu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.