Heuristic feasibility and preprocessing for a set covering solver based on firefly optimization

Ricardo Soto, Broderick Crawford, José Vilches, Franklin Johnson, Fernando Paredes

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

2 Scopus citations


The set covering problem is a classic benchmark that has many real applications such as positioning of communications systems, logical analysis, steel production, vehicle routing, and service allocation in general. In this paper, we present an improved firefly algorithm to the efficient resolution of this problem. The firefly algorithm is a recent metaheuristic based on the flashing characteristics of fireflies that attract each other by using their brightness. We improve this approach by incorporating pre-processing and an heuristic feasibility operator resulting in an interesting solver able to clearly outperform the previously reported results obtained from firefly algorithms.

Original languageEnglish
Title of host publicationArtificial Intelligence Perspectives and Applications - Proceedings of the 4th Computer Science On-line Conference 2015, CSOC 2015
EditorsRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Zdenka Prokopova, Petr Silhavy
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783319184753
StatePublished - 2015
Event4th Computer Science On-line Conference, CSOC 2015 - Zlin, Czech Republic
Duration: 27 Apr 201530 Apr 2015

Publication series

NameAdvances in Intelligent Systems and Computing
ISSN (Print)2194-5357


Conference4th Computer Science On-line Conference, CSOC 2015
Country/TerritoryCzech Republic


  • Firefly Algorithm
  • Metaheuristic
  • Set Covering Problem


Dive into the research topics of 'Heuristic feasibility and preprocessing for a set covering solver based on firefly optimization'. Together they form a unique fingerprint.

Cite this