Solving the set covering problem with binary cat swarm optimization
Advances in Swarm and Computational Intelligence: 6th International Conference …, 2015•Springer
Abstract The Set Covering Problem is a formal model for many practical optimization
problems. It consists in finding a subset of columns in a zero–one matrix such that they cover
all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a
metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a binary version
of Cat Swarm Optimization generated by observing cat behavior. Cats have two modes of
behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to …
problems. It consists in finding a subset of columns in a zero–one matrix such that they cover
all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a
metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a binary version
of Cat Swarm Optimization generated by observing cat behavior. Cats have two modes of
behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to …
Abstract
The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero–one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a binary version of Cat Swarm Optimization generated by observing cat behavior. Cats have two modes of behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to solve the Set Covering Problem, for this the proposed algorithm has been tested on 65 benchmarks instances.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果