Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorOlivares-Suárez M.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:42Z
dc.date.available2020-09-02T22:15:42Z
dc.date.issued2014
dc.identifier10.1007/978-3-319-06740-7_6
dc.identifier.citation285, , 65-73
dc.identifier.issn21945357
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4163
dc.descriptionThe non-unicost Set Covering Problem is a well-known NP-hard problem with many practical applications. In this work, a new approach based on Binary Firefly Algorithm is proposed to solve this problem. The Firefly Algorithm has attracted much attention and has been applied to many optimization problems. Here, we demonstrate that is also able to produce very competitive results solving the portfolio of set covering problems from the OR-Library. © Springer International Publishing Switzerland 2014.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceSilhavy R.Senkerik R.Oplatkova Z.K.Silhavy P.Prokopova Z.
dc.subjectBinary firefly algorithm
dc.subjectMetaheuristic
dc.subjectSet covering problem
dc.subjectAlgorithms
dc.subjectBioluminescence
dc.subjectComputational complexity
dc.subjectFactory automation
dc.subjectOptimization
dc.subjectSocial networking (online)
dc.subjectFirefly algorithms
dc.subjectMetaheuristic
dc.subjectNew approaches
dc.subjectOptimization problems
dc.subjectSet covering problem
dc.subjectProblem solving
dc.titleA binary firefly algorithm for the set covering problem
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record