A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem

Gabriel Villavicencio; Matias Valenzuela; Francisco Altimiras; Paola Moraga; Hernan Pinto

doi:10.1007/978-3-030-51971-1_25

A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem

Gabriel Villavicencio, Matias Valenzuela, Francisco Altimiras, Paola Moraga, Hernan Pinto

SCHOOL OF CONSTRUCTION ENGINEERING

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Artificial Intelligence and Bioinspired Computational Methods - Proceedings of the 9th Computer Science On-line Conference, CSOC 2020
Editors	Radek Silhavy
Publisher	Springer
Pages	312-323
Number of pages	12
ISBN (Print)	9783030519704
DOIs	https://doi.org/10.1007/978-3-030-51971-1_25
State	Published - 2020
Event	9th Computer Science On-line Conference, CSOC 2020 - Zlin, Czech Republic Duration: 15 Jul 2020 → 15 Jul 2020

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	1225 AISC
ISSN (Print)	2194-5357
ISSN (Electronic)	2194-5365

Conference

Conference	9th Computer Science On-line Conference, CSOC 2020
Country/Territory	Czech Republic
City	Zlin
Period	15/07/20 → 15/07/20

Access to Document

10.1007/978-3-030-51971-1_25

Cite this

Villavicencio, G., Valenzuela, M., Altimiras, F., Moraga, P., & Pinto, H. (2020). A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem. In R. Silhavy (Ed.), Artificial Intelligence and Bioinspired Computational Methods - Proceedings of the 9th Computer Science On-line Conference, CSOC 2020 (pp. 312-323). (Advances in Intelligent Systems and Computing; Vol. 1225 AISC). Springer. https://doi.org/10.1007/978-3-030-51971-1_25

Villavicencio, Gabriel ; Valenzuela, Matias ; Altimiras, Francisco et al. / A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem. Artificial Intelligence and Bioinspired Computational Methods - Proceedings of the 9th Computer Science On-line Conference, CSOC 2020. editor / Radek Silhavy. Springer, 2020. pp. 312-323 (Advances in Intelligent Systems and Computing).

@inproceedings{fbffea75b15544b7902193c8350ec984,

title = "A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem",

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

author = "Gabriel Villavicencio and Matias Valenzuela and Francisco Altimiras and Paola Moraga and Hernan Pinto",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 9th Computer Science On-line Conference, CSOC 2020 ; Conference date: 15-07-2020 Through 15-07-2020",

year = "2020",

doi = "10.1007/978-3-030-51971-1_25",

language = "English",

isbn = "9783030519704",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer",

pages = "312--323",

editor = "Radek Silhavy",

booktitle = "Artificial Intelligence and Bioinspired Computational Methods - Proceedings of the 9th Computer Science On-line Conference, CSOC 2020",

}

Villavicencio, G, Valenzuela, M, Altimiras, F, Moraga, P & Pinto, H 2020, A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem. in R Silhavy (ed.), Artificial Intelligence and Bioinspired Computational Methods - Proceedings of the 9th Computer Science On-line Conference, CSOC 2020. Advances in Intelligent Systems and Computing, vol. 1225 AISC, Springer, pp. 312-323, 9th Computer Science On-line Conference, CSOC 2020, Zlin, Czech Republic, 15/07/20. https://doi.org/10.1007/978-3-030-51971-1_25

A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem. / Villavicencio, Gabriel; Valenzuela, Matias; Altimiras, Francisco et al.
Artificial Intelligence and Bioinspired Computational Methods - Proceedings of the 9th Computer Science On-line Conference, CSOC 2020. ed. / Radek Silhavy. Springer, 2020. p. 312-323 (Advances in Intelligent Systems and Computing; Vol. 1225 AISC).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem

AU - Villavicencio, Gabriel

AU - Valenzuela, Matias

AU - Altimiras, Francisco

AU - Moraga, Paola

AU - Pinto, Hernan

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85089716968&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-51971-1_25

DO - 10.1007/978-3-030-51971-1_25

M3 - Conference contribution

AN - SCOPUS:85089716968

SN - 9783030519704

T3 - Advances in Intelligent Systems and Computing

SP - 312

EP - 323

BT - Artificial Intelligence and Bioinspired Computational Methods - Proceedings of the 9th Computer Science On-line Conference, CSOC 2020

A2 - Silhavy, Radek

PB - Springer

T2 - 9th Computer Science On-line Conference, CSOC 2020

Y2 - 15 July 2020 through 15 July 2020

ER -

Villavicencio G, Valenzuela M, Altimiras F, Moraga P , Pinto H. A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem. In Silhavy R, editor, Artificial Intelligence and Bioinspired Computational Methods - Proceedings of the 9th Computer Science On-line Conference, CSOC 2020. Springer. 2020. p. 312-323. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-3-030-51971-1_25

A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this