Differentiated Meta-PSO Methods for Array Optimization

The particle swarm optimization (PSO) method has been successfully applied to different electromagnetic optimization problems. Because of the complexity of this kind of problems, the associated cost function is in general computationally expensive. A fast convergence of the optimization algorithm is...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on antennas and propagation Vol. 56; no. 1; pp. 67 - 75
Main Authors Selleri, S., Mussetta, M., Pirinoli, P., Zich, R.E., Matekovits, L.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.01.2008
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN0018-926X
1558-2221
DOI10.1109/TAP.2007.912942

Cover

More Information
Summary:The particle swarm optimization (PSO) method has been successfully applied to different electromagnetic optimization problems. Because of the complexity of this kind of problems, the associated cost function is in general computationally expensive. A fast convergence of the optimization algorithm is hence required to attain results in short time. Here few variations over the standard algorithm, referred to as differentiated meta-PSO, aimed to enhance the global search capability, and to improve the algorithm convergence, are introduced. In order to verify their effectiveness the different techniques have been first applied to benchmark test functions and then used for the optimization of a planar array.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2007.912942