José GarcíaBroderick CrawfordRicardo SotoAstorga, GinoGinoAstorga2025-12-062025-12-062018-01-019783319725499978331972550510.1007/978-3-319-72550-5_12-s2.0-85041501507https://cris-uv-2.scimago.es/handle/123456789/6923WOS:000434083500001The binarization of continuous swarm-intelligence metaheuristics is an area of great interest in operational research. This interest is mainly due to the application of binarized metaheuristics to combinatorial problems. In this article we propose a general binarization algorithm called Percentil Transition Ranking Algorithm (PTRA). PTRA uses the percentile concept as a binarization mechanism. In particular we apply this mechanism to the Cuckoo Search metaheuristic to solve the Set Covering Problem (SCP). We provide necessary experiments to investigate the role of key ingredients of the algorithm. Finally to demonstrate the efficiency of our proposal, Set Covering benchmark instances of the literature show that PTRA competes with the state-of-the-art algorithms.enacceso restringidoComputer ScienceControl And Systems Engineeringconference paper