Title
Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem
Date Issued
01 January 2015
Access level
metadata only access
Resource Type
conference paper
Author(s)
Crawford B.
Galleguillos C.
Barraza J.
Lizama S.
Muñoz A.
Vilches J.
Misra S.
Paredes F.
Pontificia Universidad Católica de Valparáıso
Publisher(s)
Springer Verlag
Abstract
The set covering problem is a classical model in the subject of combinatorial optimization for service allocation, that consists in finding a set of solutions for covering a range of needs at the lowest possible cost. In this paper, we report various approximate methods to solve this problem, such as Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms. We illustrate experimental results of these metaheuristics for solving a set of 65 non-unicost set covering problems from the Beasley’s OR-Library.
Start page
187
End page
202
Volume
9155
Language
English
OCDE Knowledge area
ZoologÃa, OrnitologÃa, EntomologÃa, ciencias biológicas del comportamiento
Otras ciencias naturales
Subjects
Scopus EID
2-s2.0-84948971651
ISBN
9783319214030
Source
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Resource of which it is part
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN of the container
03029743
ISBN of the container
978-331921403-0
Conference
15th International Conference on Computational Science and Its Applications, ICCSA 2015
Sources of information:
Directorio de Producción CientÃfica
Scopus