EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm

Dante Leiva, Benjamín Ramos-Tapia iD, Broderick Crawford iD, Ricardo Soto iD, Felipe Cisternas-Caneo iD

Biomimetics · 09.05.2024 · 9 (5) · 283

DOI: 10.3390/biomimetics9050283 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Biomimetics, online erschienen am 09.05.2024. Verfasst von Dante Leiva und 4 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 10-mal zitiert (Crossref) und nennt 65 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The set-covering problem aims to find the smallest possible set of subsets that cover all the elements of a larger set. The difficulty of solving the set-covering problem increases as the number of elements and sets grows, making it a complex problem for which traditional integer programming solutions may become inefficient in real-life instances. Given this complexity, various metaheuristics have been successfully applied to solve the set-covering problem and related issues. This study introduces, implements, and analyzes a novel metaheuristic inspired by the well-established Growth Optimizer algorithm. Drawing insights from human behavioral patterns, this approach has shown promise in optimizing complex problems in continuous domains, where experimental results demonstrate the effectiveness and competitiveness of the metaheuristic compared to other strategies. The Growth Optimizer algorithm is modified and adapted to the realm of binary optimization for solving the set-covering problem, resulting in the creation of the Binary Growth Optimizer algorithm. Upon the implementation and analysis of its outcomes, the findings illustrate its capability to achieve competitive and efficient solutions in terms of resolution time and result quality.

Schlagwörter

Stichwörter der Autor:innen

combinatorial problemsmetaheuristicsoptimizationset-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.

ORCID-Profile: Benjamín Ramos-Tapia, Broderick Crawford, Ricardo Soto, Felipe Cisternas-Caneo

Zitieren

APA

Leiva, D., Ramos-Tapia, B., Crawford, B., Soto, R., & Cisternas-Caneo, F. (2024). A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm. Biomimetics, 9(5), 283. https://doi.org/10.3390/biomimetics9050283

Vancouver

Leiva D, Ramos-Tapia B, Crawford B, Soto R, Cisternas-Caneo F. A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm. Biomimetics. 2024;9(5):283. doi:10.3390/biomimetics9050283

BibTeX
@article{Leiva2024,
  author = {Leiva, Dante and Ramos-Tapia, Benjamín and Crawford, Broderick and Soto, Ricardo and Cisternas-Caneo, Felipe},
  title = {A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm},
  journal = {Biomimetics},
  year = {2024},
  volume = {9},
  number = {5},
  pages = {283},
  doi = {10.3390/biomimetics9050283}
}
Kostenlos starten →