A binary firefly algorithm for the set covering problem
Autor
Crawford B.
Soto R.
Olivares-Suárez M.
Paredes F.
Resumen
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.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
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 Paper
Using the Firefly Optimization Method to Solve the Weighted Set Covering Problem (2020)
Crawford B.; Soto R.; Olivares-Suárez M.; Paredes F. (Springer Verlag, 2014) -
Conference Paper
Two swarm intelligence algorithms for the Set Covering problem (2020)
Crawford B.; Soto R.; Cuesta R.; Olivares-Suárez M.; Johnson F.; Olguín E. (SciTePress, 2014)