@inproceedings{c7fbc770e70f413981101c7397cb0331,

title = "A binary 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 percentile concept. In particular, we apply the percentile concept 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 percentile concept in binarization. Additionally, we verify the effectiveness of our algorithm through reference instances. The results indicate the binary grasshopper optimization algorithm (BGOA) obtains adequate results when evaluated with a combinatorial problem such as the SCP.",

author = "Broderick Crawford and Ricardo Soto and Alvaro Pe{\~n}a and Gino Astorga",

note = "Publisher Copyright: {\textcopyright} 2019, Springer International Publishing AG, part of Springer Nature.; null ; Conference date: 25-04-2018 Through 28-04-2018",

year = "2019",

doi = "10.1007/978-3-319-91192-2_1",

language = "English",

isbn = "9783319911915",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "1--12",

editor = "Radek Silhavy",

booktitle = "Software Engineering and Algorithms in Intelligent Systems - Proceedings of 7th Computer Science On-line Conference 2018",

}