Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorLegüe I.F.
dc.contributor.authorMisra S.
dc.contributor.authorOlguín E.
dc.date.accessioned2020-09-02T22:15:40Z
dc.date.available2020-09-02T22:15:40Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-42092-9_11
dc.identifier.citation9790, , 129-138
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4149
dc.descriptionThe Weighted Set Cover Problem (SCP) is a popular optimization problem that has been applied to different industrial applications, including scheduling, manufacturing, service planning and location problems. It consists in to find low cost solutions covering a set of requirements or needs. In this paper, we solve the SCP using a recent nature inspired algorithm: Invasive Weed Optimization (IWO). IWO imitates the invasive behavior of real weeds: natural reproduction and selection where the best weed has more chance of reproduction. We test our approach using known ORLIB test problems for the SCP. The computational results show that the IWO metaheuristic can find very good results. © Springer International Publishing Switzerland 2016.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceMisra S.Gervasi O.Torre C.M.Taniar D.Stankova E.Rocha A.M.A.C.Wang S.Murgante B.Apduhan B.O.
dc.subjectCombinatorial optimization
dc.subjectInvasive Weed Optimization
dc.subjectSet covering problem
dc.subjectAlgorithms
dc.subjectCombinatorial optimization
dc.subjectComputational results
dc.subjectInvasive weed optimization
dc.subjectLocation problems
dc.subjectLow-cost solution
dc.subjectNature inspired algorithms
dc.subjectOptimization problems
dc.subjectSet covering problem
dc.subjectWeighted set covers
dc.subjectOptimization
dc.titleA weed colonization inspired algorithm for the weighted set cover problem
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record