首页> 外文会议>International Conference on Semantics, Knowledge and Grids >An Improved Decomposition Multiobjective Optimization Algorithm with Weight Vector Adaptation Strategy
【24h】

An Improved Decomposition Multiobjective Optimization Algorithm with Weight Vector Adaptation Strategy

机译:加权矢量自适应策略的改进分解多目标优化算法

获取原文

摘要

Multiobjective evolutionary algorithms based on decomposition (MOEA/D) decomposes a multiobjective optimization problem (MOP) into a number of scalar optimization subproblems, and solves each subproblem in a collaborative manner. For a MOP, different subproblems often have different difficulty to be approximated, especially when the MOP is extremely complex or has a discontinuous optimal front. This paper proposes a weight vector adaptation strategy for this issue, which changes the weight vectors and optimizes their computational resource allocation to fit the MOP. The experimental results on a variety of MOP test instances show that the proposed algorithm is competitive in comparison with three state-of-the-art decomposition multiobjective evolutionary algorithms.
机译:基于分解的多目标进化算法(MOEA / D)将多目标优化问题(MOP)分解为多个标量优化子问题,并以协作的方式解决了每个子问题。对于MOP,不同的子问题通常具有不同的近似难度,尤其是当MOP非常复杂或具有不连续的最优前沿时。针对此问题,本文提出了一种权重向量自适应策略,该策略可以改变权重向量并优化其计算资源分配以适合MOP。在各种MOP测试实例上的实验结果表明,与三种最新的分解多目标进化算法相比,该算法具有竞争优势。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号