EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Novel Binary Dream Optimization Algorithm with Data-Driven Repair for the Set Covering Problem

Broderick Crawford iD, Hugo Caballero iD, Gino Astorga iD, Felipe Cisternas-Caneo iD, Marcelo Becerra-Rozas iD, Alan Baeza iD, Gabriel Bernales iD, Pablo Puga iD, Giovanni Giachetti iD, Ricardo Soto iD

Biomimetics · 09.03.2026 · 11 (3) · 197

DOI: 10.3390/biomimetics11030197 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Biomimetics, online erschienen am 09.03.2026. Verfasst von Broderick Crawford und 9 weiteren Autor:innen. Beteiligte Einrichtung: Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso 2362807, Chile. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Agency for Research and Development.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Schlagwörter

Stichwörter der Autor:innen

combinatorial optimizationdream optimization algorithmmachine learning–based controlmetaheuristicsrepair strategiesset covering problem

Autor:innen und Institutionen

  • Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso 2362807, Chile.
  • Escuela de Negocios Internacionales, Universidad de Valparaíso, Alcalde Prieto Nieto 452, Viña del Mar 2572048, Chile.
  • Facultad de Ingeniería, Universidad Andres Bello, Antonio Varas 880, Providencia, Santiago 7591538, Chile.

ORCID-Profile: Broderick Crawford, Hugo Caballero, Gino Astorga, Felipe Cisternas-Caneo, Marcelo Becerra-Rozas, Alan Baeza, Gabriel Bernales, Pablo Puga, Giovanni Giachetti, Ricardo Soto

Förderung

  • National Agency for Research and Development

Zitieren

APA

Crawford, B., Caballero, H., Astorga, G., Cisternas-Caneo, F., Becerra-Rozas, M., Baeza, A., Bernales, G., Puga, P., Giachetti, G., & Soto, R. (2026). A Novel Binary Dream Optimization Algorithm with Data-Driven Repair for the Set Covering Problem. Biomimetics, 11(3), 197. https://doi.org/10.3390/biomimetics11030197

Vancouver

Crawford B, Caballero H, Astorga G, Cisternas-Caneo F, Becerra-Rozas M, Baeza A, et al. A Novel Binary Dream Optimization Algorithm with Data-Driven Repair for the Set Covering Problem. Biomimetics. 2026;11(3):197. doi:10.3390/biomimetics11030197

BibTeX
@article{Crawford2026,
  author = {Crawford, Broderick and Caballero, Hugo and Astorga, Gino and Cisternas-Caneo, Felipe and Becerra-Rozas, Marcelo and Baeza, Alan and Bernales, Gabriel and Puga, Pablo and Giachetti, Giovanni and Soto, Ricardo},
  title = {A Novel Binary Dream Optimization Algorithm with Data-Driven Repair for the Set Covering Problem},
  journal = {Biomimetics},
  year = {2026},
  volume = {11},
  number = {3},
  pages = {197},
  doi = {10.3390/biomimetics11030197}
}
Kostenlos starten →