TY - GEN

T1 - A Percentile Firefly Algorithm an Application to the Set Covering Problem

AU - Jorquera, Lorena

AU - Valenzuela, Pamela

AU - Causa, Leonardo

AU - Moraga, Paola

AU - Villavicencio, Gabriel

N1 - Publisher Copyright:
© 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.

PY - 2021

Y1 - 2021

N2 - The application of continuous metaheuristic algorithms to combinatorial problems is an area of interest at the engineering level. This interest is related to the fact that many of the problems that are addressed at the industrial level are of the combinatorial type and a not lesser subset of these are of the NP-hard type. In this article, we propose a binarization mechanism for continuous metaheuristics that uses the concept of percentile. This percentile concept is applied to the firefly optimization algorithm to solve the set covering problem (SCP). To determine the importance of the percentile concept, experiments were designed to identify its contribution. Additionally, to see that the proposal is adequate, the efficiency of the algorithm is compared using reference instances. The results indicate that the binary percentile firefly algorithm (BPFA) obtains adequate results when evaluated with a combinatorial problem such as the SCP.

AB - The application of continuous metaheuristic algorithms to combinatorial problems is an area of interest at the engineering level. This interest is related to the fact that many of the problems that are addressed at the industrial level are of the combinatorial type and a not lesser subset of these are of the NP-hard type. In this article, we propose a binarization mechanism for continuous metaheuristics that uses the concept of percentile. This percentile concept is applied to the firefly optimization algorithm to solve the set covering problem (SCP). To determine the importance of the percentile concept, experiments were designed to identify its contribution. Additionally, to see that the proposal is adequate, the efficiency of the algorithm is compared using reference instances. The results indicate that the binary percentile firefly algorithm (BPFA) obtains adequate results when evaluated with a combinatorial problem such as the SCP.

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

U2 - 10.1007/978-3-030-77445-5_67

DO - 10.1007/978-3-030-77445-5_67

M3 - Conference contribution

AN - SCOPUS:85115862545

SN - 9783030774448

T3 - Lecture Notes in Networks and Systems

SP - 750

EP - 759

BT - Artificial Intelligence in Intelligent Systems - Proceedings of 10th Computer Science On-line Conference, 2021

A2 - Silhavy, Radek

PB - Springer Science and Business Media Deutschland GmbH

T2 - 10th Computer Science Online Conference, CSOC 2021

Y2 - 1 April 2021 through 1 April 2021

ER -