Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorRiquelme-Leiva M.
dc.contributor.authorPeña C.
dc.contributor.authorTorres-Rojas C.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:16:07Z
dc.date.available2020-09-02T22:16:07Z
dc.date.issued2015
dc.identifier10.1007/978-3-319-18473-9_30
dc.identifier.citation349, , 307-315
dc.identifier.issn21945357
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4204
dc.descriptionIn this paper, we propose a set of Modified Binary Firefly Algorithms (MBFF) to solve different instances of the Set Covering Problem (SCP). The algorithms consider eight Transfer Functions and five Discretization Methods in order to solve the binary representation of SCP. The results obtained show that our algorithms are a good and cheap alternative to solve the problem at hand. © Springer International Publishing Switzerland 2015.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceSilhavy R.Senkerik R.Oplatkova Z.K.Prokopova Z.Silhavy P.
dc.subjectCombinatorial Optimization
dc.subjectMetaheuristics
dc.subjectModified Binary FireFly Algorithm
dc.subjectSet Covering Problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectBioluminescence
dc.subjectCombinatorial optimization
dc.subjectDiscrete event simulation
dc.subjectFactory automation
dc.subjectIntelligent systems
dc.subjectOptimization
dc.subjectSoftware engineering
dc.subjectTransfer functions
dc.subjectBinary representations
dc.subjectDiscretization method
dc.subjectFirefly algorithms
dc.subjectMeta heuristics
dc.subjectSet covering problem
dc.subjectSolving Set
dc.subjectProblem solving
dc.titleModified binary firefly algorithms with different transfer functions for solving set covering problems
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record