Dynamic particle swarm optimization using a wavelet mutation strategy for composite function optimization

In this paper, a novel dynamic particle swarm optimization is considered for composite function optimization. Because the complex computation problem exists commonly in practice, solving this problem is significant. The dynamic neighborhood topology and wavelet mutation could assist the PSO algorithm cooperate with neighbor particles and overcome the premature problem. The results offer insight into how the proposed algorithm has the better effectiveness in solving composite functions.

[1]  R. Haftka,et al.  Constrained particle swarm optimization using a bi-objective formulation , 2009 .

[2]  Y. Volkan Pehlivanoglu,et al.  A New Particle Swarm Optimization Method Enhanced With a Periodic Mutation Strategy and Neural Networks , 2013, IEEE Transactions on Evolutionary Computation.

[3]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization with spatially meaningful neighbours , 2008, 2008 IEEE Swarm Intelligence Symposium.

[4]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[5]  Fei Tao,et al.  Resource Service Composition and Its Optimal-Selection Based on Particle Swarm Optimization in Manufacturing Grid System , 2008, IEEE Transactions on Industrial Informatics.

[6]  J. Kennedy,et al.  Neighborhood topologies in fully informed and best-of-neighborhood particle swarms , 2003, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[7]  Veysel Gazi,et al.  Particle swarm optimization with dynamic neighborhood topology: Three neighborhood strategies and preliminary results , 2008, 2008 IEEE Swarm Intelligence Symposium.

[8]  Jun Wang,et al.  A Dynamic Feedforward Neural Network Based on Gaussian Particle Swarm Optimization and its Application for Predictive Control , 2011, IEEE Transactions on Neural Networks.

[9]  Jing J. Liang,et al.  Dynamic Multi-Swarm Particle Swarm Optimizer with a Novel Constraint-Handling Mechanism , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[10]  James Kennedy,et al.  Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[11]  Min Han,et al.  Particle swarm optimization using dynamic neighborhood topology for large scale optimization , 2010, 2010 8th World Congress on Intelligent Control and Automation.

[12]  Luciano Lamberti,et al.  An efficient simulated annealing algorithm for design optimization of truss structures , 2008 .

[13]  N. P. Padhy,et al.  Application of particle swarm optimization technique and its variants to generation expansion planning problem , 2004 .

[14]  P. J. Angeline,et al.  Using selection to improve particle swarm optimization , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).