Particle Swarm Optimizers with Growing Tree Topology

摘要

This paper presents a new particle swarm optimizer characterized by growing tree topology. If a particle is stagnated then a new particle is born and is located away from the trap. Depending on the property of objective problems, particles are born successively and the growing swarm constitutes a tree-topology. Performing numerical experiments for typical benchmarks, the algorithm efficiency is evaluated in several key measures such as success rate, the number of iterations and the number of particles. As compared with other basic PSOs, we can suggest that the proposed algorithm has efficient performance in optimization with low-cost computation.