A binary firefly algorithm for the set covering problem

Broderick Crawford, Ricardo Soto, Miguel Olivares-Suárez, Fernando Paredes

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

42 Citas (Scopus)

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.

Idioma originalInglés
Título de la publicación alojadaModern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014
EditoresRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
EditorialSpringer Verlag
Páginas65-73
Número de páginas9
ISBN (versión digital)9783319067391
DOI
EstadoPublicada - 2014
Publicado de forma externa
Evento3rd Computer Science On-line Conference, CSOC 2014 -
Duración: 1 abr 2014 → …

Serie de la publicación

NombreAdvances in Intelligent Systems and Computing
Volumen285
ISSN (versión impresa)2194-5357

Conferencia

Conferencia3rd Computer Science On-line Conference, CSOC 2014
Período1/04/14 → …

Huella

Profundice en los temas de investigación de 'A binary firefly algorithm for the set covering problem'. En conjunto forman una huella única.

Citar esto