A dynamic archive based niching particle swarm optimizer using a small population size

Authors:
Zhaolin Zhai;Xiaodong Li
Affiliations:
RMIT University, Melbourne, Australia;RMIT University, Melbourne, Australia
Venue:
ACSC '11 Proceedings of the Thirty-Fourth Australasian Computer Science Conference - Volume 113
Year:
2011

Citing 5
Cited 0

A species conserving genetic algorithm for multimodal function optimization

Evolutionary Computation
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)

Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Adaptively choosing niching parameters in a PSO

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Niching without niching parameters: particle swarm optimization using a ring topology

IEEE Transactions on Evolutionary Computation
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many niching techniques have been proposed to solve multimodal optimization problems in the evolutionary computing community. However, these niching methods often depend on large population sizes to locate many more optima. This paper presents a particle swarm optimizer (PSO) niching algorithm only using a dynamic archive, without relying on a large population size to locate numerous optima. To do this, we record found optima in the dynamic archive, and allow particles in converged sub-swarms to be re-randomized to explore undiscovered parts of the search space during a run. This algorithm is compared with lbest PSOs with a ring topology (LPRT). Empirical results indicate that the proposed niching algorithm outperforms LPRT on several benchmark multimodal functions with large numbers of optima, when using a small population size.