Title
A binary cuckoo search algorithm for solving the set covering problem
Date Issued
01 January 2015
Access level
metadata only access
Resource Type
conference paper
Author(s)
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Springer Verlag
Abstract
The non-unicost set covering problem is a classical optimization benchmark that belongs to the Karp’s 21 NP-complete problems. In this paper, we present a new approach based on cuckoo search for solving such problem. Cuckoo search is a modern nature-inspired metaheuristic that has attracted much attention due to its rapid convergence and easy implementation. We illustrate interesting experimental results where the proposed cuckoo search algorithm reaches several global optimums for the non-unicost instances from the OR-Library.
Start page
88
End page
97
Volume
9108
Language
English
OCDE Knowledge area
Otras ingenierías y tecnologías
Ciencias de la computación
Subjects
Scopus EID
2-s2.0-84937684855
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
9783319188324
Conference
International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015
Sources of information:
Directorio de Producción Científica
Scopus