EUVIMEDOpdag EUVIMED
Open access · CC BY 4.0

Solution of the Binary Knapsack Problem Using the Secretary Bird Optimization Algorithm

Vahit Tongur, Aysen Kucukyaglioglu

The Eurasia Proceedings of Science, Technology, Engineering and Mathematics · 2026-07-31 · 40 ((Early Pub)) · 415-424

DOI: 10.55549/epstem.1465 ↗

At a glance

Journal article in The Eurasia Proceedings of Science, Technology, Engineering and Mathematics, published online on 2026-07-31. Written by Vahit Tongur and 1 co-authors. The full text is freely available (open access, CC BY 4.0).

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

Many nature-inspired metaheuristic algorithms proposed in the literature are initially designed to operate in continuous search spaces. However, real-world problems are not limited to continuous domains; they also include discrete, combinatorial, and binary problem types.In this study, the performance of the Secretary Bird Optimization Algorithm (SBOA), a recently introduced metaheuristic method, is investigated on the knapsack problem, which belongs to the class of binary optimization problems. Numerous transfer functions have been proposed in the literature to transform continuous search spaces into binary ones. In this work, S-shaped transfer functions are employed for this purpose.Through this transformation, SBOA—originally designed for continuous domains—is adapted to the binary search space and referred to as the Binary SBOA (BSBOA). The performance of BSBOA is evaluated on well-known benchmark knapsack problem instances. While BSBOA achieves optimal solutions on 10 small-scale benchmark problems, it produces near-optimal results for 18 large-scale binary knapsack instances.This study aims to address the SBOA binary optimization problem and evaluate its performance in such an environment.

Cite

APA

Tongur, V., & Kucukyaglioglu, A. (2026). Solution of the Binary Knapsack Problem Using the Secretary Bird Optimization Algorithm. The Eurasia Proceedings of Science, Technology, Engineering and Mathematics, 40((Early Pub)), 415-424. https://doi.org/10.55549/epstem.1465

Vancouver

Tongur V, Kucukyaglioglu A. Solution of the Binary Knapsack Problem Using the Secretary Bird Optimization Algorithm. The Eurasia Proceedings of Science, Technology, Engineering and Mathematics. 2026;40((Early Pub)):415-424. doi:10.55549/epstem.1465

BibTeX
@article{Tongur2026,
  author = {Tongur, Vahit and Kucukyaglioglu, Aysen},
  title = {Solution of the Binary Knapsack Problem Using the Secretary Bird Optimization Algorithm},
  journal = {The Eurasia Proceedings of Science, Technology, Engineering and Mathematics},
  year = {2026},
  volume = {40},
  number = {(Early Pub)},
  pages = {415--424},
  doi = {10.55549/epstem.1465}
}
Start for free →