首页> 外文期刊>Antennas and Wireless Propagation Letters, IEEE >Many-Objective Optimization of Antenna Arrays Using an Improved Multiple-Single-Objective Pareto Sampling Algorithm
【24h】

Many-Objective Optimization of Antenna Arrays Using an Improved Multiple-Single-Objective Pareto Sampling Algorithm

机译:使用改进的多单目标帕累托采样算法的天线阵列多目标优化

获取原文
获取原文并翻译 | 示例
       

摘要

Pareto-based multiobjective evolutionary algorithms are recognized as the standards for solving multiobjective antenna design problems. However, when the number of objectives exceeds three, these algorithms always exhibit deficiencies in searching the Pareto front. To eliminate these deficiencies, several algorithms, such as Hyper-volume Estimation (HypE) algorithm and Multiple-Single-Objective Pareto Sampling (MSOPS) algorithm, are introduced. In this letter, an improved MSOPS algorithm is proposed. The numerical results on many-objective optimal designs of a linear antenna array and a Yagi-Uda array have demonstrated that the proposed algorithm outperforms its ancestor, NSGA II, and HypE as well.
机译:基于帕累托的多目标进化算法被认为是解决多目标天线设计问题的标准。但是,当目标数超过三个时,这些算法在搜索Pareto前沿时总是会出现缺陷。为了消除这些缺陷,引入了几种算法,例如超容量估计(HypE)算法和多单目标帕累托采样(MSOPS)算法。在这封信中,提出了一种改进的MSOPS算法。线性天线阵列和Yagi-Uda阵列的多目标优化设计的数值结果表明,该算法优于其祖先,NSGA II和HypE。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号