Carlos M. Fernandes
Nuno Fachada
ABSTRACT
We investigate the convergence speed, accuracy, robustness and scalability of PSOs structured by regular and random graphs with 3 ≤ k ≤ n. The main conclusion is that regular and random graphs with the same averaged connectivity k may result in significantly different performance, namely when k is low.
- Kennedy, J., Eberhart, R. 1995. Particle Swarm Optimization. In Proceedings of IEEE International Conference on Neural Networks, Vol.4, 1942--1948.Google Scholar
Cross Ref
- Kennedy, J., Mendes, R. 2002. Population structure and particle swarm performance. In Proceedings of the IEEE World Congress on Evolutionary Computation, 1671--1676. Google ScholarDigital Library
- Parsopoulos, K.E., Vrahatis, M.N. 2005. Unified Particle Swarm Optimization in Dynamic Environments. Lecture Notes in Computer Science, Vol. 3449, Springer, 590--599. Google ScholarDigital Library
- Particle swarm and population structure
Recommendations
An improved cooperative quantum-behaved particle swarm optimization
Particle swarm optimization (PSO) is a population-based stochastic optimization. Its parameters are easy to control, and it operates easily. But, the particle swarm optimization is a local convergence algorithm. Quantum-behaved particle swarm ...
Cellular particle swarm optimization
This paper proposes a cellular particle swarm optimization (CPSO), hybridizing cellular automata (CA) and particle swarm optimization (PSO) for function optimization. In the proposed CPSO, a mechanism of CA is integrated in the velocity update to modify ...
Center particle swarm optimization
Center particle swarm optimization algorithm (CenterPSO) is proposed where a center particle is incorporated into linearly decreasing weight particle swarm optimization (LDWPSO). Unlike other ordinary particles in LDWPSO, the center particle has no ...
Comments