A binary invasiveweed optimization algorithm for the set covering problem
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
A discrete invasive weed optimization algorithm for the set covering problem [Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem] (2020) Crawford B.; Soto R.; Legue I.F.; Olguin E. (IEEE Computer Society, 2016)
Cat swarm optimization with different binarization methods for solving set covering problems (2020) Crawford B.; Soto R.; Berrios N.; Olguín E. (Springer Verlag, 2016)
Conference PaperCrawford B.; Soto R.; Olguín E.; Villablanca S.M.; Rubio Á.G.; Jaramillo A.; Salas J. (Springer Verlag, 2016)