A swarm optimization algorithm inspired in the behavior of the social-spider
This provides a new optimization method for researchers and practitioners in computational intelligence, though it appears incremental as it builds on existing swarm intelligence models.
The authors tackled the problem of solving complex optimization tasks by proposing a novel swarm algorithm called Social Spider Optimization (SSO), which simulates the cooperative behavior of social spiders and shows high performance in finding global optima on standard benchmark functions.
Swarm intelligence is a research field that models the collective behavior in swarms of insects or animals. Several algorithms arising from such models have been proposed to solve a wide range of complex optimization problems. In this paper, a novel swarm algorithm called the Social Spider Optimization (SSO) is proposed for solving optimization tasks. The SSO algorithm is based on the simulation of cooperative behavior of social-spiders. In the proposed 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 behaviors that are typically found in the colony. In order to illustrate the proficiency and robustness of the proposed approach, it is compared to other well-known evolutionary methods. The comparison examines several standard benchmark functions that are commonly considered within the literature of evolutionary algorithms. The outcome shows a high performance of the proposed method for searching a global optimum with several benchmark functions.