Particle Swarm is a relatively novel approach for global stochastic optimization. In this contribution some variations over the basic algorithm are proposed, aimed at a more efficient search over the solution space obtained with a negligible overhead in both complexity and speed. The presented algorithms were previously checked on specific mathematical test function and show their superior capabilities with respect to the conventional version. Here the parametric study refers to a linear broadside array for which two different schemes are considered: position-only and position and amplitude.
META-PSO in array optimization problems / M. Mussetta; S. Selleri; P. Pirinoli; R.E. Zich; L. Matekovits. - STAMPA. - (2006), pp. 1-6. (Intervento presentato al convegno European Conference on Antennas and Propagation: EuCAP 200 tenutosi a Nice, France nel 6-10 November 2006).
META-PSO in array optimization problems
SELLERI, STEFANO;
2006
Abstract
Particle Swarm is a relatively novel approach for global stochastic optimization. In this contribution some variations over the basic algorithm are proposed, aimed at a more efficient search over the solution space obtained with a negligible overhead in both complexity and speed. The presented algorithms were previously checked on specific mathematical test function and show their superior capabilities with respect to the conventional version. Here the parametric study refers to a linear broadside array for which two different schemes are considered: position-only and position and amplitude.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
