A Percentile Firefly Algorithm an Application to the Set Covering Problem

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva


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.

Idioma originalInglés
Título de la publicación alojadaArtificial Intelligence in Intelligent Systems - Proceedings of 10th Computer Science On-line Conference, 2021
EditoresRadek Silhavy
EditorialSpringer Science and Business Media Deutschland GmbH
Número de páginas10
ISBN (versión impresa)9783030774448
EstadoPublicada - 2021
Publicado de forma externa
Evento10th Computer Science Online Conference, CSOC 2021 - Virtual, Online
Duración: 1 abr. 20211 abr. 2021

Serie de la publicación

NombreLecture Notes in Networks and Systems
ISSN (versión impresa)2367-3370
ISSN (versión digital)2367-3389


Conferencia10th Computer Science Online Conference, CSOC 2021
CiudadVirtual, Online


Profundice en los temas de investigación de 'A Percentile Firefly Algorithm an Application to the Set Covering Problem'. En conjunto forman una huella única.

Citar esto