基于分布式个体的多模式多目标优化差分进化算法

IF 3.3 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Memetic Computing Pub Date : 2024-06-20 DOI:10.1007/s12293-024-00413-7
Wei Wang, Zhifang Wei, Tianqi Huang, Xiaoli Gao, Weifeng Gao
{"title":"基于分布式个体的多模式多目标优化差分进化算法","authors":"Wei Wang, Zhifang Wei, Tianqi Huang, Xiaoli Gao, Weifeng Gao","doi":"10.1007/s12293-024-00413-7","DOIUrl":null,"url":null,"abstract":"<p>There may exist a one-to-many mapping between objective and decision spaces in multimodal multi-objective optimization problems (MMOPs), which requires the evolutionary algorithm to locate multiple non-dominated solution sets. In order to enhance the diversity of the population, we develop a multimodal multi-objective differential evolution algorithm based on distributed individuals and lifetime mechanism. First, every individual can be seen as a distributed unit to locate multiple non-dominated solutions. The solutions with the good diversity are generated by adopting virtual population, and the range of virtual population is adjusted by an adaptive adjustment strategy to locate more non-dominated solutions. Second, it is considered that each individual has a limited lifespan inspired by natural phenomenon. As the search area of individuals becoming adaptively smaller, the individuals with good quality are archived and they can reinitialize with a new lifespan for enhancing diversity of the search space. Then the probability selection strategy is applied in the environment selection to balance exploration and exploitation. The test results on 22 multimodal multi-objective benchmark test functions verify the superior performance of the proposed method.</p>","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":"19 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A distributed individuals based multimodal multi-objective optimization differential evolution algorithm\",\"authors\":\"Wei Wang, Zhifang Wei, Tianqi Huang, Xiaoli Gao, Weifeng Gao\",\"doi\":\"10.1007/s12293-024-00413-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>There may exist a one-to-many mapping between objective and decision spaces in multimodal multi-objective optimization problems (MMOPs), which requires the evolutionary algorithm to locate multiple non-dominated solution sets. In order to enhance the diversity of the population, we develop a multimodal multi-objective differential evolution algorithm based on distributed individuals and lifetime mechanism. First, every individual can be seen as a distributed unit to locate multiple non-dominated solutions. The solutions with the good diversity are generated by adopting virtual population, and the range of virtual population is adjusted by an adaptive adjustment strategy to locate more non-dominated solutions. Second, it is considered that each individual has a limited lifespan inspired by natural phenomenon. As the search area of individuals becoming adaptively smaller, the individuals with good quality are archived and they can reinitialize with a new lifespan for enhancing diversity of the search space. Then the probability selection strategy is applied in the environment selection to balance exploration and exploitation. The test results on 22 multimodal multi-objective benchmark test functions verify the superior performance of the proposed method.</p>\",\"PeriodicalId\":48780,\"journal\":{\"name\":\"Memetic Computing\",\"volume\":\"19 1\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-06-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-00413-7\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Memetic Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12293-024-00413-7","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

在多模态多目标优化问题(MMOPs)中,目标空间和决策空间之间可能存在一对多的映射,这就要求进化算法找到多个非支配解集。为了增强种群的多样性,我们开发了一种基于分布式个体和寿命机制的多模态多目标差分进化算法。首先,每个个体都可以看作是一个分布式单元,用来定位多个非主导解。采用虚拟种群生成具有良好多样性的解,并通过自适应调整策略来调整虚拟种群的范围,从而找到更多的非主导解。其次,受自然现象启发,考虑到每个个体的寿命有限。当个体的搜索区域逐渐变小时,质量好的个体会被存档,并以新的寿命重新初始化,以提高搜索空间的多样性。然后在环境选择中采用概率选择策略,以平衡探索和开发。对 22 个多模态多目标基准测试函数的测试结果验证了所提方法的优越性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A distributed individuals based multimodal multi-objective optimization differential evolution algorithm

There may exist a one-to-many mapping between objective and decision spaces in multimodal multi-objective optimization problems (MMOPs), which requires the evolutionary algorithm to locate multiple non-dominated solution sets. In order to enhance the diversity of the population, we develop a multimodal multi-objective differential evolution algorithm based on distributed individuals and lifetime mechanism. First, every individual can be seen as a distributed unit to locate multiple non-dominated solutions. The solutions with the good diversity are generated by adopting virtual population, and the range of virtual population is adjusted by an adaptive adjustment strategy to locate more non-dominated solutions. Second, it is considered that each individual has a limited lifespan inspired by natural phenomenon. As the search area of individuals becoming adaptively smaller, the individuals with good quality are archived and they can reinitialize with a new lifespan for enhancing diversity of the search space. Then the probability selection strategy is applied in the environment selection to balance exploration and exploitation. The test results on 22 multimodal multi-objective benchmark test functions verify the superior performance of the proposed method.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
ResGAT: Residual Graph Attention Networks for molecular property prediction Enhancing online yard crane scheduling through a two-stage rollout memetic genetic programming Proximal evolutionary strategy: improving deep reinforcement learning through evolutionary policy optimization Where does the crude oil originate? The role of near-infrared spectroscopy in accurate source detection Bootstrap contrastive domain adaptation
×
引用
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