一种基于MOEA/D的组合权重方法
作者:
作者单位:

哈尔滨工程大学 自动化学院,哈尔滨 150001

作者简介:

通讯作者:

E-mail: ins_cheng@163.com.

中图分类号:

TP18

基金项目:

国家自然科学基金项目(61633008,61773132);黑龙江省杰出青年科学基金项目(JC2018019).


A combination weight method based on MOEA/D
Author:
Affiliation:

College of Automation,Harbin Engineering University,Harbin 150001,China

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    为了准确地求解组合权重的组合系数,将基于分解的多目标进化算法(multi-objective evolutionary algorithm based on decomposition,MOEA/D)思想引入评估领域,提出一种基于MOEA/D的组合权重方法.通常,利用加权和法将组合权重模型转化为单目标模型时,模型加权系数难以准确确定.对此,引入MOEA/D算法的分解思想,将组合权重模型转化为多个单目标子模型.MOEA/D算法仅适用于无约束优化问题,而较为常用的惩罚函数法难以表达进化初期无可行解的情况,因而提出改进自适应惩罚函数(improved adaptive penalty function,IAPF),将组合权重模型转化为无约束优化模型.应用所提出方法与其他方法进行仿真实验,实验结果表明,所提出算法具有有效性.

    Abstract:

    In order to solve the combination coefficients of combination weight accurately, the idea of the multi-objective evolutionary algorithm based on decomposition(MOEA/D) is introduced into the evaluation field, and a combination weight method based on MOEA/D is proposed. When the combination weight model is usually transformed into a single objective model by using the weighted sum method, the model weighting coefficients are difficult to determine accurately. To solve this problem, by introducing the decomposition idea of the MOEA/D algorithm, the combined weight model is transformed into multiple single objective sub-models. The MOEA/D algorithm is only suitable for unconstrained optimization problems. However, the commonly used penalty function method is difficult to express the situation where there is no feasible solution in the initial stage of evolution. An improved adaptive penalty function(IAPF) is proposed to transform the combination weight model into an unconstrained optimization model. Simulations are carried out using the proposed method and other literature methods. The results show that the proposed algorithm is effective.

    参考文献
    相似文献
    引证文献
引用本文

程建华,董铭涛,赵琳.一种基于MOEA/D的组合权重方法[J].控制与决策,2021,36(12):3056-3062

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2021-11-18
  • 出版日期: 2021-12-20