@inproceedings{cd3ce5e023574bd3a9757ffd927fb2d6,

title = "Fireworks explosion can solve the set covering problem",

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

keywords = "Firework algorithm, Metaheuristic, Set Covering Problem",

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

note = "Funding Information: The author Broderick Crawford is supported by grant CONICYT/FONDE CYT/REGULAR/1140897 and Ricardo Soto is supported by grant CONICYT/FONDECYT/ INICIACION/11130459. Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; null ; Conference date: 27-04-2016 Through 30-04-2016",

year = "2016",

doi = "10.1007/978-3-319-33625-1_43",

language = "English",

isbn = "9783319336237",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "477--490",

editor = "Radek Silhavy and Roman Senkerik and Oplatkova, {Zuzana Kominkova} and Petr Silhavy and Zdenka Prokopova",

booktitle = "Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016",

}