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]
MetadataShow full item record
Cuckoo search is a modern bio-inspired metaheuristic that has successfully been used to solve different real world optimization problems. In particular, it has exhibited rapid convergence reaching considerable good results. In this paper, we employ this technique to solve the set covering problem, which is a well-known optimization benchmark. We illustrate interesting experimental results where the proposed algorithm is able to obtain several global optimums for different set covering instances from the OR-Library. © 2015 AISTI.
Showing items related by title, author, creator and subject.
Conference PaperSoto R.; Crawford B.; Lizama S.; Johnson F.; Paredes F. (Springer Verlag, 2016)
The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje] (2020) Crawford B.; Soto R.; Leiva F.A.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)
Using binary fruit fly algorithm for solving the set covering problem [Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura] (2020) Crawford B.; Soto R.; Torres-Rojas C.; Peña C.; Riquelme-Leiva M.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)