Mostrar el registro sencillo del ítem

Fireworks explosion can solve the set covering problem

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorAstudillo G.
dc.contributor.authorOlguín E.
dc.date.accessioned2020-09-02T22:15:35Z
dc.date.available2020-09-02T22:15:35Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-33625-1_43
dc.identifier.citation464, , 477-490
dc.identifier.issn21945357
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4116
dc.descriptionThe 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.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceSilhavy R.Senkerik R.Oplatkova Z.K.Silhavy P.Prokopova Z.
dc.subjectFirework algorithm
dc.subjectMetaheuristic
dc.subjectSet Covering Problem
dc.subjectArtificial intelligence
dc.subjectExplosives
dc.subjectIntelligent systems
dc.subjectFireworks algorithms
dc.subjectFormal model
dc.subjectMapping rules
dc.subjectMetaheuristic
dc.subjectMutation operators
dc.subjectOptimal solutions
dc.subjectOptimization problems
dc.subjectSet covering problem
dc.subjectOptimization
dc.titleFireworks explosion can solve the set covering problem
dc.typeConference Paper


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-84964754747.pdf
Tamaño:
2.251Kb
Formato:
PDF
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem