Fireworks explosion can solve the set covering problem
MetadataShow full item record
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. © Springer International Publishing Switzerland 2016.
Showing items related by title, author, creator and subject.
Conference PaperCrawford B.; Soto R.; Astudillo G.; Olguín E.; Misra S. (Springer Verlag, 2016)
Conference PaperCrawford B.; Soto R.; Olguín E.; Villablanca S.M.; Rubio Á.G.; Jaramillo A.; Salas J. (Springer Verlag, 2016)
Conference PaperCrawford B.; Soto R.; Cuesta R.; Olivares-Suárez M.; Johnson F.; Olguín E. (SciTePress, 2014)