TY - GEN
T1 - A Percentile Whale Algorithm an Application to the Set Covering Problem
AU - Jorquera, Lorena
AU - Valenzuela, Pamela
AU - Causa, Leonardo
AU - Moraga, Paola
AU - Rubio, José Miguel
N1 - Publisher Copyright:
© 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - The design of robust continuous metaheuristic techniques to apply them to combinatorial problems is a line of research with great applied potential. There are two major challenges in this regard. The first is related to the fact that many of the problems addressed at an industrial level are of the combinatorial type and the second has to do with the fact that no lesser subset of these problems are of the NP-hard type. In this study, a binarization mechanism has been proposed for continuous swarm intelligence metaheuristics which uses the percentile concept to perform binarization. This percentile concept is applied to Whale’s optimization algorithm to solve the set coverage problem (SCP). To identify the contribution of the method, experiments were designed which are compared with a baseline. Additionally, the proposal is compared with recently published algorithms, using reference instances. The results indicate that the binary percentile whale (BPWH) algorithm obtains adequate results when it is evaluated with a combinatorial problem such as the SCP.
AB - The design of robust continuous metaheuristic techniques to apply them to combinatorial problems is a line of research with great applied potential. There are two major challenges in this regard. The first is related to the fact that many of the problems addressed at an industrial level are of the combinatorial type and the second has to do with the fact that no lesser subset of these problems are of the NP-hard type. In this study, a binarization mechanism has been proposed for continuous swarm intelligence metaheuristics which uses the percentile concept to perform binarization. This percentile concept is applied to Whale’s optimization algorithm to solve the set coverage problem (SCP). To identify the contribution of the method, experiments were designed which are compared with a baseline. Additionally, the proposal is compared with recently published algorithms, using reference instances. The results indicate that the binary percentile whale (BPWH) algorithm obtains adequate results when it is evaluated with a combinatorial problem such as the SCP.
UR - http://www.scopus.com/inward/record.url?scp=85120692858&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-90321-3_32
DO - 10.1007/978-3-030-90321-3_32
M3 - Conference contribution
AN - SCOPUS:85120692858
SN - 9783030903206
T3 - Lecture Notes in Networks and Systems
SP - 402
EP - 412
BT - Data Science and Intelligent Systems - Proceedings of 5th Computational Methods in Systems and Software 2021
A2 - Silhavy, Radek
A2 - Silhavy, Petr
A2 - Prokopova, Zdenka
PB - Springer Science and Business Media Deutschland GmbH
T2 - 5th Computational Methods in Systems and Software, CoMeSySo 2021
Y2 - 1 October 2021 through 1 October 2021
ER -