多目标问题的基于参考点的多群算法

André Britto, A. Pozo
{"title":"多目标问题的基于参考点的多群算法","authors":"André Britto, A. Pozo","doi":"10.1109/BRACIS.2015.19","DOIUrl":null,"url":null,"abstract":"Many-Objective Optimization Problems (MaOPs) are problems that have more than three objectives to be optimized. Usually, the state-of-art of Multi-Objective Evolutionary algorithms scale poorly when the number of objective functions increases. To overcome this limitation, researches are investigating multi-swarm approaches. Besides, another newly strategy is the use of reference points to enhance the search of the algorithms. Based on those strategies, this work proposes a new multi-swarm algorithm, called Reference-Point Based Multi-Swarm Algorithm, R-Multi, which takes advantages of reference points to guide a multi-swarm search. The main idea is to use reference points to guide the search towards the Pareto front and to perform the communication between swarms allowing the necessary collaboration to have an effective exploration of the search space. Furthermore, this work presents a set of experiments that compare R-Multi to others multi-swarm algorithms and to MOEA/D-DRA. The algorithms are evaluated in several MaOPs observing both convergence and diversity. The results shows the validity of the proposed algorithm and stresses the good results of multi-swarm approaches in Many-Objective Optimization.","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Reference-Point Based Multi-swarm Algorithm for Many-Objective Problems\",\"authors\":\"André Britto, A. Pozo\",\"doi\":\"10.1109/BRACIS.2015.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many-Objective Optimization Problems (MaOPs) are problems that have more than three objectives to be optimized. Usually, the state-of-art of Multi-Objective Evolutionary algorithms scale poorly when the number of objective functions increases. To overcome this limitation, researches are investigating multi-swarm approaches. Besides, another newly strategy is the use of reference points to enhance the search of the algorithms. Based on those strategies, this work proposes a new multi-swarm algorithm, called Reference-Point Based Multi-Swarm Algorithm, R-Multi, which takes advantages of reference points to guide a multi-swarm search. The main idea is to use reference points to guide the search towards the Pareto front and to perform the communication between swarms allowing the necessary collaboration to have an effective exploration of the search space. Furthermore, this work presents a set of experiments that compare R-Multi to others multi-swarm algorithms and to MOEA/D-DRA. The algorithms are evaluated in several MaOPs observing both convergence and diversity. The results shows the validity of the proposed algorithm and stresses the good results of multi-swarm approaches in Many-Objective Optimization.\",\"PeriodicalId\":416771,\"journal\":{\"name\":\"2015 Brazilian Conference on Intelligent Systems (BRACIS)\",\"volume\":\"2016 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Brazilian Conference on Intelligent Systems (BRACIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BRACIS.2015.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRACIS.2015.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

多目标优化问题(MaOPs)是具有三个以上目标的优化问题。通常,当目标函数数量增加时,现有的多目标进化算法的可扩展性较差。为了克服这一限制,研究人员正在研究多群方法。此外,另一种新的策略是使用参考点来增强算法的搜索能力。在此基础上,本文提出了一种新的多群算法,即基于参考点的多群算法(R-Multi),该算法利用参考点来指导多群搜索。主要思想是使用参考点来引导搜索到帕累托前沿,并执行群之间的通信,允许必要的协作来有效地探索搜索空间。此外,本工作提出了一组实验,将R-Multi与其他多群算法以及MOEA/D-DRA进行比较。在几个MaOPs中对算法进行了评估,同时观察了收敛性和多样性。结果表明了所提算法的有效性,并强调了多群方法在多目标优化中的良好效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reference-Point Based Multi-swarm Algorithm for Many-Objective Problems
Many-Objective Optimization Problems (MaOPs) are problems that have more than three objectives to be optimized. Usually, the state-of-art of Multi-Objective Evolutionary algorithms scale poorly when the number of objective functions increases. To overcome this limitation, researches are investigating multi-swarm approaches. Besides, another newly strategy is the use of reference points to enhance the search of the algorithms. Based on those strategies, this work proposes a new multi-swarm algorithm, called Reference-Point Based Multi-Swarm Algorithm, R-Multi, which takes advantages of reference points to guide a multi-swarm search. The main idea is to use reference points to guide the search towards the Pareto front and to perform the communication between swarms allowing the necessary collaboration to have an effective exploration of the search space. Furthermore, this work presents a set of experiments that compare R-Multi to others multi-swarm algorithms and to MOEA/D-DRA. The algorithms are evaluated in several MaOPs observing both convergence and diversity. The results shows the validity of the proposed algorithm and stresses the good results of multi-swarm approaches in Many-Objective Optimization.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Hyper-Heuristic for the Environmental/Economic Dispatch Optimization Problem Evaluating Methods for Constant Optimization of Symbolic Regression Benchmark Problems A Set-Medoids Vector Batch SOM Algorithm Based on Multiple Dissimilarity Matrices Desire: A Dynamic Approach for Exploratory Search Results Recommendation Dyna-MLAC: Trading Computational and Sample Complexities in Actor-Critic Reinforcement Learning
×
引用
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