首页> 外文OA文献 >A Many-Objective Optimization Algorithm Based on Weight Vector Adjustment
【2h】

A Many-Objective Optimization Algorithm Based on Weight Vector Adjustment

机译:一种基于重量向量调整的多目标优化算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In order to improve the convergence and distribution of a many-objective evolutionary algorithm, this paper proposes an improved NSGA-III algorithm based on weight vector adjustment (called NSGA-III-WA). First, an adaptive weight vector adjustment strategy is proposed to decompose the objective space into several subspaces. According to different subspace densities, the weight vector is sparse or densely adjusted to ensure the uniformity of the weight vector distribution on the Pareto front surface. Secondly, the evolutionary model that combines the new differential evolution strategy and genetic evolution strategy is proposed to generate new individuals and enhance the exploration ability of the weight vector in each subspace. The proposed algorithm is tested on the optimization problem of 3–15 objectives on the DTLZ standard test set and WFG test instances, and it is compared with the five algorithms with better effect. In this paper, the Whitney–Wilcoxon rank-sum test is used to test the significance of the algorithm. The experimental results show that NSGA-III-WA has a good effect in terms of convergence and distribution.
机译:为了提高一个多目标进化算法的收敛和分布,这提出了一种基于权重向量调整(称为NSGA-III-WA)的改进的NSGA-III算法。首先,自适应权重向量调整策略,提出了分解目标空间分成几个子空间。根据不同的子空间密度下,权重向量是稀疏或密集地调整,以确保帕累托前表面上的权重向量分布的均匀性。其次,结合新的差分进化策略和遗传进​​化策略进化模型,用于产生新的个人和加强每个子空间的权重向量的探索能力。该算法是在对DTLZ标准测试组和WFG测试实例3-15目标优化问题进行测试,它是用效果更佳五个算法进行比较。在本文中,惠特尼 - Wilcoxon秩和检验是用来测试算法的意义。实验结果表明,NSGA-III-WA在收敛和分配方面具有良好的效果。

著录项

  • 作者

    Yanjiao Wang; Xiaonan Sun;

  • 作者单位
  • 年度 2018
  • 总页数
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号