Title
Binarization methods for shuffled frog leaping algorithms that solve set covering problems
Date Issued
01 January 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)
Springer Verlag
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.
Start page
317
End page
326
Volume
349
Language
English
OCDE Knowledge area
Ingeniería de sistemas y comunicaciones
Informática y Ciencias de la Información
Subjects
Scopus EID
2-s2.0-84942797601
ISSN of the container
21945357
ISBN of the container
978-331918472-2
DOI of the container
10.1007/978-3-319-18473-9_31
Conference
Advances in Intelligent Systems and Computing
Sources of information:
Directorio de Producción Científica
Scopus