Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm

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.