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]
Autor
Crawford B.
Soto R.
Peña C.
Riquelme-Leiva M.
Torres-Rojas C.
Johnson F.
Paredes F.
Resumen
This paper presents metaheuristic Shuffled Frog Leaping Algorithm (SFLA) to solve the Set Covering Problem (SCP), the SFLA is inspired by the social behavior of frogs, and is being applied to solve many optimization problems. The proposed algorithm includes eight binarization functions and discretization method for resolving the binary representation of the SCP. In the 65 instances of SCP we obtains very promising results. © 2015 AISTI.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
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 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
The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje] (2020)
Crawford B.; Soto R.; Leiva F.A.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)