A binary cuckoo search algorithm for solving the set covering problem
MetadataShow full item record
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. © Springer International Publishing Switzerland 2015
Showing items related by title, author, creator and subject.
Solving pre-processed set covering problems via cuckoo search and lévy flights [Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight] (2020) Soto R.; Crawford B.; Barraza J.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)
Conference PaperCrawford B.; Soto R.; Guzmán N.; Johnson F.; Paredes F. (Springer Verlag, 2015)
The set covering problem solved by the Black Hole Algorithm [El Problema de Cobertura de Conjuntos solucionado por el Algoritmo del Agujero Negro] (2020) Soto R.; Crawford B.; Figueroa I.; Olivares R.; Olguin E. (IEEE Computer Society, 2016)