FSFabián Solís-Piñones

Fabián Solís-Piñones

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Fabián Solís-Piñones has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Binary Pufferfish Optimization Algorithm for Combinatorial Problems

    by Broderick Crawford, Álex Paz, Ricardo Soto, Álvaro Peña Fritz, Gino Astorga, Felipe Cisternas-Caneo, Claudio Patricio Toledo Mac-Lean, Fabián Solís-Piñones, José Lara Arce, Giovanni Giachetti

    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.


  • Open Access

    An Experimental Study of Transfer Functions and Binarization Strategies in Binary Arithmetic Optimization Algorithms for the Set Covering Problem

    by Broderick Crawford, Ricardo Soto, Hugo Caballero, Gino Astorga, Felipe Cisternas-Caneo, Fabián Solís-Piñones, Giovanni Giachetti

    Metaheuristics have proven to be effective in solving large-scale combinatorial problems by combining global exploration with local exploitation, all within a reasonably short time. The balance between these phases is crucial to avoid slow or premature convergence. We propose binary variants of the Arithmetic Optimization Algorithm for the set cover problem, integrating a two-step binarization scheme based on transfer functions with binarization rules and a greedy repair operator to ensure feasibility. We evaluate the proposed solution using forty-five instances from OR-Beasley and compare it with representative approaches, including genetic algorithms, path-relinking strategies, and Lagrangian-based heuristics. The quality of the solution is evaluated using relative percentage deviation and stability with the coefficient of variation. The results show competitive deviations and consistently low variation, confirming that our approach is a robust alternative with a solid balance between exploration and exploitation.


  • Open Access

    Binary Secretary Bird Optimization Algorithm for the Set Covering Problem

    by Broderick Crawford, Felipe Cisternas-Caneo, Ricardo Soto, Claudio Patricio Toledo Mac-Lean, José Lara Arce, Fabián Solís-Piñones, Gino Astorga, Giovanni Giachetti

    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.