By Topic

A comparison of particle swarm optimization and genetic algorithms for a phased array synthesis problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Boeringer, D.W. ; Dept. of Electr. Eng., Pennsylvania State Univ., University Park, PA, USA ; Werner, D.H.

Particle swarm optimization is a recently invented high-performance optimizer that possesses several highly desirable attributes, including the fact that the basic algorithm is very easy to understand and implement. It is similar in some ways to genetic algorithms or evolutionary algorithms, but generally requires only a few lines of code. A particle swarm optimizer is implemented and compared to a genetic algorithm for phased array synthesis of a far field sidelobe notch, using amplitude-only, phase-only, and complex tapering. The results show that particle swarm optimization performs better in some cases while genetic algorithms perform better in others, which implies that the two methods traverse the problem hyperspace differently. Although simple, the particle swarm optimizer shows good possibilities for electromagnetic optimization.

Published in:

Antennas and Propagation Society International Symposium, 2003. IEEE  (Volume:1 )

Date of Conference:

22-27 June 2003