拓扑结构对动态矢量评估粒子群优化算法的影响

Mardé Helbig
{"title":"拓扑结构对动态矢量评估粒子群优化算法的影响","authors":"Mardé Helbig","doi":"10.1109/ISCMI.2016.43","DOIUrl":null,"url":null,"abstract":"Most real world problems have more than one objective, with at least two objectives in conflict with one another and at least one objective that is dynamic in nature. The dynamic vector evaluated particle swarm optimisation (DVEPSO) algorithm is a co-operative algorithm, where each sub-swarm solves only one objective function and therefore, each sub-swarm optimises only a sub-set of decision variables. Knowledge is shared amongst the sub-swarms when the particles' velocity is updated, by using the position of the global guide of the sub-swarm or of another sub-swarm. Each sub-swarm's entities are connected to one another according to a specific topology that determines the communication of particles with one another. This paper investigates the effect of using the star or Von Neumann topology for DVEPSO's sub-swarm's particles. The results indicate that the star topology performed the best with regards to accuracy and the Von Neumann topology performed the best with regards to stability. In addition, the Von Neumann topology performed the best on benchmarks with a non-linear Pareto-optimal set (POS) and in very fast changing environments.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Influence of Topologies on the Dynamic Vector Evaluated Particle Swarm Optimisation Algorithm\",\"authors\":\"Mardé Helbig\",\"doi\":\"10.1109/ISCMI.2016.43\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most real world problems have more than one objective, with at least two objectives in conflict with one another and at least one objective that is dynamic in nature. The dynamic vector evaluated particle swarm optimisation (DVEPSO) algorithm is a co-operative algorithm, where each sub-swarm solves only one objective function and therefore, each sub-swarm optimises only a sub-set of decision variables. Knowledge is shared amongst the sub-swarms when the particles' velocity is updated, by using the position of the global guide of the sub-swarm or of another sub-swarm. Each sub-swarm's entities are connected to one another according to a specific topology that determines the communication of particles with one another. This paper investigates the effect of using the star or Von Neumann topology for DVEPSO's sub-swarm's particles. The results indicate that the star topology performed the best with regards to accuracy and the Von Neumann topology performed the best with regards to stability. In addition, the Von Neumann topology performed the best on benchmarks with a non-linear Pareto-optimal set (POS) and in very fast changing environments.\",\"PeriodicalId\":417057,\"journal\":{\"name\":\"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCMI.2016.43\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCMI.2016.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

大多数现实世界的问题都有不止一个目标,至少有两个目标相互冲突,至少有一个目标本质上是动态的。动态向量评估粒子群优化算法(DVEPSO)是一种协作算法,其中每个子群只求解一个目标函数,因此每个子群只优化决策变量的子集。当粒子的速度更新时,通过使用子群或另一个子群的全局向导的位置,在子群之间共享知识。每个子群的实体根据特定的拓扑结构相互连接,该拓扑结构决定了粒子之间的通信。本文研究了使用星型拓扑或冯诺依曼拓扑对DVEPSO子群粒子的影响。结果表明,星型拓扑在精度方面表现最好,而冯诺依曼拓扑在稳定性方面表现最好。此外,Von Neumann拓扑在具有非线性pareto最优集(POS)的基准测试和非常快速变化的环境中表现最佳。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Influence of Topologies on the Dynamic Vector Evaluated Particle Swarm Optimisation Algorithm
Most real world problems have more than one objective, with at least two objectives in conflict with one another and at least one objective that is dynamic in nature. The dynamic vector evaluated particle swarm optimisation (DVEPSO) algorithm is a co-operative algorithm, where each sub-swarm solves only one objective function and therefore, each sub-swarm optimises only a sub-set of decision variables. Knowledge is shared amongst the sub-swarms when the particles' velocity is updated, by using the position of the global guide of the sub-swarm or of another sub-swarm. Each sub-swarm's entities are connected to one another according to a specific topology that determines the communication of particles with one another. This paper investigates the effect of using the star or Von Neumann topology for DVEPSO's sub-swarm's particles. The results indicate that the star topology performed the best with regards to accuracy and the Von Neumann topology performed the best with regards to stability. In addition, the Von Neumann topology performed the best on benchmarks with a non-linear Pareto-optimal set (POS) and in very fast changing environments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信