ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Multi-objective decomposition evolutionary algorithm with objective modification-based dominance and external archive

Wang, Zhenkun*; Li, Qingyan; Li, Genghui; Zhang, Qingfu
APPLIED SOFT COMPUTING2023-12DOI: 10.1016/j.asoc.2023.111006
24阅读
引用收藏
分享

摘要

In practice, the multi-objective optimization problem (MOP) is typically challenging in two aspects. On the one hand, its Pareto front has imbalanced search difficulties; on the other hand, its search space contains many dominance resistant solutions (DRSs). Decomposing a complicated MOP into several simple MOPs for collaborative optimization (M2M) has been acknowledged to be efficient in coping with the imbalanced search difficulty. Nevertheless, the convergence efficiency of the M2M-based multi-objective evolutionary algorithm (MOEA) is rarely investigated, especially on the MOP with DRSs. This paper reveals two convergence challenges faced by M2M-based MOEAs. Subsequently, a variant called MOEA/D-OMDEA is proposed to achieve better convergence efficiency without sacrificing advantages in diversity preservation. MOEA/D-OMDEA integrates a new relaxed dominance criterion, namely the OM-dominance criterion, into its environmental selection to alleviate the negative influence of inferior solutions (e.g., DRSs) as well as to better balance convergence and diversity. MOEA/D-OMDEA is compared with ten state-of-the-art MOEAs on two sets of MOP benchmarks with different characteristics and a real-world problem. Experimental results indicate that MOEA/D-OMDEA can significantly outperform the other ten competitors on these problems. In addition, this paper provides a thorough analysis of the effectiveness of each new algorithmic component and the sensitivity of each newly-introduced parameter.

学科与关键词

关键词
Multi-objective decomposition evolutionaryalgorithmMOP with different search difficultiesExternal archiveObjective modification-based dominance
相关
加载中…
  • Decomposition of a Multiobjective Optimization Problem into a Number of Simple Multiobjective Subproblems
    Liu Hai Lin*; Gu Fangqing; Zhang QingfuIEEE Transactions on Evolutionary Computation, 2014, 18(3): 450-455.被引 31
  • Multi-Objective Evolutionary Algorithm Based on Decomposition With Orthogonal Experimental Design
    He, Maowei; Wang, Zhixue; Chen, Hanning; Cao, Yang*; Ma, LianboEXPERT SYSTEMS, 2025, 42(2).
  • Adaptively weighted decomposition based multi-objective evolutionary algorithm
    Meghwani, Suraj S.*; Thakur, ManojApplied Intelligence, 2021, 51(6): 3801-3823.被引 9
查看全部 →

发表信息

论文状态
公开发表
期刊
APPLIED SOFT COMPUTING
发表日期
2023-12
卷期
第 149 卷
页码
111006
DOI
10.1016/j.asoc.2023.111006
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Foundation of China [62106096, 62206120, 62276223]; Shenzhen Technology Plan [JCYJ202205301130130311]; Research Grants Council of the Hong Kong Special Administrative Region [U 11215622]

作者

  • W

    Wang, Zhenkun (通讯) (第一作者)

  • L

    Li, Qingyan

查看全部 4 位作者收起作者
  • L

    Li, Genghui

  • Z

    Zhang, Qingfu

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417