Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorLegue I.F.
dc.contributor.authorOlguin E.
dc.date.accessioned2020-09-02T22:15:40Z
dc.date.available2020-09-02T22:15:40Z
dc.date.issued2016
dc.identifier10.1109/CISTI.2016.7521489
dc.identifier.citation2016-July, , -
dc.identifier.issn21660727
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4147
dc.descriptionThe Set Covering Problem (SCP) is a classic problem of combinatorial analytic. This problem consists in to find solutions what cover the needs to lower cost. Those can be services to cities, load balancing in production lines or databanks selections. In this paper, we study the resolution of SCP, through Invasive Weed Optimization (IWO), in its binary version; Binary Invasive Weed Optimization (BIWO). IWO, it is to imitate to Invasive Weed behavior (reproduction and selection natural), through mathematics formulations. Where the best weed has more chance of reproduction. © 2016 AISTI.
dc.language.isoes
dc.publisherIEEE Computer Society
dc.sourceRocha A.Reis L.P.Cota M.P.Goncalves R.Suarez O.S.
dc.subjectBinary Invasive Weed
dc.subjectInvasive Weed Optimization
dc.subjectMetaheuristics
dc.subjectSet Covering Problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectInformation systems
dc.subjectNetwork management
dc.subjectDatabanks
dc.subjectInvasive weed
dc.subjectInvasive weed optimization
dc.subjectInvasive Weed Optimization algorithms
dc.subjectMathematics formulations
dc.subjectMeta heuristics
dc.subjectProduction line
dc.subjectSet covering problem
dc.subjectOptimization
dc.titleA discrete invasive weed optimization algorithm for the set covering problem [Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem]
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record