Two cooperative constraint handling techniques with an external archive for constrained multi-objective optimization

IF 3.3 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jianlin Zhang, Jie Cao, Fuqing Zhao, Zuohan Chen
{"title":"Two cooperative constraint handling techniques with an external archive for constrained multi-objective optimization","authors":"Jianlin Zhang, Jie Cao, Fuqing Zhao, Zuohan Chen","doi":"10.1007/s12293-024-00409-3","DOIUrl":null,"url":null,"abstract":"<p>Constrained multi-objective problems are difficult for researchers to solve because they contain infeasible regions. To address this issue, this paper proposes two cooperative constraint handling techniques that use an external archive. First, two constraint handling techniques, i.e., the penalty function and the constrained dominance principle, are embedded in multi-objective optimization algorithms and work cooperatively on two populations to increase population diversity. Then, an external archive is designed to preserve high-quality solutions that strike a good balance between objectives, values, and constraints throughout the evolution process. Finally, comprehensive experiments are conducted to validate the performance of the proposed algorithm, and seven state-of-the-art constrained multi-objective optimization algorithms are used to compare three test suites and ten real-world problems. The experimental results demonstrate that the proposed algorithm can achieve competitive performance in solving various constrained multi-objective problems. Additionally, the results show that cooperative constraint handling techniques are more robust than single constraint handling methods.</p>","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":"82 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Memetic Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12293-024-00409-3","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Constrained multi-objective problems are difficult for researchers to solve because they contain infeasible regions. To address this issue, this paper proposes two cooperative constraint handling techniques that use an external archive. First, two constraint handling techniques, i.e., the penalty function and the constrained dominance principle, are embedded in multi-objective optimization algorithms and work cooperatively on two populations to increase population diversity. Then, an external archive is designed to preserve high-quality solutions that strike a good balance between objectives, values, and constraints throughout the evolution process. Finally, comprehensive experiments are conducted to validate the performance of the proposed algorithm, and seven state-of-the-art constrained multi-objective optimization algorithms are used to compare three test suites and ten real-world problems. The experimental results demonstrate that the proposed algorithm can achieve competitive performance in solving various constrained multi-objective problems. Additionally, the results show that cooperative constraint handling techniques are more robust than single constraint handling methods.

Abstract Image

带外部档案的两种合作约束处理技术,用于约束多目标优化
对于研究人员来说,受约束的多目标问题很难解决,因为它们包含不可行区域。为解决这一问题,本文提出了两种使用外部档案的合作约束处理技术。首先,在多目标优化算法中嵌入了两种约束处理技术,即惩罚函数和约束支配原理,并在两个种群上协同工作,以增加种群多样性。然后,设计了一个外部存档,以在整个进化过程中保存目标、值和约束之间取得良好平衡的高质量解决方案。最后,为了验证所提算法的性能,我们进行了全面的实验,并使用七种最先进的约束多目标优化算法对三个测试套件和十个实际问题进行了比较。实验结果表明,所提出的算法在解决各种约束多目标问题时都能取得具有竞争力的性能。此外,实验结果还表明,合作约束处理技术比单一约束处理方法更具鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Memetic Computing
Memetic Computing COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-OPERATIONS RESEARCH & MANAGEMENT SCIENCE
CiteScore
6.80
自引率
12.80%
发文量
31
期刊介绍: Memes have been defined as basic units of transferrable information that reside in the brain and are propagated across populations through the process of imitation. From an algorithmic point of view, memes have come to be regarded as building-blocks of prior knowledge, expressed in arbitrary computational representations (e.g., local search heuristics, fuzzy rules, neural models, etc.), that have been acquired through experience by a human or machine, and can be imitated (i.e., reused) across problems. The Memetic Computing journal welcomes papers incorporating the aforementioned socio-cultural notion of memes into artificial systems, with particular emphasis on enhancing the efficacy of computational and artificial intelligence techniques for search, optimization, and machine learning through explicit prior knowledge incorporation. The goal of the journal is to thus be an outlet for high quality theoretical and applied research on hybrid, knowledge-driven computational approaches that may be characterized under any of the following categories of memetics: Type 1: General-purpose algorithms integrated with human-crafted heuristics that capture some form of prior domain knowledge; e.g., traditional memetic algorithms hybridizing evolutionary global search with a problem-specific local search. Type 2: Algorithms with the ability to automatically select, adapt, and reuse the most appropriate heuristics from a diverse pool of available choices; e.g., learning a mapping between global search operators and multiple local search schemes, given an optimization problem at hand. Type 3: Algorithms that autonomously learn with experience, adaptively reusing data and/or machine learning models drawn from related problems as prior knowledge in new target tasks of interest; examples include, but are not limited to, transfer learning and optimization, multi-task learning and optimization, or any other multi-X evolutionary learning and optimization methodologies.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信