Evolutionary Alternating Direction Method of Multipliers for Constrained Multiobjective Optimization With Unknown Constraints

IF 11.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE Transactions on Evolutionary Computation Pub Date : 2024-07-09 DOI:10.1109/TEVC.2024.3425629
Shuang Li;Ke Li;Wei Li;Ming Yang
{"title":"Evolutionary Alternating Direction Method of Multipliers for Constrained Multiobjective Optimization With Unknown Constraints","authors":"Shuang Li;Ke Li;Wei Li;Ming Yang","doi":"10.1109/TEVC.2024.3425629","DOIUrl":null,"url":null,"abstract":"Constrained multiobjective optimization problems (CMOPs) pervade real-world applications in science, engineering, and design. Constraint violation (CV) has been a building block in designing evolutionary multiobjective optimization (EMO) algorithms for solving CMOPs. However, in certain scenarios, constraint functions might be unknown or inadequately defined, making CV unattainable and potentially misleading for the conventional constrained EMO algorithms. To address this issue, we present the first of its kind evolutionary optimization framework, inspired by the principles of the alternating direction method of multipliers that decouples objective and constraint functions. This framework tackles CMOPs with unknown constraints by reformulating the original problem into an additive form of two subproblems, each of which is allotted a dedicated evolutionary population. Notably, these two populations operate toward complementary evolutionary directions during their optimization processes. In order to minimize discrepancy, their evolutionary directions alternate, aiding the discovery of feasible solutions. Comparative experiments conducted against the five state-of-the-art constrained EMO algorithms on 120 benchmark test problem instances with varying properties as well as two real-world engineering optimization problems demonstrate the effectiveness and superiority of our proposed framework. Its salient features include faster convergence and enhanced resilience to various Pareto front shapes.","PeriodicalId":13206,"journal":{"name":"IEEE Transactions on Evolutionary Computation","volume":"29 4","pages":"1419-1433"},"PeriodicalIF":11.7000,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10589587/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Constrained multiobjective optimization problems (CMOPs) pervade real-world applications in science, engineering, and design. Constraint violation (CV) has been a building block in designing evolutionary multiobjective optimization (EMO) algorithms for solving CMOPs. However, in certain scenarios, constraint functions might be unknown or inadequately defined, making CV unattainable and potentially misleading for the conventional constrained EMO algorithms. To address this issue, we present the first of its kind evolutionary optimization framework, inspired by the principles of the alternating direction method of multipliers that decouples objective and constraint functions. This framework tackles CMOPs with unknown constraints by reformulating the original problem into an additive form of two subproblems, each of which is allotted a dedicated evolutionary population. Notably, these two populations operate toward complementary evolutionary directions during their optimization processes. In order to minimize discrepancy, their evolutionary directions alternate, aiding the discovery of feasible solutions. Comparative experiments conducted against the five state-of-the-art constrained EMO algorithms on 120 benchmark test problem instances with varying properties as well as two real-world engineering optimization problems demonstrate the effectiveness and superiority of our proposed framework. Its salient features include faster convergence and enhanced resilience to various Pareto front shapes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于具有未知约束条件的受约束多目标优化的乘数进化交替方向法
约束多目标优化问题(cops)广泛应用于科学、工程和设计领域。约束违反(CV)是求解cmp问题的进化多目标优化(EMO)算法设计的基础。然而,在某些情况下,约束函数可能是未知的或定义不充分的,使得CV无法实现,并可能误导传统的约束EMO算法。为了解决这个问题,我们提出了同类中的第一个进化优化框架,其灵感来自于将目标函数和约束函数解耦的乘数交替方向方法的原理。该框架通过将原始问题重新表述为两个子问题的相加形式来处理具有未知约束的cops,每个子问题分配一个专用的进化种群。值得注意的是,这两个种群在优化过程中朝着互补的进化方向运行。为了使差异最小化,它们的进化方向交替,有助于发现可行的解决方案。在120个具有不同性质的基准测试问题实例以及两个实际工程优化问题上,对五种最先进的约束EMO算法进行了对比实验,证明了我们提出的框架的有效性和优越性。其显著特点包括更快的收敛速度和对各种帕累托前形状的增强弹性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation 工程技术-计算机:理论方法
CiteScore
21.90
自引率
9.80%
发文量
196
审稿时长
3.6 months
期刊介绍: The IEEE Transactions on Evolutionary Computation is published by the IEEE Computational Intelligence Society on behalf of 13 societies: Circuits and Systems; Computer; Control Systems; Engineering in Medicine and Biology; Industrial Electronics; Industry Applications; Lasers and Electro-Optics; Oceanic Engineering; Power Engineering; Robotics and Automation; Signal Processing; Social Implications of Technology; and Systems, Man, and Cybernetics. The journal publishes original papers in evolutionary computation and related areas such as nature-inspired algorithms, population-based methods, optimization, and hybrid systems. It welcomes both purely theoretical papers and application papers that provide general insights into these areas of computation.
期刊最新文献
Fourier Transform-based instance decomposition for k -adic Assignment Problems Experience Evolution-Guided Multi-Objective Reinforcement Learning A Fast Dominance Move Calculation Using Mixed-Integer Programming for Many-objective Optimization FDDEDO: A Novel Federated Data-Driven Evolutionary Dynamic Optimization Framework Population Diversity Dynamics Analysis for Imbalanced Multi-objective Optimization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1