Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm
Summary: This paper uses the social-spider optimisation (SSO) algorithm to solve large-scale 0-1 knapsack problems. The SSO algorithm is based on the simulation of cooperative behaviour of social-spiders. In SSO algorithm, individuals emulate a group of spiders which interact to each other based on the biological laws of the cooperative colony. The algorithm considers two different search agents (spiders): males and females. Depending on gender, each individual is conducted by a set of different evolutionary operators which mimic different cooperative behaviour which are typically found in the colony. The experiment results show that the social-spider optimisation algorithm can be an efficient alternative for large-scale 0-1 knapsack problems.
- A kind of hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- Study of an improved hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
- Solving efficiently the 0-1 multi-objective knapsack problem
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
- A learned harmony search algorithm and its application to 0-1 knapsack problems
This page was built for publication: Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224310)
