Binarization methods for shuffled frog leaping algorithms that solve set covering problems
Abstract
This work proposes Shuffled Frog Leaping Algorithms (SFLAs) to solve Set Covering Problems (SCPs). The proposed algorithms include eight transfer function and five discretization methods in order to solve the binary representation of SCP. Different instances of the SetCovering Problem are solved to test our algorithm showing very promising results. © Springer International Publishing Switzerland 2015.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Conference Paper
-
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)
(Institute of Electrical and Electronics Engineers Inc., 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)
(Institute of Electrical and Electronics Engineers Inc., 2015)