Fireworks explosion can solve the set covering problem

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

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

1 Cita (Scopus)

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaArtificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016
EditoresRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
EditorialSpringer Verlag
Páginas477-490
Número de páginas14
ISBN (versión impresa)9783319336237
DOI
EstadoPublicada - 2016
Publicado de forma externa
Evento5th Computer Science On-line Conference, CSOC 2016 - Prague, República Checa
Duración: 27 abr 201630 abr 2016

Serie de la publicación

NombreAdvances in Intelligent Systems and Computing
Volumen464
ISSN (versión impresa)2194-5357

Conferencia

Conferencia5th Computer Science On-line Conference, CSOC 2016
País/TerritorioRepública Checa
CiudadPrague
Período27/04/1630/04/16

Huella

Profundice en los temas de investigación de 'Fireworks explosion can solve the set covering problem'. En conjunto forman una huella única.

Citar esto