Fireworks explosion can solve the set covering problem

Broderick Crawford, Ricardo Soto, Gonzalo Astudillo, Eduardo Olguín

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

1 Scopus citations


The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero/one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we will use a metaheuristic called Fireworks Algorithm (FWA) inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection strategy.

Original languageEnglish
Title of host publicationArtificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016
EditorsRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783319336237
StatePublished - 2016
Event5th Computer Science On-line Conference, CSOC 2016 - Prague, Czech Republic
Duration: 27 Apr 201630 Apr 2016

Publication series

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


Conference5th Computer Science On-line Conference, CSOC 2016
Country/TerritoryCzech Republic


  • Firework algorithm
  • Metaheuristic
  • Set Covering Problem


Dive into the research topics of 'Fireworks explosion can solve the set covering problem'. Together they form a unique fingerprint.

Cite this