Crawford, B.Soto, R.Astudillo, G.Olguín, E.Misra, S.6/22/20222022-09-306/22/20222022-09-302016https://doi.org/10.1007/978-3-319-42085-1_21To 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. © Springer International Publishing Switzerland 2016.application/pdfenginfo:eu-repo/semantics/closedAccessComputer ScienceMathematicsinfo:eu-repo/semantics/article10.1007/978-3-319-42085-1_21http://purl.org/pe-repo/ocde/ford#1.02.01