Improving Set-union knapsack problem based on binary spotted hyena optimization algorithm

Authors

  • Rana Hussein Department of Statistics and Informatics, University of Mosul, Mosul, Iraq
  • Zakariya Algamal Department of Statistics and Informatics, University of Mosul, Mosul, Iraq; Department of Management Information Systems, College of Administration and Economics, University of Mosul, Mosul, Iraq

DOI:

https://doi.org/10.19139/soic-2310-5070-2687

Keywords:

Set-union knapsack problem, spotted hyena optimization algorithm, Z-shaped transfer functions, combinatorial optimization

Abstract

One pertinent model for intelligent systems and decision making is the Set-union Knapsack Problem (SUKP). Heuristic algorithms are helpful in finding high-quality answers in a reasonable amount of time, despite their inherent difficulty (NP-hardness). The binary spotted hyena optimization algorithm for the set-union knapsack problem is presented in this study. Numerous heuristic and approximation techniques for resolving the set-union knapsack issue have been documented in the literature. The quality of the solution still has to be improved, though. The purpose of this study is to apply Z-shaped transfer functions to the binary spotted hyena optimization algorithm used to solve the Set-union knapsack problem. Comparative experimental results show that Z-shaped transfer functions are competitive or superior than the other state-of-the-art transfer function. The experiments were done on three types of 30 popular SUKP benchmark examples.

Downloads

Published

2025-10-24

Issue

Vol. 15 No. 3 (2026)

Section

Research Articles

License

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
    2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
    3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

How to Cite

Improving Set-union knapsack problem based on binary spotted hyena optimization algorithm. (2025). Statistics, Optimization & Information Computing, 15(3), 1653-1663. https://doi.org/10.19139/soic-2310-5070-2687