Constraint landscape knowledge assisted constrained multiobjective optimization

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yuhang Ma , Bo Shen , Anqi Pan , Jiankai Xue
{"title":"Constraint landscape knowledge assisted constrained multiobjective optimization","authors":"Yuhang Ma ,&nbsp;Bo Shen ,&nbsp;Anqi Pan ,&nbsp;Jiankai Xue","doi":"10.1016/j.swevo.2024.101685","DOIUrl":null,"url":null,"abstract":"<div><p>When evolutionary algorithms are employed to tackle constrained multiobjective optimization problems (CMOPs), constraint handling techniques (CHTs) play a pivotal role. To date, several CHTs have been designed, but they are only effective for certain types of constraint landscapes. For CMOPs with unknown properties, their optimization performance and efficiency remain uncertain. To tackle this issue, we attempt to mine and utilize the knowledge of constraint landscape to solve CMOPs. Specifically, the evolutionary process can be divided into three stages: learning stage, classification stage, and evolving stage. During the learning stage, the two populations, namely <em>mainPop</em> and <em>auxPop</em>, cooperatively evolve with and without considering constraints, respectively. The <em>mainPop</em> can locate the feasible regions, while the <em>auxPop</em> is employed to evaluate the size of the feasible regions. Subsequently, in the classification stage, based on the learned landscape knowledge, the category of problem can be determined: CMOP with small feasible regions or CMOP with large feasible regions. Then, in the evolving stage, for CMOPs with small feasible regions, CHTI, which includes a population exchange method and a feasible regions relaxation method, is proposed, while for CMOPs with large feasible regions, CHTII, which encompasses a dynamic resource allocation method and a coevolutionary method, is designed. The proposed framework is executed on extensive benchmark test suites. It has achieved superior or at least competitive performance compared with other state-of-the-art algorithms. Furthermore, the framework has been successfully implemented on the robotic manipulator path planning problem.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"90 ","pages":"Article 101685"},"PeriodicalIF":8.2000,"publicationDate":"2024-08-09","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/S2210650224002232","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

When evolutionary algorithms are employed to tackle constrained multiobjective optimization problems (CMOPs), constraint handling techniques (CHTs) play a pivotal role. To date, several CHTs have been designed, but they are only effective for certain types of constraint landscapes. For CMOPs with unknown properties, their optimization performance and efficiency remain uncertain. To tackle this issue, we attempt to mine and utilize the knowledge of constraint landscape to solve CMOPs. Specifically, the evolutionary process can be divided into three stages: learning stage, classification stage, and evolving stage. During the learning stage, the two populations, namely mainPop and auxPop, cooperatively evolve with and without considering constraints, respectively. The mainPop can locate the feasible regions, while the auxPop is employed to evaluate the size of the feasible regions. Subsequently, in the classification stage, based on the learned landscape knowledge, the category of problem can be determined: CMOP with small feasible regions or CMOP with large feasible regions. Then, in the evolving stage, for CMOPs with small feasible regions, CHTI, which includes a population exchange method and a feasible regions relaxation method, is proposed, while for CMOPs with large feasible regions, CHTII, which encompasses a dynamic resource allocation method and a coevolutionary method, is designed. The proposed framework is executed on extensive benchmark test suites. It has achieved superior or at least competitive performance compared with other state-of-the-art algorithms. Furthermore, the framework has been successfully implemented on the robotic manipulator path planning problem.

约束景观知识辅助约束多目标优化
当采用进化算法处理约束多目标优化问题(CMOPs)时,约束处理技术(CHTs)起着举足轻重的作用。迄今为止,人们已经设计出了多种约束处理技术,但它们只对某些类型的约束景观有效。对于属性未知的 CMOP,其优化性能和效率仍不确定。为解决这一问题,我们尝试挖掘并利用约束景观知识来求解 CMOP。具体来说,进化过程可分为三个阶段:学习阶段、分类阶段和进化阶段。在学习阶段,两个种群,即 和 ,分别在考虑约束和不考虑约束的情况下合作进化。可以定位可行区域,而则用于评估可行区域的大小。随后,在分类阶段,根据学习到的景观知识,可以确定问题的类别:可行区域小的 CMOP 或可行区域大的 CMOP。然后,在演化阶段,针对可行区域较小的 CMOP,提出了包含种群交换方法和可行区域松弛方法的 CHTI;针对可行区域较大的 CMOP,设计了包含动态资源分配方法和协同演化方法的 CHTII。所提出的框架在大量基准测试套件中得到了执行。与其他最先进的算法相比,它取得了优异的性能,至少是具有竞争力的性能。此外,该框架已成功应用于机器人机械手路径规划问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信