An Improved Excitation Matching Method based on an Ant Colony Optimization for Suboptimal-Free Clustering in Sum-Difference Compromise Synthesis

Rocca, Paolo and Manica, Luca and Massa, Andrea (2009) An Improved Excitation Matching Method based on an Ant Colony Optimization for Suboptimal-Free Clustering in Sum-Difference Compromise Synthesis. [Technical Report]

Preview

PDF DISI-11-026.R171.pdf Download (634kB) | Preview

Abstract

Dealing with an excitation matching method, this paper presents a global optimization strategy for the optimal clustering in sum-difference compromise linear arrays. Starting from a combinatorial formulation of the problem at hand, the proposed technique is aimed at determining the sub-array configuration expressed as the optimal path inside a directed acyclic graph structure modelling the solution space. Towards this end, an ant colony metaheuristic is used to benefit of its hill-climbing properties in dealing with the non-convexity of the sub-arraying as well as in managing graph searches. A selected set of numerical experiments are reported to assess the efficiency and current limitations of the ant-based strategy also in comparison with previous local combinatorial search methods. (c) 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.

Actions (login required)

View Item