Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorPeña C.
dc.contributor.authorRiquelme-Leiva M.
dc.contributor.authorTorres-Rojas C.
dc.contributor.authorMisra S.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:29Z
dc.date.available2020-09-02T22:15:29Z
dc.date.issued2015
dc.identifier10.1007/978-3-319-21410-834
dc.identifier.citation9158, , 431-443
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4072
dc.descriptionThe Set Covering Problem (SCP) is a classic problem in combinatorial optimization. SCP has many applications in engineering, including problems involving routing, scheduling, stock cutting, electoral redistricting and others important real life situations. Because of its importance, SCP has attracted attention of many researchers. However, SCP instances are known as complex and generally NP-hard problems. Due to the combinatorial nature of this problem, during the last decades, several metaheuristics have been applied to obtain efficient solutions. This paper presents a metaheuristics comparison for the SCP. Three recent nature-inspired metaheuristics are considered: Shuffled Frog Leaping, Firefly and Fruit Fly algorithms. The results show that they can obtainn optimal or close to optimal solutions at low computational cost. © 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.subjectFirefly algorithm
dc.subjectFruit fly algorithm
dc.subjectMetaheuristics
dc.subjectSet Covering Problem
dc.subjectShuffled Frog Leaping Algorithm
dc.subjectAlgorithms
dc.subjectBioluminescence
dc.subjectCombinatorial optimization
dc.subjectComputational complexity
dc.subjectFruits
dc.subjectHeuristic algorithms
dc.subjectFirefly algorithms
dc.subjectFruit flies
dc.subjectMeta heuristics
dc.subjectSet covering problem
dc.subjectShuffled frog leaping algorithm (SFLA)
dc.subjectOptimization
dc.titleA comparison of three recent nature-inspired metaheuristics 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