...
首页> 外文期刊>IEEE Transactions on Magnetics >Multiobjective Memetic Algorithms With Quadratic Approximation-Based Local Search for Expensive Optimization in Electromagnetics
【24h】

Multiobjective Memetic Algorithms With Quadratic Approximation-Based Local Search for Expensive Optimization in Electromagnetics

机译:基于二次近似局部搜索的多目标模因算法在电磁学中的成本优化

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

摘要

We describe a local search procedure for multiobjective genetic algorithms that employs quadratic approximations for all nonlinear functions involved in the optimization problem. The samples obtained by the algorithm during the evolutionary process are used to fit these quadratic approximations in the neighborhood of the point selected for local search, implying that no extra cost of function evaluations is required. After that, a locally improved solution is easily estimated from the associated quadratic problem. We demonstrate the hybridization of our procedure with the well-known multiobjective genetic algorithm. This methodology can also be coupled with other multiobjective evolutionary algorithms. The results show that the proposed procedure is suitable for time-demanding black-box optimization problems.
机译:我们描述了一种多目标遗传算法的局部搜索过程,该过程对优化问题中涉及的所有非线性函数采用二次逼近。该算法在进化过程中获得的样本用于在为本地搜索选择的点的附近拟合这些二次近似值,这意味着不需要额外的功能评估成本。之后,可以根据相关的二次问题轻松估算出局部改进的解决方案。我们证明了我们的程序与著名的多目标遗传算法的杂交。该方法还可以与其他多目标进化算法结合使用。结果表明,所提出的方法适用于时间要求严格的黑盒优化问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号