面向NMPSO在多目标优化中的最佳默认配置设置

Rodrigo Marinao-Rivas, M. Zambrano-Bigiarini
{"title":"面向NMPSO在多目标优化中的最佳默认配置设置","authors":"Rodrigo Marinao-Rivas, M. Zambrano-Bigiarini","doi":"10.1109/LA-CCI48322.2021.9769844","DOIUrl":null,"url":null,"abstract":"In this work we tested different configuration settings for the NMPSO algorithm, aiming at solving multi-objective optimization problems with a small number of function evaluations, which is an important aspect that must be addressed in real-world optimization problems. Sixteen different configurations were tested for NMPSO, with different combinations of: i) the swarm size, ii) the maximum number of particles in the external archive, and iii) the maximum amount of genetic operations in the external archive. Three DTLZ problems were used to select the best configuration, which was then evaluated against other state-of-the-art multi-objective optimization algorithms (MMOPSO, NSGA-II, NSGA-III). Our results showed that the fastest convergence towards the true Pareto-optimal front is provided by the configuration with a swarm size of 10, a maximum number of particles allowed in the external archive of 100, and a limit of genetic operations per iteration given by 50% of the maximum number of particles allowed in the external archive. The selected configuration was also very competitive or even superior against NSGA-II and NSGA-III, in terms of the number of function evaluations required to start having an HV larger than zero, but also in the HV values achieved after stabilization of the Pareto-optimal front.","PeriodicalId":431041,"journal":{"name":"2021 IEEE Latin American Conference on Computational Intelligence (LA-CCI)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Towards best default configuration settings for NMPSO in multi-objective optimization\",\"authors\":\"Rodrigo Marinao-Rivas, M. Zambrano-Bigiarini\",\"doi\":\"10.1109/LA-CCI48322.2021.9769844\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we tested different configuration settings for the NMPSO algorithm, aiming at solving multi-objective optimization problems with a small number of function evaluations, which is an important aspect that must be addressed in real-world optimization problems. Sixteen different configurations were tested for NMPSO, with different combinations of: i) the swarm size, ii) the maximum number of particles in the external archive, and iii) the maximum amount of genetic operations in the external archive. Three DTLZ problems were used to select the best configuration, which was then evaluated against other state-of-the-art multi-objective optimization algorithms (MMOPSO, NSGA-II, NSGA-III). Our results showed that the fastest convergence towards the true Pareto-optimal front is provided by the configuration with a swarm size of 10, a maximum number of particles allowed in the external archive of 100, and a limit of genetic operations per iteration given by 50% of the maximum number of particles allowed in the external archive. The selected configuration was also very competitive or even superior against NSGA-II and NSGA-III, in terms of the number of function evaluations required to start having an HV larger than zero, but also in the HV values achieved after stabilization of the Pareto-optimal front.\",\"PeriodicalId\":431041,\"journal\":{\"name\":\"2021 IEEE Latin American Conference on Computational Intelligence (LA-CCI)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE Latin American Conference on Computational Intelligence (LA-CCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LA-CCI48322.2021.9769844\",\"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 Latin American Conference on Computational Intelligence (LA-CCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LA-CCI48322.2021.9769844","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在这项工作中,我们测试了NMPSO算法的不同配置设置,旨在通过少量函数评估来解决多目标优化问题,这是现实世界优化问题中必须解决的一个重要方面。测试了16种不同的NMPSO配置,其中不同的组合为:i)群体大小,ii)外部档案中的最大粒子数,iii)外部档案中的最大遗传操作量。利用三个DTLZ问题选择最佳配置,然后与其他最先进的多目标优化算法(MMOPSO, NSGA-II, NSGA-III)进行评估。我们的结果表明,当群大小为10,外部存档中允许的最大粒子数为100,每次迭代的遗传操作限制为外部存档中允许的最大粒子数的50%时,可以最快地收敛到真正的帕累托最优前沿。所选择的配置与NSGA-II和NSGA-III相比,在开始时所需的HV大于零的功能评估次数方面,以及在稳定帕累托最优前沿后所获得的HV值方面,也非常具有竞争力甚至优于NSGA-II和NSGA-III。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards best default configuration settings for NMPSO in multi-objective optimization
In this work we tested different configuration settings for the NMPSO algorithm, aiming at solving multi-objective optimization problems with a small number of function evaluations, which is an important aspect that must be addressed in real-world optimization problems. Sixteen different configurations were tested for NMPSO, with different combinations of: i) the swarm size, ii) the maximum number of particles in the external archive, and iii) the maximum amount of genetic operations in the external archive. Three DTLZ problems were used to select the best configuration, which was then evaluated against other state-of-the-art multi-objective optimization algorithms (MMOPSO, NSGA-II, NSGA-III). Our results showed that the fastest convergence towards the true Pareto-optimal front is provided by the configuration with a swarm size of 10, a maximum number of particles allowed in the external archive of 100, and a limit of genetic operations per iteration given by 50% of the maximum number of particles allowed in the external archive. The selected configuration was also very competitive or even superior against NSGA-II and NSGA-III, in terms of the number of function evaluations required to start having an HV larger than zero, but also in the HV values achieved after stabilization of the Pareto-optimal front.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信