PSSA: Polar Coordinate Salp Swarm Algorithm for Curve Design Problems

Abstract

This paper proposes a modified optimization algorithm called polar coordinate salp swarm algorithm (PSSA). The main inspiration of PSSA is the aggregation chain and foraging trajectory of salp is spiral. Some curves are extremely complex when represented in Cartesian coordinate system, but if they are expressed in polar coordinates, it becomes very simple and easy to handle, and polar coordinates are widely used in scientific computing and engineering issues. It will be more intuitive and convenient if use polar coordinates to define the foraging and aggregation process of salps. At the same time, different from other algorithms proposed in the past, the PSSA directly initialize individuals in polar space instead of using mapping functions to convert to polar coordinates, change the position of particles by updating polar angles and polar diameters. This algorithm is tested on two complex polar coordinate equations, several curve approximation problems and engineering design problems using PSSA. The experimental results illustrated that the proposed PSSA algorithm is superior to the state-of-the-art metaheuristic algorithms in terms of the performance measures.