A binary invasiveweed optimization algorithm for the set covering problem
Abstract
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.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Conference Paper
-
Conference Paper
Cat swarm optimization with different binarization methods for solving set covering problems (2020)
(Springer Verlag, 2016) -
Conference Paper
An artificial fish swarm optimization algorithm to solve set covering problem (2020)
(Springer Verlag, 2016)