Ant colony based hybrid approach for optimal compromise sum‐difference patterns synthesis

Abstract

AbstractDealing with the synthesis of monopulse array antennas, many stochastic optimization algorithms have been used for the solution of the so‐called optimal compromise problem between sum and difference patterns when sub‐arrayed feed networks are considered. More recently, hybrid approaches, exploiting the convexity of the functional with respect to a sub‐set of the unknowns (i.e., the sub‐array excitation coefficients) have demonstrated their effectiveness. In this letter, an hybrid approach based on the ant colony optimization (ACO) is proposed. At the first step, the ACO is used to define the sub‐array membership of the array elements, while, at the second step, the sub‐array weights are computed by solving a convex programming problem. © 2009 Wiley Periodicals, Inc. Microwave Opt Technol Lett 52: 128–132, 2010; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.24882