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

A comparative study of evolutionary algorithms and particle swarm optimization approaches for constrained multi-objective optimization problems

McNulty, Alanna; Ombuki-Berman, Beatrice*; Engelbrecht, Andries
Swarm and Evolutionary Computation2024-12DOI: 10.1016/j.swevo.2024.101742
2阅读
引用收藏
分享

摘要

Many real-world optimization problems contain multiple conflicting objectives as well as additional problem constraints. These problems are referred to as constrained multi-objective optimization problems (CMOPs). Many meta-heuristics for solving CMOPs, called constrained multi-objective meta-heuristics (CMOMHs) have been introduced in the literature, including those using particle swarm optimization (PSO)(Kennedy and Eberhart, 1995), genetic algorithms (GAs)(Man et al., 1996), and differential evolution (DE)(Storn and Price, 1997). CMOMHs can be grouped into four different classes: classic CMOMHs, co-evolutionary approaches, multi-stage approaches, and multi-tasking approaches. An extensive comparative study of twenty different CMOMHs on a wide variety of test problems, including real-world CMOPs in the fields of science and engineering, is conducted. A multi-swarm PSO approach called constrained multi-guide particle swarm optimization (ConMGPSO) is introduced and compared to the best-performing previous approaches according to the comparative study. The performance of each algorithm was found to be problem dependent, however the best overall approaches were ConMGPSO, paired-offspring constrained evolutionary algorithm (POCEA)(He et al., 2021), adaptive non-dominated sorting genetic algorithm III (A-NSGA-III)(Jain and Deb, 2014), and constrained multi-objective framework using Q-learning and evolutionary multi-tasking (CMOQLMT)(Ming and Gong, 2023). ConMGPSO and POCEA had the best performance on the CF benchmark set, which contains examples of bi-objective and tri-objective CMOPs with disconnected CPOFs. The CMOQLMT approach had the best performance on the DAS-CMOP benchmark set, which contain additional difficulty in terms of feasibility-, convergence-, and diversity-hardness. For the selected real-world CMOPs, A-NSGA-III had the best performance overall. ConMGPSO was shown to have the best performance on the process, design, and synthesis problems, and had competitive performance for the power system optimization problems.

学科与关键词

关键词
Constrained multi-objective optimizationParticle swarm optimizationDifferential evolutionGenetic algorithmsReal-world problems
相关
加载中…
  • A Survey on Evolutionary Constrained Multiobjective Optimization
    Liang, Jing; Ban, Xuanxuan; Yu, Kunjie*; Qu, Boyang; Qiao, Kangjia; Yue, Caitong; Chen, Ke; Tan, Kay ChenIEEE Transactions on Evolutionary Computation, 2023, 27(2): 201-221.被引 165
  • Constrained multi-objective optimization problems: Methodologies, algorithms and applications
    Hao, Yuanyuan; Zhao, Chunliang; Zhang, Yiqin; Cao, Yuanze*; Li, Zhong*Knowledge-Based Systems, 2024, 299: 111998.被引 3
  • A Review on Constraint Handling Techniques for Population-based Algorithms: from single-objective to multi-objective optimization
    Rahimi, Iman; Gandomi, Amir H.*; Chen, Fang; Mezura-Montes, EfrenARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING, 2023, 30(3): 2181-2209.被引 45
查看全部 →

发表信息

论文状态
公开发表
期刊
Swarm and Evolutionary Computation
发表日期
2024-12
卷期
第 91 卷
页码
101742
DOI
10.1016/j.swevo.2024.101742
语言
ENGLISH
成果收录
SCIE
资助标注
Natural Sciences and Engineering Research Council of Canada (NSERC) grant

作者

  • M

    McNulty, Alanna (第一作者)

  • O

    Ombuki-Berman, Beatrice (通讯)

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

    Engelbrecht, Andries

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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