Alan Claudio Baeza Ormazabal

Alan Claudio Baeza Ormazabal

orcid

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 March 2026 in Biomimetics
Verified
Journal Article
Open access
PDF file
Broderick CrawfordBroderick Crawford
Broderick Crawford
HUGO HERNÁN CABALLERO CÓRDOVAHUGO HERNÁN CABALLERO CÓRDOVA
HUGO HERNÁN CABALLERO CÓRDOVA
GAGino Astorga
Gino Astorga
FCFelipe Cisternas-Caneo
Felipe Cisternas-Caneo
MRMarcelo Orlando Becerra Rozas
Marcelo Orlando Becerra Rozas
Ricardo SotoRicardo Soto
Ricardo Soto
The Set Covering Problem is a fundamental NP-hard problem in combinatorial optimization and plays a central role in a wide range of industrial decision-making processes, including logistics planning, scheduling, facility location, network design, and resource allocation. In many real-world contexts, problems of this type are large in scale and highly constrained, which makes exact solution methods computationally impractical and encourages the use of metaheuristic approaches capable of producing high-quality solutions within limited time budgets. In this work, we propose a discrete adaptation of the Dream Optimization Algorithm, focusing on the challenges that emerge when algorithms originally designed for continuous search spaces are applied to binary and strongly constrained models. The continuous search process is mapped onto the binary decision space through a fixed discretization scheme. As a consequence of this transformation, some constraints may not be met, underscoring the importance of effective feasibility restoration mechanisms. Because the discretization stage may produce infeasible solutions and frequently induces plateaus that hinder further improvement, an explicit repair phase becomes necessary to restore feasibility and promote effective search progression. To strengthen this process, the study introduces an adaptive control mechanism based on bandit driven operator selection, which dynamically chooses among different repair procedures during the search. Experimental results on benchmark instances show that the proposed approach consistently achieves high quality solutions with low relative deviation from known optima and stable behavior across independent runs.

8 September 2026 in Biomimetics
Verified
Journal Article
Open access
PDF file
Broderick CrawfordBroderick Crawford
Broderick Crawford
HUGO HERNÁN CABALLERO CÓRDOVAHUGO HERNÁN CABALLERO CÓRDOVA
HUGO HERNÁN CABALLERO CÓRDOVA
GAGino Astorga
Gino Astorga
FCFelipe Cisternas-Caneo
Felipe Cisternas-Caneo
AOAlan Claudio Baeza Ormazabal
Alan Claudio Baeza Ormazabal
Ricardo SotoRicardo Soto
Ricardo Soto
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.