@inproceedings{27c8c100b5484d95aebd2fda9e5b6809,

title = "Solving set covering problem with fireworks explosion",

abstract = "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.",

keywords = "Firework algorithm, Metaheuristic, Set covering problem",

author = "Broderick Crawford and Ricardo Soto and Gonzalo Astudillo and Eduardo Olgu{\'i}n and Sanjay Misra",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 16th International Conference on Computational Science and Its Applications, ICCSA 2016 ; Conference date: 04-07-2016 Through 07-07-2016",

year = "2016",

doi = "10.1007/978-3-319-42085-1_21",

language = "English",

isbn = "9783319420844",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "273--283",

editor = "Apduhan, {Bernady O.} and Beniamino Murgante and Sanjay Misra and David Taniar and Torre, {Carmelo M.} and Rocha, {Ana Maria A.C.} and Shangguang Wang and Osvaldo Gervasi and Elena Stankova",

booktitle = "Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings",

}