Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorLegüe I.F.
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-33625-1_41
dc.identifier.citation464, , 459-468
dc.identifier.issn21945357
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4150
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 InvasiveWeed Optimization (IWO), in its binary version; Binary InvasiveWeed Optimization (BIWO). IWO, it is to imitate to InvasiveWeed behavior (reproduction and selection natural), through mathematics formulations. Where the best weed has more chance of reproduction. © Springer International Publishing Switzerland 2016.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceSilhavy R.Senkerik R.Oplatkova Z.K.Silhavy P.Prokopova Z.
dc.subjectBinary invasive weed
dc.subjectInvasive weed optimization
dc.subjectMetaheuristics
dc.subjectSet covering problem
dc.subjectAlgorithms
dc.subjectArtificial intelligence
dc.subjectBins
dc.subjectIntelligent systems
dc.subjectNetwork management
dc.subjectDatabanks
dc.subjectInvasive weed
dc.subjectInvasive weed optimization
dc.subjectMathematics formulations
dc.subjectMeta heuristics
dc.subjectOptimization algorithms
dc.subjectProduction line
dc.subjectSet covering problem
dc.subjectOptimization
dc.titleA binary invasiveweed optimization 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