An archive-assisted multi-modal multi-objective evolutionary algorithm

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Swarm and Evolutionary Computation Pub Date : 2024-10-11 DOI:10.1016/j.swevo.2024.101738
Peng Chen , Zhimeng Li , Kangjia Qiao , P.N. Suganthan , Xuanxuan Ban , Kunjie Yu , Caitong Yue , Jing Liang
{"title":"An archive-assisted multi-modal multi-objective evolutionary algorithm","authors":"Peng Chen ,&nbsp;Zhimeng Li ,&nbsp;Kangjia Qiao ,&nbsp;P.N. Suganthan ,&nbsp;Xuanxuan Ban ,&nbsp;Kunjie Yu ,&nbsp;Caitong Yue ,&nbsp;Jing Liang","doi":"10.1016/j.swevo.2024.101738","DOIUrl":null,"url":null,"abstract":"<div><div>The multi-modal multi-objective optimization problems (MMOPs) pertain to characteristic of the decision space that exhibit multiple sets of Pareto optimal solutions that are either identical or similar. The resolution of these problems necessitates the utilization of optimization algorithms to locate multiple Pareto sets (PSs). However, existing multi-modal multi-objective evolutionary algorithms (MMOEAs) encounter difficulties in concurrently enhancing solution quality in both decision space and objective space. In order to deal with this predicament, this paper presents an Archive-assisted Multi-modal Multi-objective Evolutionary Algorithm, called A-MMOEA. This algorithm maintains a main population and an external archive, which is leveraged to improve the fault tolerance of individual screening. To augment the quality of solutions in the archive, an archive evolution mechanism (AEM) is formulated for updating the archive and an archive output mechanism (AOM) is used to output the final solutions. Both mechanisms incorporate a comprehensive crowding distance metric that employs objective space crowding distance to facilitate the calculation of decision space crowding distance. Besides, a data screening method is employed in the AOM to alleviate the negative impact on the final results arising from undesirable individuals resulting from diversity search. Finally, in order to enable individuals to effectively escape the limitation of niches and further enhance diversity of population, a diversity search method with level-based evolution mechanism (DSMLBEM) is proposed. The proposed algorithm’s performance is evaluated through extensive experiments conducted on two distinct test sets. Final results indicate that, in comparison to other commonly used algorithms, this approach exhibits favorable performance.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101738"},"PeriodicalIF":8.2000,"publicationDate":"2024-10-11","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/S2210650224002761","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

The multi-modal multi-objective optimization problems (MMOPs) pertain to characteristic of the decision space that exhibit multiple sets of Pareto optimal solutions that are either identical or similar. The resolution of these problems necessitates the utilization of optimization algorithms to locate multiple Pareto sets (PSs). However, existing multi-modal multi-objective evolutionary algorithms (MMOEAs) encounter difficulties in concurrently enhancing solution quality in both decision space and objective space. In order to deal with this predicament, this paper presents an Archive-assisted Multi-modal Multi-objective Evolutionary Algorithm, called A-MMOEA. This algorithm maintains a main population and an external archive, which is leveraged to improve the fault tolerance of individual screening. To augment the quality of solutions in the archive, an archive evolution mechanism (AEM) is formulated for updating the archive and an archive output mechanism (AOM) is used to output the final solutions. Both mechanisms incorporate a comprehensive crowding distance metric that employs objective space crowding distance to facilitate the calculation of decision space crowding distance. Besides, a data screening method is employed in the AOM to alleviate the negative impact on the final results arising from undesirable individuals resulting from diversity search. Finally, in order to enable individuals to effectively escape the limitation of niches and further enhance diversity of population, a diversity search method with level-based evolution mechanism (DSMLBEM) is proposed. The proposed algorithm’s performance is evaluated through extensive experiments conducted on two distinct test sets. Final results indicate that, in comparison to other commonly used algorithms, this approach exhibits favorable performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
档案辅助多模式多目标进化算法
多模式多目标优化问题(MMOPs)与决策空间的特征有关,这些决策空间呈现出多组相同或相似的帕累托最优解。要解决这些问题,就必须利用优化算法来找到多个帕累托最优解集(PSs)。然而,现有的多模式多目标进化算法(MMOEAs)在同时提高决策空间和目标空间的解决方案质量方面遇到了困难。为了解决这一难题,本文提出了一种档案辅助多模式多目标进化算法,称为 A-MMOEA。该算法拥有一个主群体和一个外部档案,可用于提高单个筛选的容错性。为了提高存档中解决方案的质量,制定了存档进化机制(AEM)来更新存档,并使用存档输出机制(AOM)来输出最终解决方案。这两种机制都采用了全面的拥挤距离度量,利用目标空间拥挤距离来促进决策空间拥挤距离的计算。此外,AOM 还采用了一种数据筛选方法,以减轻多样性搜索产生的不良个体对最终结果的负面影响。最后,为了使个体有效摆脱龛位的限制,进一步提高种群的多样性,提出了一种基于水平进化机制的多样性搜索方法(DSMLBEM)。通过在两个不同的测试集上进行大量实验,对所提出算法的性能进行了评估。最终结果表明,与其他常用算法相比,该方法表现出良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
A survey on vehicle–drone cooperative delivery operations optimization: Models, methods, and future research directions Bayesian network structure learning based on discrete artificial jellyfish search: Leveraging scoring and graphical properties A learning-based memetic algorithm for energy-efficient distributed flow-shop scheduling with preventive maintenance Provable space discretization based evolutionary search for scalable multi-objective security games Multi-Objective Optimization for Distributed Generator and Shunt Capacitor Placement Considering Voltage-Dependent Nonlinear Load Models
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1