Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space

05/25/2005
by   Wen-Jun Zhang, et al.
0

The periodic mode is analyzed together with two conventional boundary handling modes for particle swarm. By providing an infinite space that comprises periodic copies of original search space, it avoids possible disorganizing of particle swarm that is induced by the undesired mutations at the boundary. The results on benchmark functions show that particle swarm with periodic mode is capable of improving the search performance significantly, by compared with that of conventional modes and other algorithms.

READ FULL TEXT
research
08/07/2013

A Multi-Swarm Cellular PSO based on Clonal Selection Algorithm in Dynamic Environments

Many real-world problems are dynamic optimization problems. In this case...
research
02/08/2005

Particle Swarm Optimization: An efficient method for tracing periodic orbits in 3D galactic potentials

We propose the Particle Swarm Optimization (PSO) as an alternative metho...
research
05/25/2005

Handling equality constraints by adaptive relaxing rule for swarm algorithms

The adaptive constraints relaxing rule for swarm algorithms to handle wi...
research
06/28/2023

A `periodic table' of modes and maximum a posteriori estimators

The last decade has seen many attempts to generalise the definition of m...
research
07/22/2019

A Simple Yet Effective Approach to Robust Optimization Over Time

Robust optimization over time (ROOT) refers to an optimization problem w...
research
08/09/2023

Analyzing and controlling diversity in quantum-behaved particle swarm optimization

This paper addresses the issues of controlling and analyzing the populat...
research
10/12/2009

Finite element model selection using Particle Swarm Optimization

This paper proposes the application of particle swarm optimization (PSO)...

Please sign up or login with your details

Forgot password? Click here to reset