Abstract
Due to the high requirements for performance of antennas in the modern communication system, more and more objectives need to be considered, which makes the antenna design unendurable time-consuming and hard to converge. To obtain the Pareto solutions for antenna design effectively and efficiently, a dual reduction method is incorporated in an improved multi-objective evolutionary algorithm based on decomposition (MOEA/D). To obtain information about conflicting objectives on the Pareto front, the size of the MOEA/D neighbourhood is dynamically adjusted; to improve the speed and accuracy of finding redundant objectives, PCA and Pareto impact ratio are used as dual objective-reduction criteria. Numerical results in solving the mathematical benchmark problems, an antenna array problem and Yagi-uda optimal design demonstrate that the proposed method can reduce redundant objectives and increase the convergence speed.
Get full access to this article
View all access options for this article.
