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

A constrained multi-objective evolutionary algorithm with two-stage resources allocation

Xia, Mingming; Chong, Qing; Dong, Minggang*桂林理工大学
Swarm and Evolutionary Computation2023-6DOI: 10.1016/j.swevo.2023.101313
1被引6阅读
引用收藏
分享

摘要

The tradeoff between feasibility and optimality is critical to handling constrained multi-objective optimization problems (CMOPs). Thus, many constrained multi-objective evolutionary algorithms (CMOEAs) with multiple stages or multiple populations have been proposed in recent years. However, these algorithms are based on preference-based search, which makes the resource allocation between feasibility and optimality inflexible. This may lead to low performance, especially for CMOPs with an irregular Pareto front (PF). To alleviate this problem, we propose a novel CMOEA with two-stage resources allocation (CMOEA-TSRA), which considers fea-sibility and optimality simultaneously during the whole evolutionary process (i.e., at each stage). Specifically, it divides the evolutionary process into two stages according to the convergence degree of the population. In the first stage, it adaptively allocates fewer individuals to roughly exploit the currently discovered feasible regions and more individuals to explore the potentially optimal feasible regions. In the second stage, more individuals are allocated to further exploit the currently discovered feasible regions, while fewer individuals are allocated to continue to explore the potentially optimal feasible regions. With the help of this strategy, CMOEA-TSRA balances exploitation and exploration dynamically. In addition, most of the existing works consider the tradeoff between feasibility and optimality when evaluating individuals. However, it is not always necessary to consider the tradeoff between feasibility and optimality when evaluating individuals. Therefore, we design a new fitness assignment method based on the individual distribution in the population by utilizing the correlation between constraint violation and objective functions, which makes the more explicit evaluation preferences of individuals located in different search regions. With the help of this method, the population can easily cross the large infeasible regions. The experimental results on several widely used benchmark suites and three real-world problems demonstrate that the proposed CMOEA-TSRA is superior for handling CMOPs compared with six state-of-the-art CMOEAs.

学科与关键词

关键词
Constrained multi-objective optimizationEvolutionary algorithmConstraint handlingResources allocation
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
Swarm and Evolutionary Computation
发表日期
2023-06
卷期
第 79 卷
页码
101313
DOI
10.1016/j.swevo.2023.101313
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Foundation of China [61563012]; Guangxi Natural Science Foundation of China [2021GXNSFAA220074]; Guangxi Key Labora-tory of Embedded Technology and Intelligent System Foundation [2020-1-3]

作者

  • X

    Xia, Mingming (第一作者)

    anhui univ · guilin univ technol

  • C

    Chong, Qing

    guilin univ technol

查看全部 3 位作者收起作者
  • D

    Dong, Minggang (通讯)

    guilin univ technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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