暂无分享,去创建一个
A particle swarm optimizer (PSO) loosely based on the phenomena of crystallization and a chaos factor which follows the complimentary error function is described. The method features three phases: diffusion, directed motion, and nucleation. During the diffusion phase random walk is the only contributor to particle motion. As the algorithm progresses the contribution from chaos decreases and movement toward global best locations is pursued until convergence has occurred. The algorithm was found to be more robust to local minima in multimodal test functions than a standard PSO algorithm and is designed for problems which feature experimental precision.
[1] Mauricio Zambrano-Bigiarini,et al. Standard Particle Swarm Optimisation 2011 at CEC-2013: A baseline for future PSO improvements , 2013, 2013 IEEE Congress on Evolutionary Computation.
[2] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.
[3] Alan F. Murray,et al. IEEE International Conference on Neural Networks , 1997 .
[4] Karl S. Booksh,et al. Optimized Spatial Partitioning via Minimal Swarm Intelligence , 2017, ArXiv.