Modified binary firefly algorithms with different transfer functions for solving set covering problems
Autor
Crawford B.
Soto R.
Riquelme-Leiva M.
Peña C.
Torres-Rojas C.
Johnson F.
Paredes F.
Resumen
In this paper, we propose a set of Modified Binary Firefly Algorithms (MBFF) to solve different instances of the Set Covering Problem (SCP). The algorithms consider eight Transfer Functions and five Discretization Methods in order to solve the binary representation of SCP. The results obtained show that our algorithms are a good and cheap alternative to solve the problem at hand. © Springer International Publishing Switzerland 2015.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
Binarization methods for shuffled frog leaping algorithms that solve set covering problems (2020)
Crawford B.; Soto R.; Peña C.; Riquelme-Leiva M.; Torres-Rojas C.; Johnson F.; Paredes F. (Springer Verlag, 2015) -
Conference Paper
Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario] (2020)
Crawford B.; Soto R.; Riquelme-Leiva M.; Peña C.; Torres-Rojas C.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015) -
Conference Paper
Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem [Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto] (2020)
Crawford B.; Soto R.; Peña C.; Riquelme-Leiva M.; Torres-Rojas C.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)