A binary firefly algorithm for the set covering problem
MetadataShow full item record
The non-unicost Set Covering Problem is a well-known NP-hard problem with many practical applications. In this work, a new approach based on Binary Firefly Algorithm is proposed to solve this problem. The Firefly Algorithm has attracted much attention and has been applied to many optimization problems. Here, we demonstrate that is also able to produce very competitive results solving the portfolio of set covering problems from the OR-Library. © Springer International Publishing Switzerland 2014.
Showing items related by title, author, creator and subject.
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)
Conference PaperCrawford B.; Soto R.; Olivares-Suárez M.; Paredes F. (Springer Verlag, 2014)
Conference PaperCrawford B.; Soto R.; Cuesta R.; Olivares-Suárez M.; Johnson F.; Olguín E. (SciTePress, 2014)