A binary fruit fly optimization algorithm to solve the set covering problem
MetadataShow full item record
The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library. © Springer International Publishing Switzerland 2015.
Showing items related by title, author, creator and subject.
Conference PaperCrawford B.; Soto R.; Peña C.; Riquelme-Leiva M.; Torres-Rojas C.; Misra S.; Johnson F.; Paredes F. (Springer Verlag, 2015)
Modified binary firefly algorithms with different transfer functions for solving set covering problems (2020) Crawford B.; Soto R.; Riquelme-Leiva M.; Peña C.; Torres-Rojas C.; Johnson F.; Paredes F. (Springer Verlag, 2015)
Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario] (2020) Crawford B.; Soto R.; Riquelme-Leiva M.; Peña C.; Torres-Rojas C.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)