全局优化的利他异构粒子群优化算法

Fevzi Tugrul Varna, P. Husbands
{"title":"全局优化的利他异构粒子群优化算法","authors":"Fevzi Tugrul Varna, P. Husbands","doi":"10.1109/SSCI50451.2021.9660149","DOIUrl":null,"url":null,"abstract":"This paper introduces a new particle swarm optimisation variant: the altruistic heterogeneous particle swarm optimisation algorithm (AHPSO). The algorithm conceptualises particles as energy-driven agents with bio-inspired altruistic behaviour. In our approach, particles possess a current energy level and an activation threshold and are in one of two possible states (active or inactive) depending on their energy levels at time t. The idea of altruism is used to form lending-borrowing relationships among particles to change an agent's state from inactive to active, and the main search mechanism exploits this idea. Diversity in the swarm, which prevent premature convergence, is maintained via agent states and the level of altruistic behaviour particles exhibit. The performance of AHPSO was compared with 11 metaheuristics and 12 state-of-the-art PSO variants using the CEC'17 and CEC'05 test suites at 30 and 50 dimensions. The AHPSO algorithm outperformed all 23 comparison algorithms on both benchmark test suites at both 30 and 50 dimensions.","PeriodicalId":255763,"journal":{"name":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"AHPSO: Altruistic Heterogeneous Particle Swarm Optimisation Algorithm for Global Optimisation\",\"authors\":\"Fevzi Tugrul Varna, P. Husbands\",\"doi\":\"10.1109/SSCI50451.2021.9660149\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a new particle swarm optimisation variant: the altruistic heterogeneous particle swarm optimisation algorithm (AHPSO). The algorithm conceptualises particles as energy-driven agents with bio-inspired altruistic behaviour. In our approach, particles possess a current energy level and an activation threshold and are in one of two possible states (active or inactive) depending on their energy levels at time t. The idea of altruism is used to form lending-borrowing relationships among particles to change an agent's state from inactive to active, and the main search mechanism exploits this idea. Diversity in the swarm, which prevent premature convergence, is maintained via agent states and the level of altruistic behaviour particles exhibit. The performance of AHPSO was compared with 11 metaheuristics and 12 state-of-the-art PSO variants using the CEC'17 and CEC'05 test suites at 30 and 50 dimensions. The AHPSO algorithm outperformed all 23 comparison algorithms on both benchmark test suites at both 30 and 50 dimensions.\",\"PeriodicalId\":255763,\"journal\":{\"name\":\"2021 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSCI50451.2021.9660149\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSCI50451.2021.9660149","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文介绍了一种新的粒子群优化算法:利他异构粒子群优化算法(AHPSO)。该算法将粒子概念化为具有生物启发的利他行为的能量驱动代理。在我们的方法中,粒子拥有当前的能量水平和激活阈值,并且根据它们在时刻t的能量水平处于两种可能的状态(活跃或不活跃)之一。利他主义的思想用于形成粒子之间的借贷关系,以将代理的状态从不活跃改变为活跃,主要的搜索机制利用了这一思想。群体中的多样性可以防止过早的趋同,这种多样性是通过个体状态和粒子表现出的利他行为水平来维持的。使用CEC'17和CEC'05测试套件在30和50个维度上对AHPSO的性能与11个元启发式和12个最先进的PSO变体进行了比较。AHPSO算法在30和50个维度的基准测试套件上都优于所有23种比较算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
AHPSO: Altruistic Heterogeneous Particle Swarm Optimisation Algorithm for Global Optimisation
This paper introduces a new particle swarm optimisation variant: the altruistic heterogeneous particle swarm optimisation algorithm (AHPSO). The algorithm conceptualises particles as energy-driven agents with bio-inspired altruistic behaviour. In our approach, particles possess a current energy level and an activation threshold and are in one of two possible states (active or inactive) depending on their energy levels at time t. The idea of altruism is used to form lending-borrowing relationships among particles to change an agent's state from inactive to active, and the main search mechanism exploits this idea. Diversity in the swarm, which prevent premature convergence, is maintained via agent states and the level of altruistic behaviour particles exhibit. The performance of AHPSO was compared with 11 metaheuristics and 12 state-of-the-art PSO variants using the CEC'17 and CEC'05 test suites at 30 and 50 dimensions. The AHPSO algorithm outperformed all 23 comparison algorithms on both benchmark test suites at both 30 and 50 dimensions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Voice Dialog System for Simulated Patient Robot and Detection of Interviewer Nodding Deep Learning Approaches to Remaining Useful Life Prediction: A Survey Evaluation of Graph Convolutions for Spatio-Temporal Predictions of EV-Charge Availability Balanced K-means using Quantum annealing A Study of Transfer Learning in a Generation Constructive Hyper-Heuristic for One Dimensional Bin Packing
×
引用
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