Title
Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem
Other title
Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto
Date Issued
28 July 2015
Access level
metadata only access
Resource Type
conference paper
Author(s)
Crawford B.
Peña C.
Riquelme-Leiva M.
Torres-Rojas C.
Johnson F.
Paredes F.
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Institute of Electrical and Electronics Engineers Inc.
Abstract
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.
Language
Spanish
OCDE Knowledge area
Informática y Ciencias de la Información
Ingeniería de sistemas y comunicaciones
Subjects
Scopus EID
2-s2.0-84943328619
ISBN
9789899843455
ISBN of the container
978-989984345-5
DOI of the container
10.1109/CISTI.2015.7170376
Conference
2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Sources of information:
Directorio de Producción Científica
Scopus