TY - GEN
T1 - A K-means Bat Optimisation Algorithm Applied to the Set Covering Problem
AU - Pavez, Leonardo
AU - Altimiras, Francisco
AU - Villavicencio, Gabriel
N1 - Publisher Copyright:
© 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - Optimization at the industry level is a fundamental area since it allows reducing costs and being more sustainable. Many of these problems are combinatorial and NP-hard. On the other hand, swarm intelligence metaheuristics have been able to successfully address these types of problems, however, many of these techniques work in searching continuous spaces. In this article, we explore a general binarization mechanism of continuous metaheuristics based on the k-means technique. In particular, we applied the k-means technique to the bat algorithm with the aim of addressing the set covering problem (SCP). Experiments were designed to evaluate the contribution of the k-means technique in the binarization process. In addition, we verify the effectiveness of our algorithm through reference instances. The results indicate that the k-means binary bat algorithm (KBBA) gets adequate results when evaluated with a combinatorial problem like SCP.
AB - Optimization at the industry level is a fundamental area since it allows reducing costs and being more sustainable. Many of these problems are combinatorial and NP-hard. On the other hand, swarm intelligence metaheuristics have been able to successfully address these types of problems, however, many of these techniques work in searching continuous spaces. In this article, we explore a general binarization mechanism of continuous metaheuristics based on the k-means technique. In particular, we applied the k-means technique to the bat algorithm with the aim of addressing the set covering problem (SCP). Experiments were designed to evaluate the contribution of the k-means technique in the binarization process. In addition, we verify the effectiveness of our algorithm through reference instances. The results indicate that the k-means binary bat algorithm (KBBA) gets adequate results when evaluated with a combinatorial problem like SCP.
UR - http://www.scopus.com/inward/record.url?scp=85098121765&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-63319-6_58
DO - 10.1007/978-3-030-63319-6_58
M3 - Conference contribution
AN - SCOPUS:85098121765
SN - 9783030633189
T3 - Advances in Intelligent Systems and Computing
SP - 622
EP - 632
BT - Software Engineering Perspectives in Intelligent Systems - Proceedings of 4th Computational Methods in Systems and Software 2020
A2 - Silhavy, Radek
A2 - Silhavy, Petr
A2 - Prokopova, Zdenka
PB - Springer Science and Business Media Deutschland GmbH
T2 - 4th Computational Methods in Systems and Software, CoMeSySo 2020
Y2 - 14 October 2020 through 17 October 2020
ER -