The particle swarm optimization algorithm: convergence analysis and parameter selection
Information Processing Letters
A study of particle swarm optimization particle trajectories
Information Sciences: an International Journal
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
Stability analysis of the particle dynamics in particle swarm optimizer
IEEE Transactions on Evolutionary Computation
Particle swarm optimization in high dimensional spaces
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
A simple way for parameter selection of standard particle swarm optimization
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part III
Information Sciences: an International Journal
Posterior Sampling using Particle Swarm Optimizers and Model Reduction Techniques
International Journal of Applied Evolutionary Computation
On the non linear dynamics of the global best particle in particle swarm optimization
SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Particle swarm optimisation: time for uniformisation
International Journal of Computing Science and Mathematics
Review: A parameter selection strategy for particle swarm optimization based on particle positions
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
A generalized form of the particle swarm optimization (PSO) algorithm is presented. Generalized PSO (GPSO) is derived from a continuous version of PSO adopting a time step different than the unit. Generalized continuous particle swarm optimizations are compared in terms of attenuation and oscillation. The deterministic and stochastic stability regions and their respective asymptotic velocities of convergence are analyzed as a function of the time step and the GPSO parameters. The sampling distribution of the GPSO algorithm helps to study the effect of stochasticity on the stability of trajectories. The stability regions for the second-, third-, and fourth-order moments depend on inertia, local, and global accelerations and the time step and are inside of the deterministic stability region for the same time step. We prove that stability regions are the same under stagnation and with a moving center of attraction. Properties of the second-order moments variance and covariance serve to propose some promising parameter sets. High variance and temporal uncorrelation improve the exploration task while solving ill-posed inverse problems. Finally, a comparison is made between PSO and GPSO bymeans of numerical experiments using well-known benchmark functions with two types of ill-posedness commonly found in inverse problems: the Rosenbrock and the "elongated" DeJong functions (global minimum located in a very flat area), and the Griewank function (global minimum surrounded by multiple minima). Numerical simulations support the results provided by theoretical analysis. Based on these results, two variants of Generalized PSO algorithm are proposed, improving the convergence and the exploration task while solving real applications of inverse problems.