A K-means Bat Optimisation Algorithm Applied to the Set Covering Problem

Leonardo Pavez; Francisco Altimiras; Gabriel Villavicencio

doi:10.1007/978-3-030-63319-6_58

A K-means Bat Optimisation Algorithm Applied to the Set Covering Problem

Leonardo Pavez, Francisco Altimiras, Gabriel Villavicencio

Producción científica: Capítulo del libro/informe/acta de congreso › Contribución a la conferencia › revisión exhaustiva

1 Cita (Scopus)

Resumen

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.

Idioma original	Inglés
Título de la publicación alojada	Software Engineering Perspectives in Intelligent Systems - Proceedings of 4th Computational Methods in Systems and Software 2020
Editores	Radek Silhavy, Petr Silhavy, Zdenka Prokopova
Editorial	Springer Science and Business Media Deutschland GmbH
Páginas	622-632
Número de páginas	11
ISBN (versión impresa)	9783030633189
DOI	https://doi.org/10.1007/978-3-030-63319-6_58
Estado	Publicada - 2020
Evento	4th Computational Methods in Systems and Software, CoMeSySo 2020 - Vsetin, República Checa Duración: 14 oct. 2020 → 17 oct. 2020

Serie de la publicación

Nombre	Advances in Intelligent Systems and Computing
Volumen	1295
ISSN (versión impresa)	2194-5357
ISSN (versión digital)	2194-5365

Conferencia

Conferencia	4th Computational Methods in Systems and Software, CoMeSySo 2020
País/Territorio	República Checa
Ciudad	Vsetin
Período	14/10/20 → 17/10/20

ODS de las Naciones Unidas

Este resultado contribuye a los siguientes Objetivos de Desarrollo Sostenible

Acceder al documento

10.1007/978-3-030-63319-6_58

Otros archivos y enlaces

Enlace a la publicación en Scopus

Citar esto

Pavez, L., Altimiras, F., & Villavicencio, G. (2020). A K-means Bat Optimisation Algorithm Applied to the Set Covering Problem. En R. Silhavy, P. Silhavy, & Z. Prokopova (Eds.), Software Engineering Perspectives in Intelligent Systems - Proceedings of 4th Computational Methods in Systems and Software 2020 (pp. 622-632). (Advances in Intelligent Systems and Computing; Vol. 1295). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-63319-6_58

Pavez, Leonardo ; Altimiras, Francisco ; Villavicencio, Gabriel. / A K-means Bat Optimisation Algorithm Applied to the Set Covering Problem. Software Engineering Perspectives in Intelligent Systems - Proceedings of 4th Computational Methods in Systems and Software 2020. editor / Radek Silhavy ; Petr Silhavy ; Zdenka Prokopova. Springer Science and Business Media Deutschland GmbH, 2020. pp. 622-632 (Advances in Intelligent Systems and Computing).

@inproceedings{7194c22820e34fefa98e742088a9f6b5,

title = "A K-means Bat Optimisation Algorithm Applied to the Set Covering Problem",

abstract = "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.",

author = "Leonardo Pavez and Francisco Altimiras and Gabriel Villavicencio",

note = "Publisher Copyright: {\textcopyright} 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.; 4th Computational Methods in Systems and Software, CoMeSySo 2020 ; Conference date: 14-10-2020 Through 17-10-2020",

year = "2020",

doi = "10.1007/978-3-030-63319-6_58",

language = "English",

isbn = "9783030633189",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "622--632",

editor = "Radek Silhavy and Petr Silhavy and Zdenka Prokopova",

booktitle = "Software Engineering Perspectives in Intelligent Systems - Proceedings of 4th Computational Methods in Systems and Software 2020",

}

Pavez, L , Altimiras, F & Villavicencio, G 2020, A K-means Bat Optimisation Algorithm Applied to the Set Covering Problem. En R Silhavy, P Silhavy & Z Prokopova (eds.), Software Engineering Perspectives in Intelligent Systems - Proceedings of 4th Computational Methods in Systems and Software 2020. Advances in Intelligent Systems and Computing, vol. 1295, Springer Science and Business Media Deutschland GmbH, pp. 622-632, 4th Computational Methods in Systems and Software, CoMeSySo 2020, Vsetin, República Checa, 14/10/20. https://doi.org/10.1007/978-3-030-63319-6_58

A K-means Bat Optimisation Algorithm Applied to the Set Covering Problem. / Pavez, Leonardo ; Altimiras, Francisco; Villavicencio, Gabriel.
Software Engineering Perspectives in Intelligent Systems - Proceedings of 4th Computational Methods in Systems and Software 2020. ed. / Radek Silhavy; Petr Silhavy; Zdenka Prokopova. Springer Science and Business Media Deutschland GmbH, 2020. p. 622-632 (Advances in Intelligent Systems and Computing; Vol. 1295).

Producción científica: Capítulo del libro/informe/acta de congreso › Contribución a la conferencia › revisión exhaustiva

TY - GEN

T1 - A K-means Bat Optimisation Algorithm Applied to the Set Covering Problem

AU - Pavez, Leonardo

AU - Altimiras, Francisco

AU - Villavicencio, Gabriel

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 -

Pavez L , Altimiras F, Villavicencio G. A K-means Bat Optimisation Algorithm Applied to the Set Covering Problem. En Silhavy R, Silhavy P, Prokopova Z, editores, Software Engineering Perspectives in Intelligent Systems - Proceedings of 4th Computational Methods in Systems and Software 2020. Springer Science and Business Media Deutschland GmbH. 2020. p. 622-632. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-3-030-63319-6_58

A K-means Bat Optimisation Algorithm Applied to the Set Covering Problem

Resumen

Serie de la publicación

Conferencia

ODS de las Naciones Unidas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto