Binary Pufferfish Optimization Algorithm for Combinatorial Problems
Authors:
- Broderick CrawfordBroderick Crawford
- Álex PazÁlex Paz
- Ricardo SotoRicardo Soto
- Álvaro Peña FritzÁFÁlvaro Peña Fritz
- Gino AstorgaGAGino Astorga
- Felipe Cisternas-CaneoFCFelipe Cisternas-Caneo
- Claudio Patricio Toledo Mac-LeanCMClaudio Patricio Toledo Mac-Lean
- Fabián Solís-PiñonesFSFabián Solís-Piñones
- José Lara ArceJAJosé Lara Arce
- Giovanni GiachettiGGGiovanni Giachetti
Open Access
- 25 December 2025
- journal article
- research article
- Published by MDPI AG in Biomimetics
- Vol. 11 (1) , 10
Abstract
Metaheuristics are a fundament pillar of Industry 4.0, as they allow for complex optimization problems to be solved by finding good solutions in a reasonable amount of computational time. One category of important problems in modern industry is that of binary problems, where decision variables can take values of zero or one. In this work, we propose a binary version of the Pufferfish optimization algorithm (BPOA), which was originally created to solve continuous problems. The binary mapping follows a two-step technique, first transforming using transfer functions and then discretizing using binarization rules. We study representative pairings of transfer functions and binarization rules, comparing our algorithm with Particle Swarm Optimization, Secretary Bird Optimization Algorithm, and Arithmetic Optimization Algorithm with identical computational budgets. To validate its correct functioning, we solved binary problems present in industry, such as the Set Covering Problem together with its Unicost variant, as well as the Knapsack Problem. The results we achieved with regard to these problems were promising and statistically validated. The tests performed on the executions indicate that many pair differences are not statistically significant when both methods are already close to the optimal level, and significance arises precisely where the descriptive gaps widen, underscoring that transfer–rule pairing is the main performance factor. BPOA is a competitive and flexible framework whose effectiveness is mainly governed by the discretization design.Keywords
This publication has 55 references indexed in Scilit:
- 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
- A survey on binary metaheuristic algorithms and their engineering applicationsArtificial Intelligence Review, 2022
- A Machine Learning Firefly Algorithm Applied to the Matrix Covering Problem2021
- Improved chaotic binary grey wolf optimization algorithm for workflow scheduling in green cloud computingEvolutionary Intelligence, 2020
- The Whale Optimization AlgorithmAdvances in Engineering Software, 2016
- Grey Wolf OptimizerAdvances in Engineering Software, 2014
- 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