Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorTorres-Rojas C.
dc.contributor.authorPeña C.
dc.contributor.authorRiquelme-Leiva M.
dc.contributor.authorMisra S.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:16:14Z
dc.date.available2020-09-02T22:16:14Z
dc.date.issued2015
dc.identifier10.1007/978-3-319-21410-832
dc.identifier.citation9158, , 411-420
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4248
dc.descriptionThe Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library. © Springer International Publishing Switzerland 2015.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceGavrilova M.L.Gervasi O.Murgante B.Misra S.Torre C.Taniar D.Apduhan B.O.Rocha A.M.A.C.Misra S.
dc.subjectCombinatorial optimization problem
dc.subjectFruit Fly Optimization Algorithm
dc.subjectMetaheuristics
dc.subjectSet Covering Problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectCombinatorial optimization
dc.subjectComputational complexity
dc.subjectFruits
dc.subjectProblem solving
dc.subjectBinarizations
dc.subjectCombinatorial optimization problems
dc.subjectFruit flies
dc.subjectMeta heuristics
dc.subjectSet covering problem
dc.subjectOptimization
dc.titleA binary fruit fly optimization algorithm to solve the set covering problem
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record