Title
Modified binary firefly algorithms with different transfer functions for solving set covering problems
Date Issued
01 January 2015
Access level
metadata only access
Resource Type
conference paper
Author(s)
Crawford B.
Riquelme-Leiva M.
Peña C.
Torres-Rojas C.
Johnson F.
Paredes F.
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Springer Verlag
Abstract
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.
Start page
307
End page
315
Volume
349
Language
English
OCDE Knowledge area
Ciencias de la computación
Otras ingenierías y tecnologías
Subjects
Scopus EID
2-s2.0-84942756744
Source
Advances in Intelligent Systems and Computing
Resource of which it is part
Advances in Intelligent Systems and Computing
ISSN of the container
21945357
ISBN of the container
978-331918472-2
Conference
4th International Conference on Computer Science On-line Conference, CSOC 2015
Sources of information:
Directorio de Producción Científica
Scopus