Solving set covering problem with fireworks explosion

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

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

3 Scopus citations


To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm 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 (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection strategy. 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.

Original languageEnglish
Title of host publicationComputational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings
EditorsBernady O. Apduhan, Beniamino Murgante, Sanjay Misra, David Taniar, Carmelo M. Torre, Ana Maria A.C. Rocha, Shangguang Wang, Osvaldo Gervasi, Elena Stankova
PublisherSpringer Verlag
Number of pages11
ISBN (Print)9783319420844
StatePublished - 2016
Event16th International Conference on Computational Science and Its Applications, ICCSA 2016 - Beijing, China
Duration: 4 Jul 20167 Jul 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference16th International Conference on Computational Science and Its Applications, ICCSA 2016


  • Firework algorithm
  • Metaheuristic
  • Set covering problem


Dive into the research topics of 'Solving set covering problem with fireworks explosion'. Together they form a unique fingerprint.

Cite this