Mostrar el registro sencillo del ítem
A binary invasiveweed optimization algorithm for the set covering problem
dc.contributor.author | Crawford B. | |
dc.contributor.author | Soto R. | |
dc.contributor.author | Legüe I.F. | |
dc.contributor.author | Olguín E. | |
dc.date.accessioned | 2020-09-02T22:15:40Z | |
dc.date.available | 2020-09-02T22:15:40Z | |
dc.date.issued | 2016 | |
dc.identifier | 10.1007/978-3-319-33625-1_41 | |
dc.identifier.citation | 464, , 459-468 | |
dc.identifier.issn | 21945357 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/4150 | |
dc.description | The 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.iso | en | |
dc.publisher | Springer Verlag | |
dc.source | Silhavy R.Senkerik R.Oplatkova Z.K.Silhavy P.Prokopova Z. | |
dc.subject | Binary invasive weed | |
dc.subject | Invasive weed optimization | |
dc.subject | Metaheuristics | |
dc.subject | Set covering problem | |
dc.subject | Algorithms | |
dc.subject | Artificial intelligence | |
dc.subject | Bins | |
dc.subject | Intelligent systems | |
dc.subject | Network management | |
dc.subject | Databanks | |
dc.subject | Invasive weed | |
dc.subject | Invasive weed optimization | |
dc.subject | Mathematics formulations | |
dc.subject | Meta heuristics | |
dc.subject | Optimization algorithms | |
dc.subject | Production line | |
dc.subject | Set covering problem | |
dc.subject | Optimization | |
dc.title | A binary invasiveweed optimization algorithm for the set covering problem | |
dc.type | Conference Paper |