Applying Self-Organised Criticality to Evolutionary Algorithms
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Extending particle swarm optimisers with self-organized criticality
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
A self-organizing random immigrants genetic algorithm for dynamic optimization problems
Genetic Programming and Evolvable Machines
A self-organized criticality mutation operator for dynamic optimization problems
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Inertia-Adaptive Particle Swarm Optimizer for Improved Global Search
ISDA '08 Proceedings of the 2008 Eighth International Conference on Intelligent Systems Design and Applications - Volume 02
Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
This paper investigates a Particle Swarm Optimization (PSO) with a Self-Organized Criticality (SOC) strategy that controls the parameter values and perturbs the position of the particles. The algorithm uses a SOC system known as Bak-Sneppen for establishing the inertia weight and acceleration coefficients for each particle in each time-step. Besides adjusting the parameters, the SOC model may be also used to perturb the particles' positions, thus increasing exploration and preventing premature convergence. The implementation of both schemes is straightforward and does not require hand-tuning. An empirical study compares the Bak-Sneppen PSO (BS-PSO) with other PSOs, including a state-of-the-art algorithm with dynamic variation of the weight and perturbation of the particles. The results demonstrate the validity of the algorithm.