Using the Firefly Optimization Method to Solve the Weighted Set Covering Problem

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


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.

Original languageEnglish
Title of host publicationHCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings
PublisherSpringer Verlag
Number of pages6
ISBN (Print)9783319078564
StatePublished - 2014

Publication series

NameCommunications in Computer and Information Science
Volume434 PART I
ISSN (Print)1865-0929


  • Firefly Algorithm
  • Swarm Intelligence
  • Weighted Set Covering Problem


Dive into the research topics of 'Using the Firefly Optimization Method to Solve the Weighted Set Covering Problem'. Together they form a unique fingerprint.

Cite this