Comparing strategies for search space boundaries violation in PSO

Abstract

In this paper, we choose to compare four methods for controlling particle position when it violates the search space boundaries and the impact on the performance of Particle Swarm Optimization algorithm (PSO). The methods are: hard borders, soft borders, random position and spherical universe. The goal is to compare the performance of these methods for the classical version of PSO and popular modification - the Attractive and Repulsive Particle Swarm Optimization (ARPSO). The experiments were carried out according to CEC benchmark rules and statistically evaluated.