A constrained multi-objective evolutionary algorithm based on online problem identification and separate handling

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xinyu Zhou , Long Fan , Kunjie Yu , Kangjia Qiao
{"title":"A constrained multi-objective evolutionary algorithm based on online problem identification and separate handling","authors":"Xinyu Zhou ,&nbsp;Long Fan ,&nbsp;Kunjie Yu ,&nbsp;Kangjia Qiao","doi":"10.1016/j.swevo.2025.102017","DOIUrl":null,"url":null,"abstract":"<div><div>Solving constrained multi-objective optimization problems (CMOPs) is challenging because it requires optimizing multiple conflicting objectives and satisfying constraints simultaneously. In recent years, to better handle CMOPs, constrained multi-objective evolutionary algorithms (CMOEAs) based on the strategy of identifying problem types have been proposed. However, their performance remains limited due to low identification accuracy and inefficient constraint-handling techniques. In this work, a CMOEA based on online problem identification and separate handling, named CMOEA-IH, is proposed. First, to improve the accuracy of problem identification, an online problem identification strategy is proposed to identify the problem type during the entire evolution process. Second, based on the identified type, different constraint-handling techniques are employed by simultaneously considering the information from the unconstrained Pareto front and the Pareto front of single constraints. Finally, experimental results on 5 test suites and 3 real-world problems demonstrate that our proposed algorithm is more competitive in comparison with 10 state-of-the-art CMOEAs.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 102017"},"PeriodicalIF":8.5000,"publicationDate":"2025-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225001750","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

Solving constrained multi-objective optimization problems (CMOPs) is challenging because it requires optimizing multiple conflicting objectives and satisfying constraints simultaneously. In recent years, to better handle CMOPs, constrained multi-objective evolutionary algorithms (CMOEAs) based on the strategy of identifying problem types have been proposed. However, their performance remains limited due to low identification accuracy and inefficient constraint-handling techniques. In this work, a CMOEA based on online problem identification and separate handling, named CMOEA-IH, is proposed. First, to improve the accuracy of problem identification, an online problem identification strategy is proposed to identify the problem type during the entire evolution process. Second, based on the identified type, different constraint-handling techniques are employed by simultaneously considering the information from the unconstrained Pareto front and the Pareto front of single constraints. Finally, experimental results on 5 test suites and 3 real-world problems demonstrate that our proposed algorithm is more competitive in comparison with 10 state-of-the-art CMOEAs.
基于在线问题识别和分离处理的约束多目标进化算法
求解约束多目标优化问题是一个具有挑战性的问题,因为它需要同时优化多个相互冲突的目标并满足约束条件。近年来,为了更好地处理cmoops问题,提出了基于问题类型识别策略的约束多目标进化算法(cmoea)。然而,由于识别精度低和约束处理技术效率低下,它们的性能仍然受到限制。本文提出了一种基于在线问题识别和分离处理的CMOEA,命名为CMOEA- ih。首先,为了提高问题识别的准确性,提出了一种在线问题识别策略,用于识别整个进化过程中的问题类型。其次,根据所识别的约束类型,同时考虑来自无约束Pareto前沿和单一约束Pareto前沿的信息,采用不同的约束处理技术;最后,在5个测试套件和3个实际问题上的实验结果表明,与10个最先进的cmoea相比,我们提出的算法更具竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信