An Experimental Study of Transfer Functions and Binarization Strategies in Binary Arithmetic Optimization Algorithms for the Set Covering Problem
Open Access
- 30 September 2025
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 13 (19) , 3129
Abstract
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.Keywords
This publication has 21 references indexed in Scilit:
- On the automatic generation of metaheuristic algorithms for combinatorial optimization problemsEuropean Journal of Operational Research, 2024
- Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASPComputers & Operations Research, 2024
- Metaheuristic-based time series clustering for anomaly detection in manufacturing industryApplied Intelligence, 2023
- Airline crew scheduling with sustainability enhancement by data analytics under circular economyAnnals of Operations Research, 2023
- The Arithmetic Optimization AlgorithmComputer Methods in Applied Mechanics and Engineering, 2021
- Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimizationExpert Systems with Applications, 2017
- SCA: A Sine Cosine Algorithm for solving optimization problemsKnowledge-Based Systems, 2016
- How important is a transfer function in discrete heuristic algorithmsNeural Computing and Applications, 2014
- Computational Complexity2009
- Complexity of Computer Computations1972