By Topic

Linear array synthesis using an ant-colony-optimization-based algorithm

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)
Eva Rajo-Iglesias ; Univ. Carlos III of Madrid, Madrid ; Oscar Quevedo-Teruel

The aim of this work is to show the use of a well-known type of evolutionary computational optimization technique, ant colony optimization (ACO), in a typical electromagnetic problem: linear array synthesis. To this aim, an algorithm based on the fundamentals of ant colony optimization has been developed. The algorithm uses real numbers. Some examples using different optimization criteria are presented. Also, some guidelines for the use of the algorithm, especially for creating the desirability function, are supplied. The algorithm has been demonstrated to be versatile and useful for this problem. The purpose of the work is to show (via this particular application) the flexibility and easy implementation of this algorithm family, which makes it suitable for use in other electromagnetic optimization problems.

Published in:

IEEE Antennas and Propagation Magazine  (Volume:49 ,  Issue: 2 )