Binary Secretary Bird Optimization Algorithm for the Set Covering Problem
Authors:
- Broderick CrawfordBroderick Crawford
- Felipe Cisternas-CaneoFCFelipe Cisternas-Caneo
- Ricardo SotoRicardo Soto
- Claudio Patricio Toledo Mac-LeanCMClaudio Patricio Toledo Mac-Lean
- José Lara ArceJAJosé Lara Arce
- Fabián Solís-PiñonesFSFabián Solís-Piñones
- Gino AstorgaGAGino Astorga
- Giovanni GiachettiGGGiovanni Giachetti
Open Access
- 1 August 2025
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 13 (15) , 2482
Abstract
The Set Coverage Problem (SCP) is an important combinatorial optimization problem known to be NP-complete. The use of metaheuristics to solve the SCP includes different algorithms. In particular, binarization techniques have been explored to adapt metaheuristics designed for continuous optimization problems to the binary domain of the SCP. In this work, we present a new approach to solve the SCP based on the Secretary Bird Optimization Algorithm (SBOA). This algorithm is inspired by the natural behavior of the secretary bird, known for its ability to hunt prey and evade predators in its environment. Since the SBOA was originally designed for optimization problems in continuous space and the SCP is a binary problem, this paper proposes the implementation of several binarization techniques to adapt the algorithm to the discrete domain. These techniques include eight transfer functions and five different discretization methods. Taken together, these combinations create multiple SBOA adaptations that effectively balance exploration and exploitation, promoting an adequate distribution in the search space. Experimental results applied to the SCP together with its variant Unicost SCP and compared to Grey Wolf Optimizer and Particle Swarm Optimization suggest that the binary version of SBOA is a robust algorithm capable of producing high quality solutions with low computational cost. Given the promising results obtained, it is proposed as future work to focus on complex and large-scale problems as well as to optimize their performance in terms of time and accuracy.Keywords
This publication has 41 references indexed in Scilit:
- Integrating metaheuristic methods and deterministic strategies for optimizing supply chain equipment design in process engineeringChemical Engineering Research and Design, 2024
- Metaheuristics for Solving Global and Engineering Optimization Problems: Review, Applications, Open Issues and ChallengesArchives of Computational Methods in Engineering, 2024
- Secretary bird optimization algorithm: a new metaheuristic for solving global optimization problemsArtificial Intelligence Review, 2024
- LSTM-based framework with metaheuristic optimizer for manufacturing process monitoringAlexandria Engineering Journal, 2023
- A GRASP-based scheme for the set covering problemOperational Research, 2019
- A hybrid heuristic for the set covering problemOperational Research, 2010
- New ideas for applying ant colony optimization to the set covering problemComputers & Industrial Engineering, 2010
- An improved genetic algorithm with conditional genetic operators and its application to set-covering problemSoft Computing, 2006
- Enhancing an algorithm for set covering problemsEuropean Journal of Operational Research, 1992
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975