Particle swarm optimization with Gaussian mutation 论文

摘要

In this paper we present particle swarm optimization with Gaussian mutation combining the idea of the particle swarm with concepts from evolutionary algorithms. This method combines the traditional velocity and position update rules with the ideas of Gaussian mutation. This model is tested and compared with the standard PSO and standard GA. The comparative experiments have been conducted on unimodal functions and multimodal functions. PSO with Gaussian mutation is able to obtain a result superior to GA. We also apply the PSO with Gaussian mutation to a gene network. Consequently, it has succeeded in acquiring better results than those by GA and PSO alone.