Many of the problems addressed at the industrial level are of a combinatorial type and a sub-assembly not less than these are of the NP-hard type. The design of algorithms that solve combinatorial problems based on the continuous metaheuristic of swarm intelligence is an area of interest at an industrial level. In this article, we explore a general binarization mechanism of continuous metaheuristics based on the k-means technique. In particular, we apply the k-means technique to the Grasshopper optimization algorithm in order to solve the set covering problem (SCP). The experiments are designed with the aim of demonstrating the usefulness of the k-means technique in binarization. Additionally, we verify the effectiveness of our algorithm through reference instances. The results indicate the K-means binary grasshopper optimization algorithm (KBGOA) obtains adequate results when evaluated with a combinatorial problem such as the SCP.
CITATION STYLE
Villavicencio, G., Valenzuela, M., Altimiras, F., Moraga, P., & Pinto, H. (2020). A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem. In Advances in Intelligent Systems and Computing (Vol. 1225 AISC, pp. 312–323). Springer. https://doi.org/10.1007/978-3-030-51971-1_25
Mendeley helps you to discover research relevant for your work.