TY - GEN

T1 - A Percentil Gravitational Search Algorithm an Aplication 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 - The study and understanding of algorithms that solve combinatorial problems based on swarm intelligence continuous metaheuristics, is an area of interest at the level of basic and applied science. This is due to the fact that many of the problems addressed at industrial level are of a combinatorial type and a subset no less than these are of the NP-hard type. In this article, a mechanism of binarization of continuous metaheuristics that uses the concept of the percentile is proposed. This percentile concept is applied to the An Lion optimization algorithm, solving the set covering problem (SCP). Experiments were designed to demonstrate the importance of the percentile concept in the binarization process. Subsequently, the efficiency of the algorithm is verified through reference instances. The results indicate that the binary percentile gravitational search algorithm (BPGSA) obtains adequate results when evaluated with a combinatorial problem such as the SCP.

AB - The study and understanding of algorithms that solve combinatorial problems based on swarm intelligence continuous metaheuristics, is an area of interest at the level of basic and applied science. This is due to the fact that many of the problems addressed at industrial level are of a combinatorial type and a subset no less than these are of the NP-hard type. In this article, a mechanism of binarization of continuous metaheuristics that uses the concept of the percentile is proposed. This percentile concept is applied to the An Lion optimization algorithm, solving the set covering problem (SCP). Experiments were designed to demonstrate the importance of the percentile concept in the binarization process. Subsequently, the efficiency of the algorithm is verified through reference instances. The results indicate that the binary percentile gravitational search algorithm (BPGSA) obtains adequate results when evaluated with a combinatorial problem such as the SCP.

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

U2 - 10.1007/978-3-030-63319-6_62

DO - 10.1007/978-3-030-63319-6_62

M3 - Conference contribution

AN - SCOPUS:85098201993

SN - 9783030633189

T3 - Advances in Intelligent Systems and Computing

SP - 663

EP - 673

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 -