NEFeb 9, 2015

A Social Spider Algorithm for Global Optimization

arXiv:1502.02407v1394 citations
Originality Incremental advance
AI Analysis

This provides a new nature-inspired optimization method for solving complex real-world problems, though it appears incremental as it builds on existing swarm intelligence approaches.

The authors tackled global optimization problems by proposing a novel Social Spider Algorithm inspired by social spiders' foraging strategies, which demonstrated superior performance on benchmark functions compared to state-of-the-art metaheuristics.

The growing complexity of real-world problems has motivated computer scientists to search for efficient problem-solving methods. Metaheuristics based on evolutionary computation and swarm intelligence are outstanding examples of nature-inspired solution techniques. Inspired by the social spiders, we propose a novel Social Spider Algorithm to solve global optimization problems. This algorithm is mainly based on the foraging strategy of social spiders, utilizing the vibrations on the spider web to determine the positions of preys. Different from the previously proposed swarm intelligence algorithms, we introduce a new social animal foraging strategy model to solve optimization problems. In addition, we perform preliminary parameter sensitivity analysis for our proposed algorithm, developing guidelines for choosing the parameter values. The Social Spider Algorithm is evaluated by a series of widely-used benchmark functions, and our proposed algorithm has superior performance compared with other state-of-the-art metaheuristics.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes