顶级双开发粒子群优化

IF 3.3 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Memetic Computing Pub Date : 2023-11-20 DOI:10.1007/s12293-023-00403-1
Chan Huang, Jinhao Yu, Junhui Yang
{"title":"顶级双开发粒子群优化","authors":"Chan Huang, Jinhao Yu, Junhui Yang","doi":"10.1007/s12293-023-00403-1","DOIUrl":null,"url":null,"abstract":"<p>This paper proposes top-level dual-exploitation particle swarm optimization (TLDEPSO), which aims to use the evolutionary experience between particles better and enhance the convergence performance of the algorithm. In TLDEPSO, the population is divided into top-level particles and ordinary particles according to fitness, and each iteration is divided into two stages to be executed. For the first stage, a particle modification method based on gene editing technology is proposed and applied to top-level particles to improve the search direction of the population and explore the problem space better. For other ordinary particles in the population, the learning strategy of the canonical ring neighborhood topology PSO is used to update the velocity and the position to maintain the diversity of the population. For the second stage, a top-level neighborhood exploration mechanism is proposed for top-level particles to accelerate the algorithm’s convergence. In addition, an adaptive dynamic adjustment mechanism for the parameters of acceleration coefficient, inertia coefficient and the number of top-level particles is proposed to balance better the global exploration and local exploitation capabilities of the algorithm. On the latest CEC2022 test benchmark, comparison and statistical analysis with seven advanced PSO variants and three CEC competition top algorithms demonstrate TLDEPSO’s superior performance in solving functional problems with different fitness landscapes.</p>","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":"13 3","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2023-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Top-level dual exploitation particle swarm optimization\",\"authors\":\"Chan Huang, Jinhao Yu, Junhui Yang\",\"doi\":\"10.1007/s12293-023-00403-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>This paper proposes top-level dual-exploitation particle swarm optimization (TLDEPSO), which aims to use the evolutionary experience between particles better and enhance the convergence performance of the algorithm. In TLDEPSO, the population is divided into top-level particles and ordinary particles according to fitness, and each iteration is divided into two stages to be executed. For the first stage, a particle modification method based on gene editing technology is proposed and applied to top-level particles to improve the search direction of the population and explore the problem space better. For other ordinary particles in the population, the learning strategy of the canonical ring neighborhood topology PSO is used to update the velocity and the position to maintain the diversity of the population. For the second stage, a top-level neighborhood exploration mechanism is proposed for top-level particles to accelerate the algorithm’s convergence. In addition, an adaptive dynamic adjustment mechanism for the parameters of acceleration coefficient, inertia coefficient and the number of top-level particles is proposed to balance better the global exploration and local exploitation capabilities of the algorithm. On the latest CEC2022 test benchmark, comparison and statistical analysis with seven advanced PSO variants and three CEC competition top algorithms demonstrate TLDEPSO’s superior performance in solving functional problems with different fitness landscapes.</p>\",\"PeriodicalId\":48780,\"journal\":{\"name\":\"Memetic Computing\",\"volume\":\"13 3\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2023-11-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-023-00403-1\",\"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-023-00403-1","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

为了更好地利用粒子间的进化经验,提高算法的收敛性能,提出了顶层双利用粒子群优化算法(TLDEPSO)。在TLDEPSO中,根据适应度将种群划分为顶级粒子和普通粒子,每次迭代分为两个阶段执行。第一阶段,提出基于基因编辑技术的粒子修饰方法,并将其应用于顶层粒子,提高种群的搜索方向,更好地探索问题空间。对于种群中的其他普通粒子,采用正则环邻域拓扑粒子群的学习策略更新速度和位置,以保持种群的多样性。第二阶段,提出了一种顶层粒子的顶层邻域探索机制,加快了算法的收敛速度。此外,为了更好地平衡算法的全局探索能力和局部开发能力,提出了加速度系数、惯性系数和顶层粒子数参数的自适应动态调整机制。在最新的CEC2022测试基准上,通过与7种先进的PSO变体和3种CEC竞争顶级算法的比较和统计分析,证明了TLDEPSO在解决不同适应度景观的功能问题上的优越性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Top-level dual exploitation particle swarm optimization

This paper proposes top-level dual-exploitation particle swarm optimization (TLDEPSO), which aims to use the evolutionary experience between particles better and enhance the convergence performance of the algorithm. In TLDEPSO, the population is divided into top-level particles and ordinary particles according to fitness, and each iteration is divided into two stages to be executed. For the first stage, a particle modification method based on gene editing technology is proposed and applied to top-level particles to improve the search direction of the population and explore the problem space better. For other ordinary particles in the population, the learning strategy of the canonical ring neighborhood topology PSO is used to update the velocity and the position to maintain the diversity of the population. For the second stage, a top-level neighborhood exploration mechanism is proposed for top-level particles to accelerate the algorithm’s convergence. In addition, an adaptive dynamic adjustment mechanism for the parameters of acceleration coefficient, inertia coefficient and the number of top-level particles is proposed to balance better the global exploration and local exploitation capabilities of the algorithm. On the latest CEC2022 test benchmark, comparison and statistical analysis with seven advanced PSO variants and three CEC competition top algorithms demonstrate TLDEPSO’s superior performance in solving functional problems with different fitness landscapes.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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