Abstract
Particle swarm optimization (PSO) is a swarm intelligence algorithm, has been successfully applied to many engineering optimization problems and shown its high search speed in these applications. However, as the dimension and the number of local optima of optimization problems increase, PSO and most existing improved PSO algorithms such as, the standard particle swarm optimization (SPSO) and the Gaussian particle swarm optimization (GPSO), are easily trapped in local optima. In this paper we proposed a novel algorithm based on SPSO called Euclidean particle swarm optimization (EPSO) which has greatly improved the ability of escaping from local optima. To confirm the effectiveness of EPSO, we have employed five benchmark functions to examine it, and compared it with SPSO and GPSO. The experiments results showed that EPSO is significantly better than SPSO and GPSO, especially obvious in higher-dimension problems.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call