Using the Firefly Optimization Method to Solve the Weighted 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

5 Citas (Scopus)

Resumen

The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, a Binary Firefly Algorithm has been developed to tackle the Weighted Set Covering Problem. Firefly Algorithm is a recently developed population-based metaheuristic inspired by the flashing behaviour of fireflies. Experimental results show that our approach is competitive solving the problem at hand.

Idioma originalInglés
Título de la publicación alojadaHCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings
EditorialSpringer Verlag
Páginas509-514
Número de páginas6
ISBN (versión impresa)9783319078564
DOI
EstadoPublicada - 2014
Publicado de forma externa

Serie de la publicación

NombreCommunications in Computer and Information Science
Volumen434 PART I
ISSN (versión impresa)1865-0929

Huella

Profundice en los temas de investigación de 'Using the Firefly Optimization Method to Solve the Weighted Set Covering Problem'. En conjunto forman una huella única.

Citar esto